The following pages link to ACM Transactions on Algorithms (Q2799475):
Displayed 50 items.
- Faster spectral sparsification and numerical algorithms for SDD matrices (Q89555) (← links)
- The complexity of cake cutting with unequal shares (Q1617637) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (Q2799477) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Minimum Latency Submodular Cover (Q2843274) (← links)
- Faster Fully Compressed Pattern Matching by Recompression (Q2843278) (← links)
- Approximation Algorithms for Movement Repairmen (Q2851859) (← links)
- Foreword to special issue on SODA 2007 (Q2930246) (← links)
- Making deterministic signatures quickly (Q2930248) (← links)
- Compacting cuts (Q2930250) (← links)
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions (Q2930252) (← links)
- Squarepants in a tree (Q2930253) (← links)
- Minimizing movement (Q2930255) (← links)
- An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256) (← links)
- Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257) (← links)
- Instability of FIFO in the permanent sessions model at arbitrarily small network loads (Q2930258) (← links)
- Approximation algorithms for data placement on parallel disks (Q2930259) (← links)
- Sublinear estimation of entropy and information distances (Q2930260) (← links)
- A generalized minimum cost <i>k</i> -clustering (Q2930261) (← links)
- Bootstrapping a hop-optimal network in the weak sensor model (Q2930263) (← links)
- All maximal independent sets and dynamic dominance for sparse graphs (Q2930264) (← links)
- A linear-time algorithm to find a separator in a graph excluding a minor (Q2930265) (← links)
- Enumeration of isolated cliques and pseudo-cliques (Q2930266) (← links)
- A better approximation ratio for the vertex cover problem (Q2930267) (← links)
- A linear algorithm for computing convex hulls for random lines (Q2930268) (← links)
- Randomized fast design of short DNA words (Q2930269) (← links)
- Parametric analysis for ungapped Markov models of evolution (Q2930271) (← links)
- Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (Q2930272) (← links)
- Low-dimensional lattice basis reduction revisited (Q2930273) (← links)
- Resilient dictionaries (Q2930274) (← links)
- An optimal decomposition algorithm for tree edit distance (Q2930275) (← links)
- Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts (Q2930276) (← links)
- Updating relaxed <i>K</i> -d trees (Q2930277) (← links)
- Approximating connectivity augmentation problems (Q2930278) (← links)
- Low distortion spanners (Q2930280) (← links)
- Minimum cycle bases (Q2930281) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- Optimizing throughput and energy in online deadline scheduling (Q2930284) (← links)
- Admission control to minimize rejections and online set cover with repetitions (Q2930285) (← links)
- Jitter regulation for multiple streams (Q2930287) (← links)
- Latency-constrained aggregation in sensor networks (Q2930288) (← links)
- Time-dependent multi-scheduling of multicast (Q2930289) (← links)
- Improved online algorithms for the sorting buffer problem on line metrics (Q2930290) (← links)
- Simultaneous source location (Q2930292) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- Approximating the minimum quadratic assignment problems (Q2930294) (← links)
- Quantum algorithms for Simon's problem over nonabelian groups (Q2930295) (← links)
- Computing rank-convolutions with a mask (Q2930296) (← links)