19 Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms.
21 I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
12 Motion Planning of a Ball Amid Segments in Three Dimensions.
37 Page Replacement for General Caching Problems.
24 A New Way to Use Semidefinite Programming with Applications to Linear Equations mod <i>p</i>.
23 A Practical Clustering Algorithm for Static and Dynamic Information Organization.
4 Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.
12 Using Homogenous Weights for Approximating the Partial Cover Problem.
0 A Lower Bound for Hellbronn's Triangle Problem in <i>d</i> Dimensions.
68 Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions.
6 Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks.
38 Kinetic Collision Detection Between Two Simple Polygons.
13 Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.
21 Queries with Segments in Voronoi Diagrams.
18 Efficient Algorithms for Petersen's Matching Theorem.
0 Stop Minding Your p's and q's: A Simplified <i>O</i>(<i>n</i>) Planar Embedding Algorithm.
9 Fast Algorithms for Constructing Optimal Trees from Quartets.
9 A Small Universal Graph for Bounded-degree Planar Graphs.
15 A Near-Linear Area Bound for Drawing Binary Trees.
27 Greedy Local Improvement and Weighted Set Packing Approximation.
6 Minimizing Wirelength in Zero and Bounded Skew Clock Trees.
62 On Multi-Dimensional Packing Problems.
0 Nonplanar Topological Inference and Political-Map Graphs.
5 Approximate Minimum Weight Steiner Triangulation in Three Dimensions.
12 Two-Point Euclidean Shortest Path Queries in the Plane.
9 On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees.
45 Dynamic LCA Queries on Trees.
55 Tree Pattern Matching and Subset Matching in Deterministic <i>O</i>(<i>n</i> log<sup>3</sup> <i>n</i>)-time.
75 Compact Routing with Minimum Stretch.
9 Recovering Evolutionary Trees Through Harmonic Greedy Triplets.
9 Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
2 On Approximability of the Minimum-Cost <i>k</i>-Connected Spanning Subgraph Problem.
106 Clustering in Large Graphs and Matrices.
39 Balanced Aspect Ratio Trees: Combining the Advantages of <i>k</i>-d Trees and Octrees.
9 Shortest Paths in an Arrangement with <i>k</i> Line Orientations.
27 Randomized Online Scheduling on Two Uniform Machines.
29 Separation-Sensitive Collision Detection for Convex Objects.
15 Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances.
6 Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs.
10 How to Make a Square Grid Framework with Cables Rigid.
15 Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler.
10 Cut Tree Algorithms.
4 The Complexity of Gene Placement.
25 Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control.
2 Estimating Interpolation Error: A Combinatorial Approach.
7 Fast Deterministic Construction of Static Dictionaries.
0 Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs.
1 New Algorithms for Generating Conway Polynomials Over Finite Fields.
0 Scheduling Multicasts on Unit-Capacity Trees and Meshes.
33 A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
39 A Small Approximately min-wise Independent Family of Hash Functions.
34 Geometric Matching Under Noise: Combinatorial Bounds and Algorithms.
10 An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
6 Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
21 A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem.
48 Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
10 Eliminating Migration in Multi-Processor Scheduling.
0 On-line Complexity of Monotone Set Systems.
10 Parametric Polymatroid Optimization and Its Geometric Applications.
0 Optimal On-line Algorithms for an Electronic Commerce Money Distribution System.
5 Recovering Branches on the Tree of Life: An Approximation Algorithm.
0 The Data Broadcast Problem with Non-Uniform Transmission Rimes.
3 Interleaved Prefetching.
64 Wavelength Conversion in Optical Networks.
3 Online Resource Minimization.
59 Placement Algorithms for Hierarchical Cooperative Caching.
2 Indexing Schemes for Random Points.
4 Roundness Estimation via Random Sampling.
35 Cache Performance Analysis of Traversals and Random Accesses.
19 Trade-offs Between Speed and Processor in Hard-Deadline Scheduling.
64 Distinguishing String Selection Problems.
26 New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
0 Empirical Investigation of the Markov Reference Model.
4 A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem.
51 An Analysis of the Burrows-Wheeler Transform.
3 Dual-Issue Scheduling with Spills for Binary Trees.
57 I/O-Complexity of Graph Algorithms.
5 All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
0 Combinatorial Approximation Algorithms for Generalized Flow Problems.
0 Certified Computation of the Sign of a Matrix Determinant.
4 Rendering Equation Revisited: How to Avoid Explicit Visibility Computations.
0 Approximation Algorithms for the Asymmetric Postman Problem.
26 On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem.
15 An Efficient Algorithm for Generating Necklaces with Fixed Density.
3 Preemptive Scheduling with Job-Dependent Setup Times.
0 An Efficient Algorithm for Computing the <i>i</i>th letter of 4<sup>n</sup>a.
5 Median Bounds and Their Application.
9 Rectangular Tiling in Multi-dimensional Arrays.
0 A Generalization of Janson Inequalities and its Application to Finding Shortest Paths.
10 Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane.
11 A New Property and a Faster Algorithm for Baseball Elimination.
54 When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?
37 Analysis of a Bounding Box Heuristic for Object Intersection.
2 Inverse Inbreeding Coefficient Problems with an Application to Linkage Analysis of Recessive Diseases in Inbred Populations.
26 Exploring Unknown Environments with Obstacles.
5 Playing Twenty Questions with a Procrastinator.
17 Improved Bicriteria Existence Theorems for Scheduling.
9 Group Signatures <i>&Aacute; la carte</i>.
3 Computing Morse Functions on Triangulated Manifolds.
3 Algorithms for Total Weighted Completion Time Scheduling.
9 Parameterized diff.
48 Finding Maximum Independent Sets in Sparse and General Graphs.
7 Optimal Multichannel Communication Under Failure.
36 A Wide-Range Efficient Algorithm for Minimal Triangulation.
9 Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard.
4 The Full Degree Spanning Tree Problem.
51 Locked and Unlocked Polygonal Chains in 3D.
39 A Formal Treatment of Remotely Keyed Encryption.
2 Unscrambling Address Lines.
1 Some Graphic Uses of an Even Number of Odd Nodes.
3 Minimizing Weighted Completion Time on a Single Machine.
117 Improved Approximation Algorithms for a Capacitated Facility Location Problem.
0 Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms.
11 LP-based Analysis of Greedy-dual-size.
9 Scheduling Calls for Multicasting in Tree-Networks.
44 LBFS Orderings and Cocomparability Graphs.
3 Compact Roundtrip Routing for Digraphs.
1 Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.
9 Parallel Virtual Memory.
11 Folding and One Straight Cut Suffice.
49 A Simple Provable Algorithm for Curve Reconstruction.
1 Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion.
5 The 2-Catalog Segmentation Problem.
5 Incremental and Decremental Maintenance of Planar Width.
8 Checking Priority Queues.
6 Randomized Splay Trees.
25 Efficient Approximation Algorithms for the Hamming Center Problem.
23 Algorithms for Compile-Time Memory Optimization.
99 Synopsis Data Structures for Massive Data Sets.
48 Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing.
5 Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research.
2 Reconstructing Set Partitions.
11 Online Coloring Known Graphs.
0 Dynamical System Representation of Open Address Hash Functions.
7 Efficient Exact Sampling from the Ising Model Using Swendsen-Wang.
17 Fully Dynamic Algorithms for Chordal Graphs.
6 The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications.
0 What are the Least Tractable Instances of max Tndependent Set?
0 A Generalized <i>q</i><sup>th</sup> Root Algorithm.
7 Computing Nearest Neighbors for Moving Points and Applications to Clustering.
0 Designing Proxies for Stock Market Indices is Computationally Hard.
3 Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data.
19 A Uniform Framework for Approximating Weighted Connectivity Problems.
17 The Advantages of Forward Thinking in Generating Rooted and Free Trees.
1 An Algorithm to Symbolically Describe Flows on Surfaces.
1 On the Optimality of Parsing in Dynamic Dictionary Based Data Compression.
17 Approximation Algorithms for Protein Folding Prediction.
15 Compass Permits Leader Election.
0 Combinatorics Helps for Hexahedral Mesh Generation in CAD.
2 Approximating Multiroot 3-Outconnected Subgraphs.
1 Using Stopping Times to Bound Mixing Times.
6 Greedy Algorithms for Optimized DNA Sequencing.
13 Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design.
7 Sampling Spin Configurations of an Ising System.
4 Approximability of Scheduling with Fixed Jobs.
7 Optimal Scheduling of Multiclass Parallel Machines.
6 Colouring Graphs with Prescribed Induced Cycle Lengths.
12 An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.
7 Packet Filtering in High Speed Networks.
0 A Slique Size Bounding Technique with Application to Non-Linear Codes.
12 Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.
5 A Convex Relaxation for the Asymmetric TSP.
5 Computational Complexity of Compaction to Cycles.
4 Exact Solutions to Large-scale Plane Steiner Tree Problems.
11 Faster Approximation Algorithms for Generalized Flow.
3 Experimental Performance of Shared RSA Modulus Generation.
41 Fast and Effective Stripification of Polygonal Surface Models.