Table of Contents

• Improved approximation algorithms for uniform connectivity problemsSamir Khuller, Balaji Raghavachari. 1-10 [doi]
• A randomized fully polynomial time approximation scheme for the all terminal network reliability problemDavid R. Karger. 11-17 [doi]
• Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flowsDavid R. Karger, Serge A. Plotkin. 18-25 [doi]
• Approximations for the disjoint paths problem in high-diameter planar networksJon M. Kleinberg, Éva Tardos. 26-35 [doi]
• Secure hypergraphs: privacy from partial broadcast (Extended Abstract)Matthew K. Franklin, Moti Yung. 36-44 [doi]
• Incremental cryptography and application to virus protectionMihir Bellare, Oded Goldreich, Shafi Goldwasser. 45-56 [doi]
• Provably secure session key distribution: the three party caseMihir Bellare, Phillip Rogaway. 57-66 [doi]
• Security of quantum protocols against coherent measurementsAndrew Chi-Chih Yao. 67-75 [doi]
• Efficient stopping rules for Markov chainsLászló Lovász, Peter Winkler. 76-82 [doi]
• A computational view of population geneticsYuval Rabani, Yuri Rabinovich, Alistair Sinclair. 83-92 [doi]
• Persistent lists with catenation via recursive slow-downHaim Kaplan, Robert Endre Tarjan. 93-102 [doi]
• On data structures and asymmetric communication complexityPeter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson. 103-111 [doi]
• What do we know about the Metropolis algorithm?Persi Diaconis, Laurent Saloff-Coste. 112-129 [doi]
• A lower bound for integer multiplication with read-once branching programsStephen Ponzio. 130-139 [doi]
• Symmetric logspace is closed under complementNoam Nisan, Amnon Ta-Shma. 140-146 [doi]
• A nearly optimal time-space lower bound for directed ::::st::::-connectivity on the NNJAG modelJeff Edmonds, Chung Keung Poon. 147-156 [doi]
• Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract)William E. Hart, Sorin Istrail. 157-168 [doi]
• Large-scale assembly of DNA strings and space-efficient construction of suffix treesS. Rao Kosaraju, Arthur L. Delcher. 169-177 [doi]
• Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversalsSridhar Hannenhalli, Pavel A. Pevzner. 178-189 [doi]
• How many queries are needed to learn?Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins. 190-199 [doi]
• Polynomial bounds for VC dimension of sigmoidal neural networksMarek Karpinski, Angus Macintyre. 200-208 [doi]
• Additive versus exponentiated gradient updates for linear predictionJyrki Kivinen, Manfred K. Warmuth. 209-218 [doi]
• On the Fourier spectrum of monotone functions (Extended Abstract)Nader H. Bshouty, Christino Tamon. 219-228 [doi]
• Stochastic contention resolution with short delaysPrabhakar Raghavan, Eli Upfal. 229-237 [doi]
• Parallel randomized load balancing (Preliminary Version)Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen. 238-247 [doi]
• Bounding delays in packet-routing networksMor Harchol-Balter, David Wolfe. 248-257 [doi]
• Many-to-one packet routing on grids (Extended Abstract)Yishay Mansour, Boaz Patt-Shamir. 258-267 [doi]
• Improved approximations of packing and covering problemsAravind Srinivasan. 268-276 [doi]
• Improved approximation guarantees for minimum-weight ::::k::::-trees and prize-collecting salesmenBaruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala. 277-283 [doi]
• Polynomial time approximation schemes for dense instances of ::::NP::::-hard problemsSanjeev Arora, David R. Karger, Marek Karpinski. 284-293 [doi]
• A constant-factor approximation for the ::::k::::-MST problem in the planeAvrim Blum, Prasad Chalasani, Santosh Vempala. 294-302 [doi]
• The relative complexity of NP search problemsPaul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. 303-314 [doi]
• Descriptive complexity theory over the real numbersErich Grädel, Klaus Meer. 315-324 [doi]
• Average-case completeness of a word problem for groupsJie Wang. 325-334 [doi]
• On real Turing machines that toss coinsFelipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther. 335-342 [doi]
• Motion planning for a steering-constrained robot through moderate obstaclesPankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki. 343-352 [doi]
• Randomized query processing in robot path planning (Extended Abstract)Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan. 353-362 [doi]
• Distinguishing tests for nondeterministic and probabilistic machinesRajeev Alur, Costas Courcoubetis, Mihalis Yannakakis. 363-372 [doi]
• What s decidable about hybrid automata?Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya. 373-382 [doi]
• Two Steiner tree packing problems (Extended Abstract)William R. Pulleyblank. 383-387 [doi]
• Linear-time encodable and decodable error-correcting codesDaniel A. Spielman. 388-397 [doi]
• Subquadratic-time factoring of polynomials over finite fieldsErich Kaltofen, Victor Shoup. 398-406 [doi]
• Testing multivariate linear functions: overcoming the generator bottleneckFunda Ergün. 407-416 [doi]
• A tight lower bound for searching a sorted arrayArne Andersson, Johan Håstad, Ola Petersson. 417-426 [doi]
• Sorting in linear time?Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman. 427-436 [doi]
• Lower bounds for sorting networksNabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi. 437-446 [doi]
• A parallel repetition theoremRan Raz. 447-456 [doi]
• Impossibility results for recycling random bits in two-prover proof systemsUriel Feige, Joe Kilian. 457-468 [doi]
• Knowledge on the average-perfect, statistical and logarithmicWilliam Aiello, Mihir Bellare, Ramarathnam Venkatesan. 469-478 [doi]
• Explicit dispersers with polylog degreeMichael E. Saks, Aravind Srinivasan, Shiyu Zhou. 479-488 [doi]
• Euclidean spanners: short, thin, and lankySunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid. 489-498 [doi]
• Short length versions of Menger s theorem (Extended Abstract)Zvi Galil, Xiangdong Yu. 499-508 [doi]
• A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenanceYefim Dinitz, Zeev Nutov. 509-518 [doi]
• Randomized dynamic graph algorithms with polylogarithmic time per operationMonika Rauch Henzinger, Valerie King. 519-527 [doi]
• Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract)Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg. 528-537 [doi]
• Wait-free made fast (Extended Abstract)Yehuda Afek, Dalia Dauber, Dan Touitou. 538-547 [doi]
• Tight analyses of two local load balancing algorithmsBhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman. 548-558 [doi]
• Log-space polynomial end-to-end communicationEyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. 559-568 [doi]
• Monotone circuits for connectivity have depth (log n):::2-o(1)::: (Extended Abstract)Mikael Goldmann, Johan Håstad. 569-574 [doi]
• Lower bounds for cutting planes proofs with small coefficientsMaria Luisa Bonet, Toniann Pitassi, Ran Raz. 575-584 [doi]
• More on the complexity of negation-limited circuitsRobert Beals, Tetsuro Nishino, Keisuke Tanaka. 585-595 [doi]
• On randomized one-round communication complexityIlan Kremer, Noam Nisan, Dana Ron. 596-605 [doi]
• Bounding the power of preemption in randomized schedulingRan Canetti, Sandy Irani. 606-615 [doi]
• Bandwidth allocation with preemptionAmotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber. 616-625 [doi]
• Randomized and multipointer paging with locality of referenceAmos Fiat, Anna R. Karlin. 626-634 [doi]
• Randomized graph products, chromatic numbers, and Lovasz theta-functionUriel Feige. 635-640 [doi]
• The k-Steiner ratio in graphsAl Borchers, Ding-Zhu Du. 641-649 [doi]
• Recognition of graphs with threshold dimension twoThomas Raschle, Klaus Simon. 650-661 [doi]
• Geometric lower bounds for parametric matroid optimizationDavid Eppstein. 662-671 [doi]
• Computing faces in segment and simplex arrangements (Preliminary Version)Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos. 672-682 [doi]
• A Delaunay based numerical method for three dimensions: generation, formulation, and partitionGary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington. 683-692 [doi]
• A fully-dynamic data structure for external substring search (Extended Abstract)Paolo Ferragina, Roberto Grossi. 693-702 [doi]
• String matching in Lempel-Ziv compressed stringsMartin Farach, Mikkel Thorup. 703-712 [doi]
• Work-time-optimal parallel algorithms for string problemsArtur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski. 713-722 [doi]
• On the complexity of bilinear forms: dedicated to the memory of Jacques MorgensternNoam Nisan, Avi Wigderson. 723-732 [doi]
• Lower bounds for off-line range searchingBernard Chazelle. 733-740 [doi]
• Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zerosVictor Y. Pan. 741-750 [doi]
• Work efficient parallel solution of Toeplitz systems and polynomial GCDJohn H. Reif. 751-761 [doi]