Demo Data from EDBT 2026 / reviewers in the wild / expert
Philipp Hertel
dblp:17/1755
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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
3 papers |
Computational complexity · 84% Logic in computer science · 8% Automated reasoning and model checking · 8% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
black-white pebbling |
0.2 | 2 | 2010 | The PSPACE-Completeness of Black-White Pebbling · SIAM J. Comput. 2010 Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling · FOCS 2007 |
Computational complexity
space complexity |
0.2 | 2 | 2010 | The PSPACE-Completeness of Black-White Pebbling · SIAM J. Comput. 2010 Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling · FOCS 2007 |
Computational complexity
proof complexity |
0.2 | 2 | 2008 | Clause Learning Can Effectively P-Simulate General Propositional Resolution · AAAI 2008 Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling · FOCS 2007 |
Computational complexity › complexity classes › PSPACE
PSPACE-completeness |
0.1 | 1 | 2010 | The PSPACE-Completeness of Black-White Pebbling · SIAM J. Comput. 2010 |
Automated reasoning and model checking › satisfiability › SAT solving
clause learning |
0.1 | 1 | 2008 | Clause Learning Can Effectively P-Simulate General Propositional Resolution · AAAI 2008 |
Logic in computer science
proof theory |
0.1 | 1 | 2008 | Clause Learning Can Effectively P-Simulate General Propositional Resolution · AAAI 2008 |
Computational complexity › proof complexity
resolution |
0.1 | 1 | 2008 | Clause Learning Can Effectively P-Simulate General Propositional Resolution · AAAI 2008 |
Computational complexity › space complexity
pebble game |
0.1 | 1 | 2007 | Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling · FOCS 2007 |
Computational complexity › proof complexity › resolution
resolution space |
0.1 | 1 | 2007 | Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling · FOCS 2007 |
Methods — techniques the papers use, named apart from their topics
proof simulation · 0.1exponential speedup construction · 0.1PSPACE-completeness reduction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | The PSPACE-Completeness of Black-White PebblingabstractThe complexity of the black-white pebbling game has remained an open problem for 30 years. In this paper we show that the black-white pebbling game is PSPACE-complete. Philipp Hertel, Toniann Pitassi |
SIAM J. Comput. | 1 |
| 2008 | Clause Learning Can Effectively P-Simulate General Propositional Resolution
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder |
AAAI | 1 |
| 2007 | Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White PebblingabstractThe complexity of the Black-White Pebbling Game has remained open for 30 years. It was devised to capture the power of non-deterministic space bounded computation. Since then it has been applied to problems in diverse areas of computer science including VLSI design and more recently propositional proof complexity. In this paper we show that the Black-While Pebbling Game is PSPACE-complete. We then use similar ideas in a more complicated reduction to prove the PSPACE-completeness of Resolution space. The reduction also yields a surprising exponential time/space speedup for Resolution in which an increase of 3 units of space results in an exponential decrease in proof-size. Philipp Hertel, Toniann Pitassi |
FOCS | 1 |
| 2007 | Formalizing Dangerous SAT Encodings
Alexander Hertel, Philipp Hertel, Alasdair Urquhart |
SAT | 2 |
| 2002 | An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover
Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel |
ISAAC | 4 |