Abstract is missing.
- Analysis of Shellsort and Related AlgorithmsRobert Sedgewick. 1-11
- Drawing with Colors (Extended Abstract)Ashim Garg, Roberto Tamassia, Paola Vocca. 12-26
- Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc. 27-38
- Preemptive Weighted Completion Time Scheduling of Parallel JobsUwe Schwiegelshohn. 39-51
- Approximation Algorithms for Dynamic Storage AllocationsJordan Gergov. 52-61
- Positive Linear Programming, Parallel Approximation and PCP sLuca Trevisan. 62-75
- Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract)Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz. 76-90
- Randomization of Search Trees by Subtree SizeSalvador Roura, Conrado Martínez. 91-106
- Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract)Paolo Ferragina, S. Muthukrishnan. 107-120
- Priority Queues: Small, Monotone and Trans-dichotomousRajeev Raman. 121-137
- Simulated Annealing and Its Problems to Color GraphsAndreas Nolte, Rainer Schrader. 138-151
- The Capacitated K-Center Problem (Extended Abstract)Samir Khuller, Yoram J. Sussmann. 152-166
- A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract)Toshihiro Fujito. 167-178
- Approximation Algorithms for Connected Dominating SetsSudipto Guha, Samir Khuller. 179-193
- Greedy Algorithms for the Shortest Common Superstring that are Asmtotically OptimalAlan M. Frieze, Wojciech Szpankowski. 194-207
- On the Depth of Randomly Generated CircuitsTatsuie Tsukiji, Fatos Xhafa. 208-220
- The Analysis of Linear Probing Hashing with Buckets (Extended Abstract)Alfredo Viola, Patricio V. Poblete. 221-233
- Parallel Algorithms for Partitioning Sorted Sets and Related ProblemsDanny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi. 234-245
- Fast Generation of Random Permutations via Networks SimulationArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys. 246-260
- On the Parallel Dynamic Dictionary Matching Problem: New Results with ApplicationsPaolo Ferragina, Fabrizio Luccio. 261-275
- Parallel Algorithms for Series Parallel GraphsHans Leo Bodlaender, Babette de Fluiter. 277-289
- Parallel Complexity of Householder QR FactorizationMauro Leoncini, Giovanni Manzini, Luciano Margara. 290-301
- Reporting Red-Blue Intersections between Two Sets of Connected Line SegmentsJulien Basch, Leonidas J. Guibas, G. D. Ramkumar. 302-319
- Matching Convex Shapes with Respect to the Symmetric DifferenceHelmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber. 320-333
- On Minimum-Area Hulls (Extended Abstract)Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang. 334-348
- Negative-Cycle Detection AlgorithmsBoris V. Cherkassky, Andrew V. Goldberg. 349-363
- A New Regular Grammar Pattern Matching AlgorithmBruce W. Watson. 364-377
- Lempel-Ziv Index for q-GramsJuha Kärkkäinen, Erkki Sutinen. 378-391
- Computing Upper and Lower Bounds on Textile Nesting ProblemsRalf Heckmann, Thomas Lengauer. 392-405
- On-line and Off-line Approximation Algorithms for Vector Covering ProblemsNoga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger. 406-418
- Competive Analysis of Randomized Paging AlgorithmsDimitris Achlioptas, Marek Chrobak, John Noga. 419-430
- On-line Competive Algorithms for Call Admission in Optical NetworksBaruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén. 431-444
- Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract)Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer. 445-459
- Efficient Wavelength Routing on Directed Fiber TreesChristos Kaklamanis, Giuseppe Persiano. 460-470
- A Lower Bound for Nearly Minimal Adaptive and Hot Potato AlgorithmsIshai Ben-Aroya, Donald D. Chinn, Assaf Schuster. 471-485
- The Structure of Circular Decomposable MetricsGeorge Christopher, Martin Farach, Michael A. Trick. 486-500
- Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-TreesAnders Dessmark, Andrzej Lingas, Andrzej Proskurowski. 501-513
- Planar Spanners and Approximate Shortest Path Queries among Obstacles in the PlaneSrinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis. 514-528
- A New Approach to Optimal Planning of Robot Motion on a Tree with ObstaclesVincenzo Auletta, Domenico Parente, Giuseppe Persiano. 529-545
- Generalized Streets RevisitedAlejandro López-Ortiz, Sven Schuierer. 546-558
- Computational Aspacts of Organization Theory (Extended Abstract)Christos H. Papadimitriou. 559-564