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

Laurent Bartholdi

dblp:64/3883 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-1243-6384ORCID · corroborated

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

Theory of computation · 2 · 2 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
1 paper
Computational complexity · 75% Algorithms and data structures · 25%

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

TopicWeightPapersLastEvidence papers
Computational complexity
circuit complexity		 0.412020
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems · CCC 2020
Algorithms and data structures › symbolic computation › computational algebra
group-theoretic problems		 0.412020
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems · CCC 2020
Computational complexity › complexity classes › PSPACE
PSPACE-completeness		 0.412020
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems · CCC 2020
Computational complexity › decision problems
word problem		 0.412020
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems · CCC 2020

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

reduction · 0.4lower bound · 0.4
YearPublicationVenuePosition
2020 Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems
abstract
We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk’s group and Thompson’s groups, we prove that their word problem is ALOGTIME-hard. For some of these groups (including Grigorchuk’s group and Thompson’s groups) we prove that the circuit value problem (which is equivalent to the circuit evaluation problem) is PSPACE-complete.
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
 CCC1
2018 A New Hierarchy for Automaton Semigroups
Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin
 CIAA1