Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2000: SOFSEM 2000: Theory and Practice of Informatics pp 71–87Cite as

Simplified Witness Tree Arguments

  • Conference paper
  • First Online:

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

Abstract

In this paper we survey some results concerning balls-intobins- games and the power of two choices. We present a unified and rather elementary analysis for models in the parallel as well as in the sequential setting which is based on witness trees.

Supported by DFG-grant Ste 464/3-1.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC-95), pages 238–247. ACM Press, 1995. 72, 73

    Google Scholar 

  2. Yossi Azar, Andrej Broder, Anna R. Karlin, and Eli Upfal. Balanced allocations. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC-94), pages 593–602, 1994. 71, 73, 79, 82

    Google Scholar 

  3. Petra Berenbrink, Artur Czumaj, Angelika Steger, and Berthold Vöcking. Balanced allocation: the heavily loaded case. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC-00), pages 745–754, 2000. 73

    Google Scholar 

  4. Richard Cole, Alan Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, and Eli Upfal. On balls and bins with deletions. In Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 1998.

    Google Scholar 

  5. Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andrea W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 378–388, 1998.

    Google Scholar 

  6. Artur Czumaj, Friedhelm Meyer auf der Heide, and Volker Stemann. Improved optimal shared memory simulations, and the power of reconfiguration. In Proceedings of the 3rd Israel Symposium on Theory of Computing, pages 11–19, 1995.

    Google Scholar 

  7. Artur Czumaj and Volker Stemann. Randomized allocation processes. In Proceedings of the 38th IEEE Symposium on the Foundations of Computer Science (FOCS-97), pages 194–203, 1997. 73

    Google Scholar 

  8. Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. Simple, efficient shared memory simulations (extended abstract). In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-93), pages 110–119, 1993.

    Google Scholar 

  9. Leslie Ann Goldberg, Yossi Matias, and Satish Rao. An optical simulation of shared memory. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-94), pages 257–267, New York, 1994. ACM Press.

    Google Scholar 

  10. Gaston H. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the ACM, 28(2):289–304, 1981. 71

    Article  MATH  MathSciNet  Google Scholar 

  11. Richard M. Karp, Michael Luby, and Friedhelm Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC-92), pages 318–326. ACM Press, 1992.

    Google Scholar 

  12. Philip. D. MacKenzie, C. Greg Plaxton, and Rajmohan Rajaraman. On contention resolution protocols and associated probabilistic phenomena. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC-94), pages 153–162, 1994.

    Google Scholar 

  13. Friedhelm Meyer auf der Heide, Christian Scheideler, and Volker Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS-95), volume LNCS 900, pages 267–278. Springer-Verlag, 1995.

    Google Scholar 

  14. Michael Mitzenmacher. Density dependent jump markov processes and applications to load balancing. In Proceedings of the 37th IEEE Symposium on Foundations (FOCS-96), pages 213–223, 1996.

    Google Scholar 

  15. Michael Mitzenmacher. On the Power of Two Choices in Randomized Load Balancing. PhD thesis, 1996. 71

    Google Scholar 

  16. Michael Mitzenmacher. On the analysis of randomized load balancing schemes. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Arrays (SPAA-97), pages 292–301, 1997.

    Google Scholar 

  17. Martin Raaban and Angelika Steger. Balls into bins—a simple and tight analysis. In Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), volume LNCS 1518, pages 159–170, 1998

    Google Scholar 

  18. Volker Stemann. Parallel balanced allocations. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-96), pages 261–269, 1996.

    Google Scholar 

  19. Berthold Vöcking. How asymmetry helps load balancing. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS-99), pages 131–140, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Thomas Schickinger & Angelika Steger

Authors
  1. Thomas Schickinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Angelika Steger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Cybernetics, Czech Technical University, Karlovo nám. 13, 121 35, Prague, Czech Republic

    Václav Hlaváč

  2. Information Technology Department, CLRC RAL, Chilton, Didcot, Oxfordshire, UK

    Keith G. Jeffery

  3. Insitute of Computer Science, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 2, 182 07, Prague, Czech Republic

    Jiří Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schickinger, T., Steger, A. (2000). Simplified Witness Tree Arguments. In: Hlaváč, V., Jeffery, K.G., Wiedermann, J. (eds) SOFSEM 2000: Theory and Practice of Informatics. SOFSEM 2000. Lecture Notes in Computer Science, vol 1963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44411-4_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44411-4_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41348-6

  • Online ISBN: 978-3-540-44411-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation