Author:
Meyer auf der Heide Friedhelm
Subject
General Computer Science,Theoretical Computer Science
Reference8 articles.
1. Space bounds for a game on graphs;Paul;Math. Systems Theory,1976
2. Variations of a pebble game;Gilbert,1978
3. Storage requirements for deterministic polynomial time recognizable languages;Cook;Comput. System. Sci.,1976
4. An observation on time-storage trade off;Cook;J. Comput. System Sci.,1974
5. On time versus space;Hocroft;J. ACM,1977
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space;computational complexity;2021-05-01
2. Re-pairing brackets;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
3. On the Hardness of Red-Blue Pebble Games;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
4. A COMPREHENSIVE REVIEW ON GRAPH PEBBLING AND RUBBLING;Journal of Physics: Conference Series;2020-05-01
5. Pebble Games, Proof Complexity, and Time-Space Trade-offs;Logical Methods in Computer Science;2013-09-13