Algorithm Theory - SWAT 2010

12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings

  • Haim Kaplan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)

Table of contents

  1. Front Matter
  2. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
    Pages 1-12
  3. Yann Disser, Matúš Mihalák, Peter Widmayer
    Pages 13-24
  4. Amr Elmasry, Claus Jensen, Jyrki Katajainen
    Pages 26-37
  5. Prosenjit Bose, Karim Douïeb, Vida Dujmović, Rolf Fagerberg
    Pages 38-49
  6. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
    Pages 62-73
  7. Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
    Pages 74-80
  8. Stefan Kratsch, Pascal Schweitzer
    Pages 81-92
  9. Yixin Cao, Jianer Chen, Yang Liu
    Pages 93-104
  10. Elad Horev, Roi Krakovski, Shakhar Smorodinsky
    Pages 105-117
  11. Shakhar Smorodinsky, Yelena Yuditsky
    Pages 118-126
  12. Michael Hoffmann, Jiří Matoušek, Yoshio Okamoto, Philipp Zumstein
    Pages 139-149
  13. Garud Iyengar, David J. Phillips, Cliff Stein
    Pages 150-162
  14. Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
    Pages 164-175
  15. Imran A. Pirwani, Mohammad R. Salavatipour
    Pages 188-199

About these proceedings

Keywords

Cluster Partition Rack algorithms calculus complexity data structures fast algorithms finite fields parallel computing selection

Editors and affiliations

  • Haim Kaplan
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-13731-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-13730-3
  • Online ISBN 978-3-642-13731-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book