Table of Contents

• Comparing Point Sets Under ProjectionDaniel P. Huttenlocher, Jon M. Kleinberg. 1-7
• On-line Search in a Simple PolygonJon M. Kleinberg. 8-15
• On Degeneracy in Geometric ComputationsChristoph Burnikel, Kurt Mehlhorn, Stefan Schirra. 16-23
• Reliable Benchmarks Using Numerical InstabilitySigal Ar, Jin-yi Cai. 34-43
• Exact Analysis of a Priority Queue Algorithm for Random Variate GenerationEric Bach. 48-56
• Low-degree TestsKatalin Friedl, Zsolt Hátsági, Alexander Shen. 57-64
• Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex ToursSamuel R. Buss, Peter N. Yianilos. 65-76
• Average Case Analysis of Dynamic Geometric OptimizationDavid Eppstein. 77-86
• A Near-Linear Algorithm for the Planar Segment Center ProblemAlon Efrat, Micha Sharir. 87-97
• Maximal Empty EllipsoidsRex A. Dwyer, William F. Eddy. 98-102
• Recognizing Balanced 0, ± MatricesMichele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic. 103-111
• Scheduling Parallel Tasks to Minimize Average Response TimeJohn Turek, Uwe Schwiegelshohn, Joel L. Wolf, Philip S. Yu. 112-121
• Minimizing Channel Density by Lateral Shifting of ComponentsDavid S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter. 122-131
• A Better Algorithm for an Ancient Scheduling ProblemDavid R. Karger, Steven J. Phillips, Eric Torng. 132-140
• On the Greedy Heuristic for MatchingsJonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen. 141-149
• Clustering for Faster Network Simplex PivotsDavid Eppstein. 160-166
• Scheduling Malleable and Nonmalleable Parallel TasksWalter Ludwig, Prasoon Tiwari. 167-176
• Approximating the Minimum Equivalent DiagraphSamir Khuller, Balaji Raghavachari, Neal E. Young. 177-186
• Approximate Data Structures with ApplicationsYossi Matias, Jeffrey Scott Vitter, Neal E. Young. 187-194
• An Optimal RAM Implementation of Catenable Min Double-ended QueuesS. Rao Kosaraju. 195-203
• Dynamic Two-Connectivity with BacktrackingJohannes A. La Poutré, Jeffery Westbrook. 204-212
• Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic TimeKurt Mehlhorn, R. Sundar, Christian Uhrig. 213-222
• Improved Approximation Algorithms for Network Design ProblemsMichel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson. 223-232
• Optimal Parallel Approximation for Prefix Sums and Integer SortingMichael T. Goodrich, Yossi Matias, Uzi Vishkin. 241-250
• Neighborhood Preserving Hashing and Approximate QueriesDanny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas. 251-259
• New Techniques for Approximating Complex Polynomial ZerosVictor Y. Pan. 260-270
• Roots of a Polynomial and its DerivativesDon Coppersmith, C. Andrew Neff. 271-279
• The Complexity of Resolvent ResolvedGiovanni Gallo, Bhubaneswar Mishra. 280-289
• Dynamic Algebraic AlgorithmsJohn H. Reif, Stephen R. Tate. 290-301
• Online Interval SchedulingRichard J. Lipton, Andrew Tomkins. 302-311
• Competitive Non-Preemptive Call ControlBaruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén. 312-320
• Competitive Routing of Virtual Circuits with Unknown DurationBaruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts. 321-327
• Approximately Counting Hamilton Cycles in Dense GraphsMartin E. Dyer, Alan M. Frieze, Mark Jerrum. 336-343
• Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian InferenceReuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth. 344-354
• Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching InstancesDavid P. Williamson, Michel X. Goemans. 355-364
• Optimal Constructions of Hybrid AlgorithmsMing-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin. 372-381
• Linear Programs for Randomized On-Line AlgorithmsCarsten Lund, Nick Reingold. 382-391
• Optimal Prediction for Prefetching in the Worst CaseP. Krishnan, Jeffrey Scott Vitter. 392-401
• Design of On-line Algorithms Using Hitting TimesPrasad Tetali. 402-411
• Efficient Routing and Scheduling Algorithms for Optical NetworksAlok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan. 412-423
• Using Randomized Sparsification to Approximate Minimum CutsDavid R. Karger. 424-432
• Polynomial Time Algorithms for Some Evacuation ProblemsBruce Hoppe, Éva Tardos. 433-441
• Moments of Inertia and Graph SeparatorsKeith D. Gremban, Gary L. Miller, Shang-Hua Teng. 452-461
• Shallow Excluded Minors and Improved Graph DecompositionsSerge A. Plotkin, Satish Rao, Warren D. Smith. 462-470
• Reconstructing a History of Recombinations from a Set of SequencesJohn D. Kececioglu, Dan Gusfield. 471-480
• Fast Comparison of Evolutionary TreesMartin Farach, Mikkel Thorup. 481-488
• Physical Mapping of Chromosomes Using Unique ProbesFarid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig. 489-500
• The Subtree Max Gap Problem with Application to Parallel String CoveringAmir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park. 501-510
• Computing the Covers of a String in Linear TimeDennis Moore, William F. Smyth. 511-515
• Shortest Paths Algorithms: Theory and Experimental EvaluationBoris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik. 516-525
• Path Problems in Skew-Symmetric GraphsAndrew V. Goldberg, Alexander V. Karzanov. 526-535
• Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability GraphsRoss M. McConnell, Jeremy Spinrad. 536-545
• Spanning Trees Short or SmallR. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi. 546-555
• Generating Low-Degree 2-SpannersGuy Kortsarz, David Peleg. 556-563
• Selection in the Presence of Noise: The Design of Playoff SystemsMicah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon. 564-572
• An Optimal Algorithm for Approximate Nearest Neighbor SearchingSunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu. 573-582
• Queueing Analysis of Oblivious Packet-Routing NetworksMor Harchol-Balter, Paul E. Black. 583-592
• Testable Algorithms for Self-Avoiding WalksDana Randall, Alistair Sinclair. 593-602
• Optimal Construction of Edge-Disjoint Paths in Random GraphsAndrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal. 603-612
• Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone MatrixRajeev Raman, Uzi Vishkin. 613-621
• An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value ProblemVijaya Ramachandran, Honghua Yang. 622-631
• A Sublinear Parallel Algorithm for Stable MatchingTomás Feder, Nimrod Megiddo, Serge A. Plotkin. 632-637
• The QRQW PRAM: Accounting for Contention in Parallel AlgorithmsPhillip B. Gibbons, Yossi Matias, Vijaya Ramachandran. 638-648
• Optimum Parallel Computations with Banded MatricesVictor Y. Pan, Isdor Sobze, Antoine Atinkpahoun. 649-658
• Optimal Parallel Sorting in Multi-Level StorageAlok Aggarwal, C. Greg Plaxton. 659-668
• Derandomizing Algorithms for Routing and Sorting on MeshesMichael Kaufmann, Jop F. Sibeyn, Torsten Suel. 669-679
• On Optimal Strategies for Searching in Presence of ErrorsS. Muthukrishnan. 680-689
• Matching Nuts and BoltsNoga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky. 690-696
• An Efficient Algorithm for Dynamic Text IndexingMing Gu, Martin Farach, Richard Beigel. 697-704
• Let Sleeping Files Lie: Pattern Matching in Z-compressed FilesAmihood Amir, Gary Benson, Martin Farach. 705-714
• Two and Higher Dimensional Pattern Matching in Optimal Expected TimeJuha Kärkkäinen, Esko Ukkonen. 715-723
• Tight Bounds for Dynamic Storage AllocationMichael Luby, Joseph Naor, Ariel Orda. 724-732