63 Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors.
12 Universality and Tolerance.
42 Extracting Randomness via Repeated Condensing.
38 Extracting Randomness from Samplable Distributions.
44 Pseudorandom Generators in Propositional Proof Complexity.
224 Random graph models for the web graph.
44 Optimization Problems in Congestion Control.
25 Fairness Measures for Resource Allocation.
61 On the Approximability of Trade-offs and Optimal Access of Web Sources.
459 How Bad is Selfish Routing?
69 A polylogarithmic approximation of the minimum bisection.
4 Approximability and in-approximability results for no-wait shop scheduling.
3 Nested Graph Dissection and Approximation Algorithms.
22 Approximating the single source unsplittable min-cost flow problem.
36 Hardness of Approximate Hypergraph Coloring.
24 "Soft-decision" Decoding of Chinese Remainder Codes.
49 Super-linear time-space tradeoff lower bounds for randomized computation.
27 On the Hardness of Graph Isomorphism.
156 Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation.
36 New Data Structures for Orthogonal Range Searching.
8 Nearly Optimal Expected-Case Planar Point Location.
25 On Levels in Arrangements of Curves.
13 Detecting a Network Failure.
52 Testing of Clustering.
34 Testing of Functions that have small width Branching Programs.
32 Testing that distributions are close.
10 Using Upper Confidence Bounds for Online Learning.
50 Zaps and Their Applications.
38 Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation.
29 Lower Bounds on the Efficiency of Generic Cryptographic Constructions.
21 Concurrent Oblivious Transfer.
39 The Relationship between Public Key Encryption and Oblivious Transfer.
84 The Online Median Problem.
29 Polynomial Time Approximation Schemes for Geometric k-Clustering.
265 Clustering Data Streams.
183 On Clusterings - Good, Bad and Spectral.
55 Fully Dynamic Transitive Closure: Breaking Through the O(n^2) Barrier
126 Opportunistic Data Structures with Applications.
98 Cache-Oblivious B-Trees.
10 Using Expander Graphs to Find Vertex Connectivity.
9 On the boundary complexity of the union of fat triangles.
73 Straighting Polygonal Arcs and Convexifying Polygonal Cycles.
107 A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning.
119 Topological Persistence and Simplification.
6 The Cover Time, the Blanket Time, and the Matthews Bound.
13 The product replacement algorithm is polynomial.
23 Efficient Algorithms for Universal Portfolios.
23 Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method.
7 The Randomness Recycler: A New Technique for Perfect Sampling.
42 An Improved Quantum Fourier Transform Algorithm and Applications.
48 Fast parallel circuits for the quantum Fourier transform.
50 Succinct quantum proofs for properties of finite groups.
35 Private Quantum Channels.
4 The Quantum Complexity of Set Membership.
117 Randomized Rumor Spreading.
80 Fast Broadcasting and Gossiping in Radio Networks.
9 Linear Waste of Best Fit Bin Packing on Skewed Distributions.
51 Optimal myopic algorithms for random 3-SAT.
61 Hierarchical Placement and Network Design Problems.
55 Building Steiner Trees with Incomplete Global Knowledge.
45 Cost-Distance: Two Metric Network Design.
10 Combinatorial feature selection problems.
46 The Common Fragment of CTL and LTL.
7 On the Existence of Booster Types.
23 Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.
40 Computing the Determinant and Smith Form of an Integer Matrix.