Rounds versus time for the two person pebble game
From MaRDI portal
Publication:5096183
DOI10.1007/BFb0029012zbMath1492.68107MaRDI QIDQ5096183
Bala Kalyanasundaram, Georg Schnitger
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Unnamed Item
- Unnamed Item
- A universal prior for integers and estimation by minimum description length
- Speedups of deterministic machines by synchronous parallel machines
- On uniform circuit complexity
- On sparse graphs with dense long paths
- Circuit size is nonlinear in depth
- A New Pebble Game that Characterizes Parallel Complexity Classes
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- On Time Versus Space
- Superconcentrators
- Space bounds for a game on graphs
This page was built for publication: Rounds versus time for the two person pebble game