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 EDBT 2026 / reviewers in the wild / expert

Peter Doyle

dblp:77/6998 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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
2 papers
Approximation and online algorithms · 67% Graph algorithms and graph theory · 33%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
online algorithms		 0.021993
Random Walks on Weighted Graphs and Applications to On-line Algorithms · J. ACM 1993
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) · STOC 1990
Approximation and online algorithms › online algorithms
randomized online algorithms		 0.021993
Random Walks on Weighted Graphs and Applications to On-line Algorithms · J. ACM 1993
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) · STOC 1990
Graph algorithms and graph theory
random walk		 0.021993
Random Walks on Weighted Graphs and Applications to On-line Algorithms · J. ACM 1993
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) · STOC 1990

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

markov chain · 0.0competitive analysis · 0.0
YearPublicationVenuePosition
1994 The Asymptotic Value of the Circle-Packing Rigidity Constants Sn
Peter Doyle, Zheng-Xu He, Burt Rodin
 Discret. Comput. Geom.1
1994 Second Derivatives of Circle Packing and Conformal Mapping
Peter Doyle, Zheng-Xu He, Burt Rodin
 Discret. Comput. Geom.1
1993 Random Walks on Weighted Graphs and Applications to On-line Algorithms
abstract
The design and analysis of randomized on-line algorithms are studied.This problem is shown to be closely related to the synthesis of random wdlks on graphs with positive real costs on their edges.A theory is developed for the synthesis of such wdlks, and it is employed to design competitive on-line algorithms.
Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir
 J. ACM2
1990 Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)
abstract
We study the design and analysis of randomized on-line algorithms.We show that this problem is closely related to the synthesis of random walks on graphs with positive real costs on their edges.
Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir
 STOC2