See this document in CiteSeerX!

On the Power of White Pebbles (1998)  (Make Corrections)  
Bala Kalyanasundaram, Georg Schnitger



  Home/Search   Context   Related

 
View or download:
georgetown.edu/~kalyan/pape...pebble.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  georgetown.edu/~kalyan/thy (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We construct a family fG p : pg of directed acyclic graphs such that any black pebble strategy for G p requires p pebbles whereas 3p + 1 pebbles are sufficient when white pebbles are allowed. (Update)

Active bibliography (related documents):   More   All
0.7:   A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991)   (Correct)
0.5:   Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006)   (Correct)
0.3:   Program schemes, arrays, Lindström quantifiers and zero-one laws - Stewart (1999)   (Correct)

Similar documents based on text:   More   All
1.5:   An Infinite Pebble Game and Applications - Kfoury, Stolboushkin (1996)   (Correct)
1.1:   A Survey of Graph Pebbling - Hurlbert (1999)   (Correct)
1.1:   On Graph Pebbling, Threshold Functions, and Supernormal Posets - Hurlbert (2000)   (Correct)

BibTeX entry:   (Update)

@inproceedings{ kalyanasundaram88power,
    author = "Balasubramanian Kalyanasundaram and George Schnitger",
    title = "On the power of white pebbles",
    pages = "258--266",
    year = "1988",
    url = "citeseer.ist.psu.edu/kalyanasundaram98power.html" }
Citations (may not include all citations):
132   Relationships between Nondeterministic and Deterministic Tap.. (context) - Savitch - 1970
8   Storage requirements for deterministic polynomial finite rec.. (context) - Cook, Sethi - 1976
4   White pebbles help (context) - Wilber - 1988
3   on Concurrent Systems and Parallel Computation (context) - Hewitt, Paterson et al. - 1970
3   Asymptotically tight bounds on time-space trade-offs in a pe.. (context) - Lengauer, Tarjan - 1982
2   A tight bound for black and white pebbles on the pyramid (context) - Klawe - 1985
1   A comparison of two variations of a pebble game on graphs (context) - auf - 1981
1   IBM Research Report RC (context) - Pippenger - 1980
1   A Comparison of the Black and Black-White Pebble Games (context) - Wilber - 1985

Documents on the same site (http://www.cs.georgetown.edu/~kalyan/thy.htm):
The Communication Complexity of Enumeration.. - Ambainis..   (Correct)
Rounds versus Time for the Two Person Pebble Game - Kalyanasundaram, Schnitger   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC