27 Succinct ordinal trees with level-ancestor queries.
6 Compact representations of ordered sets.
12 Tight bounds for the partial-sums problem.
19 The Bloomier filter: an efficient data structure for static support lookup tables.
3 Meldable RAM priority queues and minimum directed spanning trees.
6 Finding a long directed cycle.
11 A new algorithm for normal dominance constraints.
15 Rank-maximal matchings.
11 Network failure detection and graph connectivity.
3 The directed circular arrangement problem.
10 Variable length path coupling.
7 Linear phase transition in random linear constraint satisfaction problems.
20 Quantitative stochastic parity games.
1 On distributions computable by random walks on graphs.
4 Exponential bounds for DPLL below the satisfiability threshold.
2 Who says you have to look at the input? The brave new world of sublinear computing.
50 Complexity classification of network information flow problems.
10 An improved data stream algorithm for frequency moments.
4 Efficient estimation algorithms for neighborhood variance and other moments.
8 Optimal space lower bounds for all frequency moments.
32 Optimal routing in Chord.
22 Approximation schemes for multidimensional packing.
17 New approximability and inapproximability results for 2-dimensional Bin Packing.
16 On rectangle packing: maximizing benefits.
14 Optimal online bounded space multidimensional packing.
7 Windows scheduling as a restricted version of Bin Packing.
0 Special edges, and approximating the smallest directed <i>k</i>-edge connected spanning subgraph.
9 On colorings of squares of outerplanar graphs.
4 Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.
10 Approximating Minimum Max-Stretch spanning Trees on unweighted graphs.
16 Approximate distance oracles for unweighted graphs in &Otilde;(n<sup>2</sup>) time.
4 Retroactive data structures.
4 Proximity Mergesort: optimal in-place sorting in the cache-oblivious model.
3 The number of bit comparisons used by Quicksort: an average-case analysis.
6 Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time.
17 The hyperring: a low-congestion deterministic data structure for distributed environments.
45 Improved upper bounds for 3-SAT.
1 Locally satisfiable formulas.
6 A stronger bound on Braess's Paradox.
6 Multicommodity facility location.
5 SRPT optimally utilizes faster machines to minimize flow time.
15 A faster distributed protocol for constructing a minimum spanning tree.
17 Experimental analysis of dynamic all pairs shortest path algorithms.
22 Graph decomposition and a greedy algorithm for edge-disjoint paths.
12 Models of greedy algorithms for graph problems.
22 The list partition problem for graphs.
8 A time efficient Delaunay refinement algorithm.
13 Almost-Delaunay simplices: nearest neighbor relations for imprecise points.
4 Output-sensitive construction of the union of triangles.
21 An optimal randomized algorithm for maximum Tukey depth.
1 Minimizing the stabbing number of matchings, trees, and triangulations.
6 Adaptive sampling for quickselect.
16 Fast mixing for independent sets, colorings and other models on trees.
0 Slow mixing of Glauber dynamics for the hard-core model on the hypercube.
11 Probabilistic analysis of knapsack core algorithms.
5 Torpid mixing of simulated tempering on the Potts model.
1 Minimum moment Steiner trees.
7 Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
1 Approximation schemes for Metric Bisection and partitioning.
2 Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks.
20 Correlation Clustering: maximizing agreements via semidefinite programming.
0 Quantum computing.
2 Interpolation search for non-independent data.
18 Dynamizing static algorithms, with applications to dynamic trees and history independence.
3 Caching queues in memory buffers.
41 LAND: stretch (1 + epsilon) locality-aware networks for DHTs.
12 A note on the nearest neighbor in growth-restricted metrics.
9 Buffer minimization using max-coloring.
1 On minimizing the total flow time on multiple machines.
10 Matrix rounding and approximation.
10 A general approach to online network optimization problems.
8 Approximate local search in combinatorial optimization.
0 Trade-offs on the location of the core node in a network.
1 On the convergence time of a path-vector protocol.
15 Tabulation based 4-universal hashing with applications to second moment estimation.
0 Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem.
2 Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
32 When indexing equals compression: experiments with compressing suffix arrays and applications.
6 Approximate Nearest Neighbor under edit distance via product metrics.
0 Fast approximate pattern matching with few indels via embeddings.
2 Lyndon words with a fixed standard right factor.
10 Compression boosting in optimal linear time using the Burrows-Wheeler Transform.
3 Dimension reduction for ultrametrics.
3 Randomized <i>k</i>-server algorithms for growth-rate bounded graphs.
8 The pure literal rule threshold and cores in random hypergraphs.
2 Efficient algorithms for bichromatic separability.
41 On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems.
27 Frugality in path auctions.
5 An exact subexponential-time lattice algorithm for Asian options.
13 Structural and algorithmic aspects of massive social networks.
3 A determinant-based algorithm for counting perfect matchings in a general graph.
4 On the number of rectangular partitions.
10 Computing equilibria for congestion games with (im)perfect information.
2 Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates.
3 Algorithms for infinite huffman-codes.
9 A certifying algorithm for the consecutive-ones property.
20 Generic quantum Fourier transforms.
14 Quasiconvex analysis of backtracking algorithms.
52 Navigating nets: simple algorithms for proximity search.
7 Approximating the two-level facility location problem via a quasi-greedy approach.
9 A maiden analysis of Longest Wait First.
3 A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.
0 Subexponential parameterized algorithms on graphs of bounded-genus and <i>H</i>-minor-free graphs.
19 Equivalence of local treewidth and linear local treewidth and its algorithmic applications.
8 Hole and antihole detection in graphs.
4 Testing bipartiteness of geometric intersection graphs.
8 Finding dominators revisited: extended abstract.
0 How random is the human genome?
16 Complexities for generalized models of self-assembly.
11 Invadable self-assembly: combining robustness with efficiency.
1 On contract-and-refine transformations between phylogenetic trees.
4 Reconstructing strings from random traces.
11 Improved bounds on sorting with length-weighted reversals.
3 Point containment in the integer hull of a polyhedron.
2 Covering minimum spanning trees of random subgraphs.
8 A characterization of easily testable induced subgraphs.
6 Bipartite roots of graphs.
8 Two tricks to triangulate chordal probe graphs in polynomial time.
7 Non-migratory online deadline scheduling on multiprocessors.
19 The maximum latency of selfish routing.
1 Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
15 The wake-up problem in multi-hop radio networks.
14 A fast approximation scheme for fractional covering problems with variable upper bounds.
14 On broadcasting in heterogenous networks.
18 End-to-end packet-scheduling in wireless ad-hoc networks.
4 Routing and scheduling in multihop wireless networks with time-varying channels.
1 Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ.
3 Fair and efficient router congestion control.
10 Randomized pursuit-evasion with limited visibility.
16 Fault-tolerant gathering algorithms for autonomous mobile robots.
10 Approximate classification via earthmover metrics.
10 Facility location with Service Installation Costs.
13 On finding a guard that sees most and a shop that sells most.
3 On the diameter of the symmetric group: polynomial bounds.
26 The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.
0 Simultaneous diophantine approximation with excluded primes.
2 Constructing finite field extensions with large order elements.
3 Polynomial interpolation from multiples.