Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

SOFSEM
2000
Springer

favoriteEmaildiscussreport

109views Theoretical Computer Science» more SOFSEM 2000»

Simplified Witness Tree Arguments

14 years 2 months ago

Simplified Witness Tree Arguments

Download dcg.ethz.ch

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.

Thomas Schickinger, Angelika Steger

Real-time Traffic

Elementary Analysis | Sequential Setting | SOFSEM 2000 | Theoretical Computer Science |

claim paper

Related Content

» DistributionallyHard Languages

» Learning the Scope of Negation via Shallow Semantic Parsing

» Automated Synthesis of Induction Axioms for Programs with SecondOrder Recursion

» Hierarchically Performed Hazard Origin and Propagation Studies

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	SOFSEM
Authors	Thomas Schickinger, Angelika Steger

Comments (0)