Cs-Ds
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
Speeding up shortest path algorithms
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
On Range Searching with Semialgebraic Sets II
Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets
Faster Clustering via Preprocessing
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time
Fuel Efficient Computation in Passive Self-Assembly
The simplex method is strongly polynomial for deterministic Markov decision processes
Efficient Algorithms for Maximum Link Scheduling in Distributed Computing Models with SINR Constraints
Applying CEGAR to the Petri Net State Equation
Hamming Approximation of NP Witnesses
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
Privacy via the Johnson-Lindenstrauss Transform
Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models
A memory versus compression ratio trade-off in PPM via compressed context modeling
Joint Cache Partition and Job Assignment on Multi-Core Processors
Energy Aware, Scalable, K-Hop Based Cluster Formation In MANET
Obtaining Planarity by Contracting Few Edges
Improved Lower Bounds on the Compatibility of Multi-State Characters
Optimal Private Halfspace Counting via Discrepancy
