Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Simplified Witness Tree Arguments

Simplified Witness Tree Arguments

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1963/2000
BookSOFSEM 2000: Theory and Practice of Informatics
DOI10.1007/3-540-44411-4
Copyright2000
ISBN978-3-540-41348-6
DOI10.1007/3-540-44411-4_6
Pages37-81
Subject CollectionComputer Science
SpringerLink DateSaturday, January 01, 2000
Add to marked items

6. Simplified Witness Tree Arguments

Thomas Schickinger7 and Angelika Steger7 Contact Information

(7)  Institut für Informatik, Technische Universität München, 80290 München, Germany
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.

Contact Information Angelika Steger

URL: http://www14.in.tum.de/
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.109 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)