|
|
39th Annual Symposium on Foundations of Computer Science Palo Alto, California November 08-November 11 ISBN: 0-8186-9172-7 Table of Contents
pp. 2
pp. 4
Information Retrieval on the Web (Abstract)
Andrei Broder, Compaq Systems Research Ctr
Monika R. Henzinger, Compaq Systems Research Ctr pp. 6
pp. 8 pp. 18
Venkatesan Guruswami, MIT
Madhu Sudan, MIT pp. 28
The Access Network Design Problem (Abstract)
Matthew Andrews, Bell Laboratories
Lisa Zhang, Bell Laboratories pp. 40
Jitter Control in QoS Networks (Abstract)
pp. 50
David Gamarnik, IBM pp. 60
Susanne Albers, Max-Planck-Institut fur Informatik
Moses Charikar, Stanford University
Michael Mitzenmacher, Compaq Systems Research Center pp. 71
Walter Unger, RWTH Aachen pp. 82
Daniele Micciancio, Massachusetts Institute of Technology pp. 92 pp. 99
Claudio Gutiérrez, Wesleyan University pp. 112
Géraud Sénizergues, LaBRI,Universit? de Bordeaux pp. 120 pp. 130 pp. 137
pp. 148
Pattern Matching for Spatial Point Sets (Abstract)
David E. Cardoze, Georgia Institute of Technology
Leonard J. Schulman, Georgia Institute of Technology pp. 156 pp. 166
Martin Farach, Bell Labs and Rutgers University
Paolo Ferragina, Max Planck Institut fuer Informatik
S. Muthukrishnan, Bell Labs pp. 174
Vadim Olshevsky, Georgia State University
Victor Pan, Lehman College, CUNY pp. 192
Alan R. Woods, University of Western Australia pp. 202
Arnold Schönhage, Universit?t Bonn pp. 212
Local Search in Smooth Convex Sets (Abstract)
Ravi Kannan, Yale University
Andreas Nolte, Universit?t zu K? pp. 218
Mao-cheng Cai, Academia Sinica
Xiaotie Deng, City University of Hong Kong
Wenan Zang, The University of Hong Kong pp. 227 pp. 232 pp. 244
Time-Space Tradeoffs for Branching Programs (Abstract)
Paul Beame, University of Washington
Michael Saks, Rutgers University
Jayram S. Thathachar, University of Washington pp. 254
Optimal Time-Space Trade-Offs for Sorting (Abstract)
Jakob Pagter, University of Aarhus
Theis Rauhe, University of Aarhus pp. 264
D. Grigoriev, Penn State University
A. Razborov, Steklov Mathematical Institute pp. 269
Lower Bounds for (MOD p - MOD m) Circuits (Abstract)
Vince Grolmusz, Eotvos University
Gabor Tardos, Hungarian Academy of Science pp. 279
Yefim Dinitz, Ben-Gurion University of the Negev
Naveen Garg, Indian Institute of Technology
Michel Goemans, University of Louvain pp. 290
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. (Abstract)
Naveen Garg, Indian Institute of Technology
Jochen Koenemann, Carnegie Mellon University pp. 300
Uri Zwick, Tel Aviv University pp. 310
Kasturi R. Varadarajan, Duke University pp. 320
Andris Ambainis, University of California, Berkeley
Rusins Freivalds, University of Latvia pp. 332 pp. 342
Quantum Lower Bounds by Polynomials (Abstract)
Robert Beals, University of Arizona
Harry Buhrman, CWI
Richard Cleve, University of Calgary
Michele Mosca, University of Oxford
Ronald de Wolf, CWI and University of Amsterdam pp. 352
Wim van Dam, University of Oxford pp. 362
pp. 370
Moses Charikar, Stanford University
Chandra Chekuri, Stanford University
Ashish Goel, Stanford University
Sudipto Guha, Stanford University
Serge Plotkin, Stanford University pp. 379
Santosh Vempala, M.I.T. pp. 389
On Learning Monotone Boolean Functions (Abstract)
pp. 408 pp. 416
Testing Monotonicity (Abstract)
pp. 426
Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model (Abstract)
Mary Cryan, University of Warwick
Leslie Ann Goldberg, University of Warwick
Paul W. Goldberg, University of Warwick pp. 436
Kamal Jain, Georgia Institute of Technology pp. 448
The Finite Capacity Dial-A-Ride Problem (Abstract)
Moses Charikar, Stanford University
Balaji Raghavachari, The University of Texas at Dallas pp. 458 pp. 468
Martin Skutella, Technische Universitat Berlin pp. 472
pp. 484 pp. 493
Dominic Mayers, Princeton University
Andrew Yao, Princeton University pp. 503
The Security of Individual RSA Bits (Abstract)
Johan Håstad, Royal Institute of Technology
Mats Näslund, Royal Institute of Technology pp. 510
Micah Adler, University of Toronto
Bruce M. Maggs, Carnegie Mellon University pp. 522
Marked Ancestor Problems (Abstract)
pp. 534
Larry Carter, University of California at San Diego
Kang Su Gatlin, University of California at San Diego pp. 544
Christopher Umans, University of California, Berkeley pp. 556
Concurrent Reachability Games (Abstract)
pp. 564
Alexander Russell, University of Texas at Austin
David Zuckerman, University of Texas at Austin pp. 576
Random Sampling, Halfspace Range Reporting, and Construction of (= k)-Levels in Three Dimensions (Abstract)
Timothy M. Chan, University of Miami pp. 586
Pankaj K. Agarwal, Duke University
David Eppstein, University of California, Irvine
Leonidas J. Guibas, Stanford University
Monika R. Henzinger, Compaq Systems Research Center pp. 596 pp. 606
Which Crossing Number is it, Anyway? (Abstract)
pp. 617
pp. 628
Maria Luisa Bonet, Universitat Politecnica de Catalunya
Juan Luis Esteban, Universitat Politecnica de Catalunya
Nicola Galesi, Universitat Politecnica de Catalunya
Jan Johannsen, University of California at San Diego pp. 638
D. Grigoriev, Penn State University pp. 648 pp. 653
pp. 664
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-random Graphs (Abstract)
Uriel Feige, The Weizmann Institute
Joe Kilian, NEC Research Institute pp. 674
Jaikumar Radhakrishnan, Tata Institute of Fundamental Research
Aravind Srinivasan, National University of Singapore pp. 684
Yuval Rabani, Technion
Alistair Sinclair, University of California, Berkeley
Rolf Wanka, Paderborn University pp. 694
Georg Gottlob, Technische Universit?t Wien
Nicola Leone, Technische Universit?t Wien
Francesco Scarcello, Universit? della Calabria pp. 706
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time (Abstract)
pp. 725 pp. 734 Usage of this product signifies your acceptance of the Terms of Use.
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
