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

Christopher Purcell

dblp:127/3537 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0001-9869-1097ORCID · verified

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

Theory of computation · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 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
1 paper
Distributed computing theory · 50% Graph algorithms and graph theory · 50%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › planar graphs
grid graphs		 0.312017
LCL Problems on Grids · PODC 2017
Distributed computing theory › local algorithms
locally checkable labeling		 0.312017
LCL Problems on Grids · PODC 2017
YearPublicationVenuePosition
2022 The parameterized complexity of manipulating Top Trading Cycles
William Phan, Christopher Purcell
 Auton. Agents Multi Agent Syst.2
2021 Role colouring graphs in hereditary classes
Christopher Purcell, M. Puck Rombach
 Theor. Comput. Sci.1
2017 LCL Problems on Grids
abstract
LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of O(1), Θ(log* n), or Θ(n), and the design of optimal algorithms can be fully automated. This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: O(1), Θ(log* n), and Θ(n). However, given an LCL problem it is undecidable whether its complexity is Θ(log* n) or Θ(n) in 2-dimensional grids.
Sebastian Brandt 0002, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
 PODC6
2015 Independent domination in finitely defined classes of graphs: Polynomial algorithms
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
 Discret. Appl. Math.3
2013 Boundary properties of the satisfiability problems
Vadim V. Lozin, Christopher Purcell
 Inf. Process. Lett.2