Table of Contents

• An On-Line Algorithm for Improving Performance in NavigationAvrim Blum, Prasad Chalasani. 2-11
• On the Value of Information in Coordination Games (preliminary version)Sandy Irani, Yuval Rabani. 12-21
• Heat & Dump: Competitive Distributed PagingBaruch Awerbuch, Yair Bartal, Amos Fiat. 22-31
• Throughput-Competitive On-Line RoutingBaruch Awerbuch, Yossi Azar, Serge A. Plotkin. 32-40
• NP Trees and Carnap s Modal LogicGeorg Gottlob. 42-51
• Logical Reducibility and Monadic NPStavros S. Cosmadakis. 52-61
• Gages Accept Concurrent BehaviorVineet Gupta, Vaughan R. Pratt. 62-71
• Parallel computable higher type functionals (Extended Abstract)Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapron. 72-81
• Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning TreesDavid R. Karger. 84-93
• Simulated Annealing for Graph BisectionMark Jerrum, Gregory B. Sorkin. 94-103
• Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded InputsShenfeng Chen, John H. Reif. 104-112
• The shrinkage exponent is 2Johan Håstad. 114-123
• Top-Down Lower Bounds for Depth 3 CircuitsJohan Håstad, Stasys Jukna, Pavel Pudlák. 124-129
• On Representations by Low-Degree PolynomialsRoman Smolensky. 130-138
• A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is FixedRicha Agarwala, David Fernández-Baca. 140-147
• Genome Rearrangements and Sorting by ReversalsVineet Bafna, Pavel A. Pevzner. 148-157
• Approximating Shortest SuperstringsShang-Hua Teng, F. Frances Yao. 158-165
• On the log rank -Conjecture in Communication ComplexityRan Raz, Boris Spieker. 168-176
• The Complexity and Distribution of Hard Problems (Extended Abstract)David W. Juedes, Jack H. Lutz. 177-185
• Sensitive Functions and Approximate ProblemsShiva Chaudhuri. 186-193
• Synchronization power depends on the register size (Preliminary Version)Yehuda Afek, Gideon Stupp. 196-205
• A Tight Lower Bound for k-Set AgreementSoma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle. 206-215
• Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGsC. K. Poon. 218-227
• Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)Greg Barnes, Jeff Edmonds. 228-237
• A Randomized Time-Space Tradefoff of /tildeO(m/tildeR) for USTCONUriel Feige. 238-246
• Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensionsRichard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter. 248-258
• A linear-processor polylog-time algorithm for shortest paths in planar graphsPhilip N. Klein, Sairam Subramanian. 259-270
• Highly Efficient Asynchronous Execution of Large-Grained Parallel ProgramsYonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin. 271-280
• General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis BoundingJaved A. Aslam, Scott E. Decatur. 282-291
• Scale-sensitive Dimensions, Uniform Convergence, and LearnabilityNoga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler. 292-301
• Exact Learning via the Monotone Theory (Extended Abstract)Nader H. Bshouty. 302-311
• Learning an Intersection of k Halfspaces over a Uniform DistributionAvrim Blum, Ravi Kannan. 312-320
• Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programsSridhar Rajagopalan, Vijay V. Vazirani. 322-331
• Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)Paul B. Callahan. 332-340
• Universal Emulations with Sublogarithmic SlowdownChristos Kaklamanis, Danny Krizanc, Satish Rao. 341-350
• Quantum Circuit ComplexityAndrew Chi-Chih Yao. 352-361
• A Quantum Bit Commitment Scheme Provably Unbreakable by both PartiesGilles Brassard, Claude Crépeau, Richard Jozsa, Denis Langlois. 362-371
• Solving Systems of Set Constraints with Negated Subset RelationshipsRémi Gilleron, Sophie Tison, Marc Tommasi. 372-380
• Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal EnvironmentDan Halperin, Micha Sharir. 382-391
• Geometric Discrepancy RevisitedBernard Chazelle. 392-399
• Product Range Spaces, Sensitive Sampling, and DerandomizationHervé Brönnimann, Bernard Chazelle, Jirí Matousek. 400-409
• The Complexity of the Theory of p-adic NumbersLavinia Egidi. 412-421
• Testing Equalities of Multiplicative Representations in Polynomial Time (Extended Abstract)Guoqiang Ge. 422-426
• Las Vegas algorithms for matrix groupsRobert Beals, László Babai. 427-436
• Faster Algorithms for the Generalized Network Flow ProblemTomasz Radzik. 438-448
• A Framework for Cost-scaling Algorithms for Submodular Flow ProblemsHarold N. Gabow. 449-458
• A Simple Local-Control Approximation Algorithm for Multicommodity FlowBaruch Awerbuch, Frank Thomson Leighton. 459-468
• Dynamic Word ProblemsGudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum. 470-479
• Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial SumsHaripriyan Hampapuram, Michael L. Fredman. 480-485
• A Weak Version of the Blum, Shub & Smale modelPascal Koiran. 486-495
• Almost Tight Upper Bounds for Lower Envelopes in Higher DimensionsMicha Sharir. 498-507
• Efficient Computation of Euclidean Shortest Paths in the PlaneJohn Hershberger, Subhash Suri. 508-517
• The Union of Convex Polyhedra in Three DimensionsBoris Aronov, Micha Sharir. 518-527
• Better Lower Bounds on Detecting Affine and Spherical DegeneraciesJeff Erickson, Raimund Seidel. 528-536
• When can we sort in o(n log n) time?Amir M. Ben-Amram, Zvi Galil. 538-546
• On Bounded Queries and ApproximationRichard Chang, William I. Gasarch. 547-556
• The NC Equivalence of Planar Integer Linear Programming and Euclidean GCDDavid Shallcross, Victor Y. Pan, Yu Lin-Kriz. 557-564
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is FixedAlexander I. Barvinok. 566-572
• A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the PlaneMichael McAllister, David G. Kirkpatrick, Jack Snoeyink. 573-582
• Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large AnglesScott A. Mitchell. 583-591
• Signal Propagation, with Application to a Lower Bound on the Depth of Noisy FormulasWilliam S. Evans, Leonard J. Schulman. 594-603
• Directed vs. Undirected Monotone Contact Networks for Threshold FunctionsMagnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam. 604-613
• Counting Rational Points on Curves over Finite Fields (Extended Abstract)Ming-Deh A. Huang, Doug Ierardi. 616-625
• An O(n log ^3 n) Algorithm for the Real Root ProblemJohn H. Reif. 626-635
• Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood CoversBaruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg. 638-647
• Fast algorithms for constructing t-spanners and paths with stretch tEdith Cohen. 648-658
• A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)Juan A. Garay, Shay Kutten, David Peleg. 659-668
• Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed SystemsMatthew K. Franklin, Zvi Galil, Moti Yung. 670-679
• A Chernoff bound for random walks on expander graphsDavid Gillman. 680-691
• On Choosing a Dense Subgraph (Extended Abstract)Guy Kortsarz, David Peleg. 692-701
• Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)Charles E. Leiserson, Satish Rao, Sivan Toledo. 704-713
• External-Memory Computational Geometry (Preliminary Version)Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter. 714-723
• The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear EquationsSanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk. 724-733
• Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract)Frank Thomson Leighton, Yuan Ma. 734-743