Randomization and Approximation Techniques in Computer Science

6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings

  • José D. P. Rolim
  • Salil Vadhan

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2483)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
    Pages 1-10
  3. Michal Parnas, Dana Ron, Ronitt Rubinfeld
    Pages 11-25
  4. Martin Dyer, Leslie A. Goldberg, Mark Jerrum
    Pages 51-67
  5. Martin Dyer, Mark Jerrum, Eric Vigoda
    Pages 68-77
  6. Dimitris Achlioptas, Cristopher Moore
    Pages 78-90
  7. Christopher Malon, Igor Pak
    Pages 91-104
  8. Ehud Friedgut, Jeff Kahn, Avi Wigderson
    Pages 105-113
  9. J. Díaz, N. Do, M. J. Sernal, N. C. Wormald
    Pages 114-125
  10. William Duckworth, Bernard Mans
    Pages 126-138
  11. Martin Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
    Pages 149-163
  12. Cristopher Moore, Alexander Russell
    Pages 164-178
  13. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Pages 179-193
  14. Lars Engebretsen, Venkatesan Guruswami
    Pages 224-238

About these proceedings


Approximation Approximation Algorithms Combinatorial Optimization Computational Discrete Mathematics Computational Geometry Derandomization Graph Algorithms Randomization Randomized Algorithms Randomness algorithms computer computer science

Editors and affiliations

  • José D. P. Rolim
    • 1
  • Salil Vadhan
    • 2
  1. 1.Centre Universitaire d’InformatiqueUniversity of GenevaGenéve 4Switzerland
  2. 2.Harvard University, DEASCambridgeUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45726-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-44147-2
  • Online ISBN 978-3-540-45726-8
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors