On the public citation graph

Advances in pebbling

https://doi.org/10.1007/bfb0012787
0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10003-2_89openalex-snapshot
Pebbling mountain ranges and its application to DCFL-recognition
inferredcites →https://doi.org/10.1007/bf00286494openalex-snapshot
On alternation II
inferredcites →https://doi.org/10.1007/bf01683275openalex-snapshot
Space bounds for a game on graphs
inferredcites →https://doi.org/10.1016/0022-0000(81)90011-8openalex-snapshot
Pebbling with an auxiliary pushdown
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot
Graph-theoretic properties in computational complexity
inferredcites →https://doi.org/10.1016/s0022-0000(76)80048-7openalex-snapshot
Storage requirements for deterministic polynomialtime recognizable languages
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1109/focs.1965.14openalex-snapshot
Memory bounds for recognition of context-free and context-sensitive languages
inferredcites →https://doi.org/10.1109/sfcs.1981.50openalex-snapshot
Time-space trade-offs for general recursion
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0204020openalex-snapshot
Complete Register Allocation Problems
inferredcites →https://doi.org/10.1137/0206022openalex-snapshot
Superconcentrators
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot
Comparative schematology
inferredcites →https://doi.org/10.1145/322003.322015openalex-snapshot
On Time Versus Space
inferredcites →https://doi.org/10.1145/800135.804420openalex-snapshot
Upper and lower bounds on time-space tradeoffs
inferredcites →https://doi.org/10.1145/800135.804426openalex-snapshot
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1997.2640openalex-snapshot
An Infinite Pebble Game and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_71openalex-snapshot
Efficient Pebbling for List Traversal Synopses
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_11openalex-snapshot
Weighted graph separators and their applications
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_2openalex-snapshot
Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time
inferred← citeshttps://doi.org/10.1007/978-3-322-80139-5_5openalex-snapshot
Zeit- versus Platzkomplexität
inferred← citeshttps://doi.org/10.1007/bf02579166openalex-snapshot
Eigenvalues and expanders
inferred← citeshttps://doi.org/10.1007/bf02579382openalex-snapshot
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
inferred← citeshttps://doi.org/10.1007/bfb0058023openalex-snapshot
Recursion versus iteration at higher-orders
inferred← citeshttps://doi.org/10.1007/s004530010031openalex-snapshot
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/s10009-017-0459-0openalex-snapshot
Greedy pebbling for proof space compression
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90014-9openalex-snapshot
Better expanders and superconcentrators
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.048openalex-snapshot
Efficient pebbling for list traversal synopses with application to program rollback
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80008-5openalex-snapshot
Unraveling k-page graphs
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70165-xopenalex-snapshot
The Pebble Game and Logics of Programs
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1090/s0894-0347-1989-0965008-xopenalex-snapshot
Diameters and Eigenvalues
inferred← citeshttps://doi.org/10.1109/ccc.2001.933895openalex-snapshot
On separators, segregators and time versus space
inferred← citeshttps://doi.org/10.1109/icci.1992.227698openalex-snapshot
Nondeterministic and alternating computations
inferred← citeshttps://doi.org/10.1109/ipps.1993.262917openalex-snapshot
On synchronous strictly non-blocking concentrators and generalized-concentrators
inferred← citeshttps://doi.org/10.1109/sfcs.1982.85openalex-snapshot
Polynomial time algorithms for the MIN CUT problem on degree restricted trees
inferred← citeshttps://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715931openalex-snapshot
Eigenvalues, Expanders And Superconcentrators
inferred← citeshttps://doi.org/10.1137/s0097539795290350openalex-snapshot
Computations of Uniform Recurrence Equations Using Minimal Memory Size
inferred← citeshttps://doi.org/10.1145/22145.22156openalex-snapshot
Expanders, sorting in rounds and superconcentrators of limited depth
inferred← citeshttps://doi.org/10.1145/22145.22157openalex-snapshot
White pebbles help
inferred← citeshttps://doi.org/10.1145/2935764.2935807openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/800061.808731openalex-snapshot
Superconcentrators, generalizers and generalized connectors with limited depth
inferred← citeshttps://doi.org/10.1524/9783486595024.531openalex-snapshot
Literaturverzeichnis
inferred← citeshttps://doi.org/10.37236/34openalex-snapshot
Ramsey Theory Applications
inferred← citeshttps://doi.org/10.4086/toc.2010.v006a012openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6376openalex-snapshot
Fractional Pebbling Game Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0306104openalex-snapshot
Efficient pebbling for list traversal synopses
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.