Abstract is missing.
- From Sir Isaac to the Sloan Survey: Calculating the Structure and Chaos Owing to Gravity in the UniverseGeorge Lake, Thomas Quinn, Derek C. Richardson. 1-10
- Information Retrieval Algorithms: A SurveyPrabhakar Raghavan. 11-18
- Linear-Time Transitive OrientationRoss M. McConnell, Jeremy Spinrad. 19-25
- Efficient and Practical Modular DecompositionElias Dahlhaus, Jens Gustedt, Ross M. McConnell. 26-35
- Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free GraphsJérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem. 36-42
- On Page Migration and Other Related Task SystemsYair Bartal, Moses Charikar, Piotr Indyk. 43-52
- Online List Accessing Algorithms and Their Applications: Recent Empirical EvidenceRan Bachrach, Ran El-Yaniv. 53-62
- Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?Amos Fiat, Ziv Rosen. 63-72
- The ::::k::::-Client ProblemHouman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner. 73-82
- Buckets, Heaps, Lists, and Monotone Priority QueuesBoris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein. 83-92
- All-Pairs Small-Stretch PathsEdith Cohen, Uri Zwick. 93-102
- Approximating Shallow-Light Trees (Extended Abstract)Guy Kortsarz, David Peleg. 103-110
- Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract)Yehuda Afek, Anat Bremler-Barr. 111-120
- Efficient Approximation and Optimization Algorithms for Computational MetrologyChristian A. Duncan, Michael T. Goodrich, Edgar A. Ramos. 121-130
- Faster Construction of Planar Two-CentersDavid Eppstein. 131-138
- Map Labeling and Its GeneralizationsSrinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu. 148-157
- A Competitive Strategy for Learning a PolygonFrank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel. 166-174
- On-Line Difference MaximizationMing-Yang Kao, Stephen R. Tate. 175-182
- Randomly Sampling MoleculesLeslie Ann Goldberg, Mark Jerrum. 183-192
- Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract)Ravi Kannan, Prasad Tetali, Santosh Vempala. 193-200
- The Path Resistance Method for Bounding lambda::2:: of a LaplacianStephen Guattery, Frank Thomson Leighton, Gary L. Miller. 201-210
- On the Maximum Scatter TSP (Extended Abstract)Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang. 211-220
- The Angular-Metric Traveling Salesman ProblemAlok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. 221-229
- Shortest Path in Complete Bipartite Digraph Problem and its ApplicationsXin He, Zhi-Zhong Chen. 230-238
- Markov Chains for Linear Extensions, the Two-Dimensional CaseStefan Felsner, Lorenz Wernisch. 239-247
- Graph Orientations with No Sink and an Approximation for a Hard Case of #SATRuss Bubley, Martin E. Dyer. 248-257
- Determinant Algorithms for Random Planar StructuresDavid Bruce Wilson. 258-267
- The Variance of Two Game Tree AlgorithmsYanjun Zhang. 268-277
- Nearly Optimal Distributed Edge Colouring in O(log log n) RoundsDavid A. Grable, Alessandro Panconesi. 278-285
- Probabilistic Analysis for Scheduling with ConflictsSandy Irani, Vitus J. Leung. 286-295
- The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract)Claudia Bertram-Kretzberg, Hanno Lefmann. 296-304
- Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract)Giuseppe Amato II, Giuseppe Cattaneo, Giuseppe F. Italiano. 314-323
- Experimental Study of Minimum Cut AlgorithmsChandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein. 324-333
- Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network ReliabilityDavid R. Karger, Ray P. Tai. 334-343
- Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsHaim Kaplan, Ron Shamir, Robert Endre Tarjan. 344-351
- Fast Algorithms for Sorting and Searching StringsJon Louis Bentley, Robert Sedgewick. 360-369
- The Influence of Caches on the Performance of SortingAnthony LaMarca, Richard E. Ladner. 370-379
- Runtime Prediction of Real Programs on Real MachinesUlrich Finkler, Kurt Mehlhorn. 380-389
- Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP ModelRicha Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena. 390-399
- Mapping Clones with a Given Ordering or Interleaving (Extended Abstract)Tao Jiang, Richard M. Karp. 400-409
- Numerical Taxonomy on Data: Experimental ResultsJaime Cohen, Martin Farach. 410-417
- Inferring Evolutionary Trees from Ordinal DataPaul E. Kearney, Ryan Hayward, Henk Meijer. 418-426
- On Distances between Phylogenetic Trees (Extended Abstract)Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang. 427-436
- Improved Access to Optimal Bandwidth in TreesVijay Kumar, Eric J. Schwabe. 437-444
- Optimal Bounds for Matching Routing on TreesLouxin Zhang. 445-453
- Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract)Wun-Tat Chan, Francis Y. L. Chin. 454-463
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear ProgrammingTimothy M. Chan. 464-472
- A Practical Approximation Algorithm for the LMS Line EstimatorDavid M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu. 473-482
- Approximation Schemes for SchedulingNoga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid. 493-500
- Approximation Algorithms for the Discrete Time-Cost Tradeoff ProblemMartin Skutella. 501-508
- Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job LengthsS. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma. 509-517
- Optimal Point Placement for Mesh SmoothingNina Amenta, Marshall W. Bern, David Eppstein. 528-537
- Optimal Good-Aspect-Ratio Coarsening for Unstructured MeshesGary L. Miller, Dafna Talmor, Shang-Hua Teng. 538-547
- Coloring with DefectLenore Cowen, Wayne Goddard, C. E. Jesurum. 548-557
- Approximation Algorithms for the Achromatic NumberAmitabh Chaudhary, Sundar Vishwanathan. 558-563
- The Growth Rate of Vertex-Transitive Planar GraphsLászló Babai. 564-573
- Practical Toroidality TestingEugene Neufeld, Wendy J. Myrvold. 574-580
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract)Fabián A. Chudak, David B. Shmoys. 581-590
- Better Approximation Guarantees for Job-shop SchedulingLeslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk. 599-608
- Approximation Techniques for Average Completion Time SchedulingChandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein. 609-618
- Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation ProblemF. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian. 619-628
- Fast Approximate Graph Partitioning AlgorithmsGuy Even, Joseph Naor, Satish Rao, Baruch Schieber. 639-648
- Computing Edge-Connectivity Augmentation Function in Õ(nm) TimeHiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki. 649-658
- Efficient Algorithms for Robustness in Matroid OptimizationGreg N. Frederickson, Roberto Solis-Oba. 659-668
- Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version)Leonard J. Schulman, David Zuckerman. 669-674
- Rounding in Lattices and its Cryptographic ApplicationsDan Boneh, Ramarathnam Venkatesan. 675-681
- Approximating Matrix Multiplication for Pattern Recognition TasksEdith Cohen, David D. Lewis. 682-691
- Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation ProblemsAravind Srinivasan. 692-701
- A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square RootsChristoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra. 702-709
- LP Based Approach to Optimal Stable MatchingsChung-Piaw Teo, Jay Sethuraman. 710-719
- Combinatorial Optimization GamesXiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi. 720-729
- A Combinatorial Algorithm for the DeterminantMeena Mahajan, V. Vinay. 730-738
- Optimal Search in Trees: Extended Abstract + AppendixYosi Ben-Asher, Eitan Farchi, Ilan Newman. 739-746
- Data Structures for Mobile DataJulien Basch, Leonidas J. Guibas, John Hershberger. 747-756
- Methods for Achieving Fast Query Times in Point Location Data StructuresMichael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer. 757-766
- Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version)Michael T. Goodrich. 767-776
- Partial Matching of Planar Polylines Under Similarity TransformationsScott D. Cohen, Leonidas J. Guibas. 777-786