James Aisenberg

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

dblp:163/2331 · DBLP profile ↗

← Back

4ranked-venue papers

4as first author

0since 2021 · last 2020

—ORCID · none

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

Theory of computation · 4 · 4 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

2 papers

Computational complexity · 68% Graph algorithms and graph theory · 32%

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

Topic	Weight	Papers	Last	Evidence papers
Computational complexity proof complexity	0.5	2	2018	Short proofs of the Kneser-Lovász coloring principle · Inf. Comput. 2018 Short Proofs of the Kneser-Lovász Coloring Principle · ICALP (2) 2015
Computational complexity › proof complexity propositional proof complexity	0.3	1	2018	Short proofs of the Kneser-Lovász coloring principle · Inf. Comput. 2018
Graph algorithms and graph theory graph coloring	0.3	2	2018	Short Proofs of the Kneser-Lovász Coloring Principle · ICALP (2) 2015 Short proofs of the Kneser-Lovász coloring principle · Inf. Comput. 2018
Graph algorithms and graph theory graph theory	0.1	1	2018	Short proofs of the Kneser-Lovász coloring principle · Inf. Comput. 2018

Year	Publication	Venue	Position
2020	2-D Tucker is PPA complete James Aisenberg, Maria Luisa Bonet, Samuel R. Buss	J. Comput. Syst. Sci.	1
2018	Short proofs of the Kneser-Lovász coloring principle James Aisenberg, Maria Luisa Bonet, Samuel R. Buss, Adrian Craciun, Gabriel Istrate	Inf. Comput.	1
2016	Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Sets abstract Abstract We extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parameter t , we prove that Frankl’s Theorem has polynomial size AC 0 -Frege proofs from instances of the pigeonhole principle. James Aisenberg, Maria Luisa Bonet, Samuel R. Buss	J. Symb. Log.	1
2015	Short Proofs of the Kneser-Lovász Coloring Principle James Aisenberg, Maria Luisa Bonet, Samuel R. Buss, Adrian Craciun, Gabriel Istrate	ICALP (2)	1