Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

James R. Celoni

dblp:32/6400 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1977
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 75% Graph algorithms and graph theory · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph algorithms		 0.011976
Space Bounds for a Game of Graphs · STOC 1976
Computational complexity › time-space tradeoffs
graph pebbling		 0.011976
Space Bounds for a Game of Graphs · STOC 1976
Computational complexity › space complexity
pebble game		 0.011976
Space Bounds for a Game of Graphs · STOC 1976
Computational complexity
space complexity		 0.011976
Space Bounds for a Game of Graphs · STOC 1976

Methods — techniques the papers use, named apart from their topics

combinatorial analysis · 0.0
YearPublicationVenuePosition
1977 Space Bounds for a Game on Graphs
Wolfgang J. Paul, Robert E. Tarjan, James R. Celoni
 Math. Syst. Theory3
1977 Correction: Space Bounds for a Game on Graphs
Wolfgang J. Paul, Robert E. Tarjan, James R. Celoni
 Math. Syst. Theory3
1976 Space Bounds for a Game of Graphs
abstract
We study a one-person game played by placing pebbles, according to certain rules, on the vertices of a directed graph. In [3] it was shown that for each graph with n vertices and maximum in-degree d , there is a pebbling strategy which requires at most c(d) n/log n pebbles. Here we show that this bound is tight to within a constant factor. We also analyze a variety of pebbling algorithms, including one which achieves the 0(n/log n) bound.
Wolfgang J. Paul, Robert E. Tarjan, James R. Celoni
 STOC3