Reversible pebble game on trees
From MaRDI portal
Publication:3196374
DOI10.1007/978-3-319-21398-9_7zbMATH Open1466.68044OpenAlexW1144493394MaRDI QIDQ3196374FDOQ3196374
Authors: Balagopal Komarath, Jayalal Sarma M. N., Saurabh Sawlani 
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_7
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Title not available (Why is that?)
- A polynomial algorithm for the min-cut linear arrangement of trees
- Speedups of deterministic machines by synchronous parallel machines
- Complete Register Allocation Problems
- Separation of the monotone NC hierarchy
- Time/Space Trade-Offs for Reversible Computation
- The Pebbling Problem is Complete in Polynomial Space
- The PSPACE-Completeness of Black-White Pebbling
- Title not available (Why is that?)
Cited In (9)
- Rounds versus time for the two person pebble game
- Optimizing quantum space using spooky pebble games
- Title not available (Why is that?)
- The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Rounds versus time for the two person pebble game (extended abstract)
- Efficient pebbling for list traversal synopses with application to program rollback
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Pebbling meets coloring: reversible pebble game on trees
This page was built for publication: Reversible pebble game on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196374)
