Table of Contents

• Design of Practical and Provably Good Random Number Generators (Extended Abstract)William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan. 1-9
• On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited IndependenceAlan Siegel. 10-19
• On-line Approximate List Indexing with ApplicationsArne Andersson, Ola Petersson. 20-27
• Selecting the MedianDorit Dor, Uri Zwick. 28-37
• Chaining Multiple-Alignment Fragments in Sub-Quadratic TimeGene Myers, Webb Miller. 38-47
• On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid ConvergenceMartin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv. 48-57
• Improved Algorithms for Protein Motif RecognitionBonnie Berger, David Bruce Wilson. 58-67
• Computing the Local Consensus of TreesSampath Kannan, Tandy Warnow, Shibu Yooseph. 68-77
• Polynomial Methods for Separable Convex Optimization in Unimodular SpacesAlexander V. Karzanov, S. Thomas McCormick. 78-87
• Algorithms for Graphic Polymatroids and Parametric s-SetsHarold N. Gabow. 88-97
• A Combinatorial Algorithm for Minimizing Symmetric Submodular FunctionsMaurice Queyranne. 98-101 [doi]
• From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering ProblemsDimitris Bertsimas, Chung-Piaw Teo. 102-111
• Doing Two-Level Logic Minimization 100 Times FasterOlivier Coudert. 112-121
• Finding Optimal Edge-Rankings of TreesXiao Zhou, Takao Nishizeki. 122-131
• External-Memory Graph AlgorithmsYi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter. 139-149
• Finding Subsets Maximizing Minimum StructuresMagnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama. 150-159
• Approximating Discrete Collections via Local ImprovementsMagnús M. Halldórsson. 160-169
• Randomized Rounding Without Solving the Linear ProgramNeal E. Young. 170-178 [doi]
• Average-Case Analysis of Off-Line and On-Line Knapsack ProblemsGeorge S. Lueker. 179-188
• Dihedral Bounds for Mesh Generation in High DimensionsMarshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert. 189-196
• Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance FunctionsL. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl. 197-204
• A New Way to Weigh Malnourished Euclidean GraphsGautam Das, Giri Narasimhan, Jeffrey S. Salowe. 215-222
• Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical StudyJonathan W. Berry, Mark K. Goldberg. 223-232
• On the Performance of Spectral Graph Partitioning MethodsStephen Guattery, Gary L. Miller. 233-242
• Guaranteeing Fair Service to Persistent Dependent TasksAmotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan. 243-252
• Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite GroupsDavid Keith Maslen, Daniel N. Rockmore. 253-262
• Algorithms for Dynamic Closest Pair and n-Body Potential FieldsPaul B. Callahan, S. Rao Kosaraju. 263-272
• Circular Separability of PolygonJean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. 273-281
• Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in ThreeTimothy M. Chan, Jack Snoeyink, Chee-Keng Yap. 282-291
• On the All-Pairs Euclidean Short Path ProblemDanny Z. Chen. 292-301
• Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity CarcassesYefim Dinitz, Alek Vainshtein. 302-311
• Average Case Analysis of Dynamic Graph AlgorithmsDavid Alberts, Monika Rauch Henzinger. 312-321
• David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity ProblemsR. Ravi. 332-341
• Algorithms for the Optimal Loading of Recursive Neural NetsVijay Chandru, Abhi Dattasharma, S. Sathiya Keerthi, N. K. Sancheti, V. Vinay. 342-349
• Using Network Flows for Surface ModelingRolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe. 350-359
• Register Allocation in Structured ProgramsSampath Kannan, Todd A. Proebsting. 360-368
• Lower Bounds for Identifying Subset Members with Subset QueriesEmanuel Knill. 369-377
• Lower Bounds for Linear Satisfiability ProblemsJeff Erickson. 388-395 [doi]
• Morphing Binary TreesJohn Hershberger, Subhash Suri. 396-404
• Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge PropertyBaruch Schieber. 405-411
• Improved Randomized On-Line Algorithms for the List Update ProblemSusanne Albers. 412-419
• On Algorithm Design for Metrical Task SystemsWilliam R. Burley, Sandy Irani. 420-429
• Online Bin Packing with LookaheadEdward F. Grove. 430-436
• Localizing a Robot with Minimum TravelGregory Dudek, Kathleen Romanik, Sue Whitesides. 437-446
• Practical Methods for Approximating Shortest Paths on a Convex Polytope in R³John Hershberger, Subhash Suri. 447-456
• Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous ChangeErnest F. Brickell, Peter Gemmell, David W. Kravitz. 457-466
• The Statistical Adversary Allows Optimal Money-Making Trading StrategiesAndrew Chou, Jeremy R. Cooperstock, Ran El-Yaniv, Michael Klugerman, Frank Thomson Leighton. 467-476
• Fairness in SchedulingMiklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts. 477-485
• Fast Deterministic Approximation for the Multicommodity Flow ProblemTomasz Radzik. 486-492
• Fast Approximation Algorithm for Minimum Cost Multicommodity FlowAnil Kamath, Omri Palmon, Serge A. Plotkin. 493-501
• Improved Interior Point Algorithms for Exact and Approximate Solution of Multicommodity Flow ProblemsAnil Kamath, Omri Palmon. 502-511
• The Quickest Transshipment ProblemBruce Hoppe, Éva Tardos. 512-521
• Splay Trees for Data CompressionDennis Grinberg, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan, Victor K. Wei. 522-530
• Parameterized Pattern Matching by Boyer-Moore-Type AlgorithmsBrenda S. Baker. 541-550
• Counting and Random Generation of Strings in Regular LanguagesSampath Kannan, Z. Sweedyk, Stephen R. Mahaney. 551-557
• Greedy Dynamic Routing on ArraysNabil Kahale, Frank Thomson Leighton. 558-566
• Improved Bounds for All Optical RoutingYonatan Aumann, Yuval Rabani. 567-576
• Broadcast in Radio NetworksIris Gaber, Yishay Mansour. 577-585
• Optimal One-Way Sorting on a One-Dimensional Sub-Bus ArrayJames D. Fix, Richard E. Ladner. 586-594
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is FixedSampath Kannan, Tandy Warnow. 595-603
• Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with TranslocationJohn D. Kececioglu, R. Ravi. 604-613
• Sorting Permutations by TranspositionsVineet Bafna, Pavel A. Pevzner. 614-623
• Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue MultiplicityMartin Fürer. 624-631
• Subgraph Isomorphism in Planar Graphs and Related ProblemsDavid Eppstein. 632-640
• Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-TreesTorben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde. 641-649