Cs-Ds
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
An Exploratory Study of Critical Factors Affecting the Efficiency of Sorting Techniques (Shell, Heap and Treap)
Division algorithms for the fixed weight subset sum problem
An improved formalism for the Grover search algorithm
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
Fixed-parameter tractability of multicut in directed acyclic graphs
Non-Interference and Local Correctness in Transactional Memory
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
Abstract unordered and ordered trees CRDT
An optimized conflict-free replicated set
Dictionary learning under global sparsity constraint
Computing L1 Shortest Paths among Polygonal Obstacles in the Plane
Core stability in hedonic coalition formation
Approximate Maximum Flow on Separable Undirected Graphs
Quick Detection of Nodes with Large Degrees
Approximating Sparse Covering Integer Programs Online
Efficient Algorithms for Zeckendorf Arithmetic
Converting online algorithms to local computation algorithms
Optimal Covering with Mobile Sensors in an Unbounded Region
An n log n Alogrithm for Deterministic Kripke Structure Minimization
Balls into Bins: strict Capacities and Edge Weights
Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
