default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Bartholdi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i20]Laurent Bartholdi, Ville Salo:
Shifts on the lamplighter group. CoRR abs/2402.14508 (2024)- [i19]Laurent Bartholdi, Ville Salo:
Snakes can be fooled into thinking they live in a tree. CoRR abs/2409.14525 (2024) - 2023
- [i18]Laurent Bartholdi, Roman Mikhailov:
The Topology of Poker. CoRR abs/2305.02023 (2023) - 2022
- [j11]Laurent Bartholdi
, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. ACM Trans. Comput. Theory 14(3-4): 1-41 (2022) - 2021
- [p2]Laurent Bartholdi, Pedro V. Silva:
Rational subsets of groups. Handbook of Automata Theory (II.) 2021: 841-869 - [p1]Laurent Bartholdi, Pedro V. Silva:
Groups defined by automata. Handbook of Automata Theory (II.) 2021: 871-911 - 2020
- [j10]Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin:
A New Hierarchy for Automaton Semigroups. Int. J. Found. Comput. Sci. 31(8): 1069-1089 (2020) - [c4]Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. CCC 2020: 29:1-29:29 - [i17]Laurent Bartholdi, Ville Salo:
Simulations and the Lamplighter group. CoRR abs/2010.14299 (2020) - [i16]Laurent Bartholdi:
Monadic second-order logic and the domino problem on self-similar graphs. CoRR abs/2011.02735 (2020)
2010 – 2019
- 2019
- [c3]Laurent Bartholdi, Wade Hann-Caruthers, Maya Josyula, Omer Tamuz, Leeat Yariv:
Equitable Voting Rules. EC 2019: 315 - [i15]Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. CoRR abs/1909.13781 (2019) - 2018
- [c2]Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin:
A New Hierarchy for Automaton Semigroups. CIAA 2018: 71-83 - [i14]Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin:
A new hierarchy for automaton semigroups. CoRR abs/1803.09991 (2018) - 2017
- [i13]Laurent Bartholdi:
Decidability problems in automaton semigroups. CoRR abs/1705.04598 (2017) - [i12]Laurent Bartholdi, Thorsten Groth, Igor Lysenok:
Commutator width in the first Grigorchuk group. CoRR abs/1710.05706 (2017) - [i11]Laurent Bartholdi, Ivan Mitrofanov:
The word and order problems for self-similar and automata groups. CoRR abs/1710.10109 (2017) - 2016
- [c1]Laurent Bartholdi:
Algorithmic Decidability of Engel's Property for Automaton Groups. CSR 2016: 29-40 - [i10]Laurent Bartholdi, Dzmitry Dudko:
Algorithmic aspects of branched coverings II. Sphere bisets and their decompositions. CoRR abs/1603.04059 (2016) - [i9]Laurent Bartholdi:
Amenability of groups is characterized by Myhill's Theorem. CoRR abs/1605.09133 (2016) - 2015
- [j9]Laurent Bartholdi, Xavier Buff, Hans-Christian Graf von Bothmer, Jakob Kröker:
Algorithmic Construction of Hurwitz Maps. Exp. Math. 24(1): 76-92 (2015) - [j8]Laurent Bartholdi, Inder Bir S. Passi:
Lie dimension subrings. Int. J. Algebra Comput. 25(8): 1301-1325 (2015) - [i8]Laurent Bartholdi:
Algorithmic decidability of Engel's property for automaton groups. CoRR abs/1512.01717 (2015) - [i7]Laurent Bartholdi:
The rational homology of the outer automorphism group of $F_7$. CoRR abs/1512.03075 (2015) - [i6]Laurent Bartholdi, Dzmitry Dudko:
Algorithmic aspects of branched coverings. CoRR abs/1512.05948 (2015) - 2012
- [j7]Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale:
Hodge Theory on Metric Spaces. Found. Comput. Math. 12(1): 1-48 (2012) - [j6]Glenn C. Rhoads, Laurent Bartholdi:
Computer Solution to the Game of Pure Strategy. Games 3(4): 150-156 (2012) - [i5]Glenn C. Rhoads, Laurent Bartholdi:
The Game of Pure Strategy is solved! CoRR abs/1202.0695 (2012) - 2010
- [j5]Laurent Bartholdi, Olivier Siegenthaler:
The Twisted Twin of the Grigorchuk Group. Int. J. Algebra Comput. 20(4): 465-488 (2010) - [i4]Laurent Bartholdi, Pedro V. Silva:
Groups defined by automata. CoRR abs/1012.1531 (2010) - [i3]Laurent Bartholdi, Pedro V. Silva:
Rational subsets of groups. CoRR abs/1012.1532 (2010)
2000 – 2009
- 2009
- [i2]Laurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale, Anthony W. Baker:
Hodge Theory on Metric Spaces. CoRR abs/0912.0284 (2009) - 2008
- [j4]Laurent Bartholdi, Illya I. Reznykov:
A Mealy Machine with Polynomial Growth of Irrational Degree. Int. J. Algebra Comput. 18(1): 59-82 (2008) - [j3]Laurent Bartholdi, Bettina Eick, René Hartung:
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications. Int. J. Algebra Comput. 18(8): 1321-1344 (2008) - 2007
- [i1]Laurent Bartholdi:
A converse to Moore's theorem on cellular automata. CoRR abs/0709.4280 (2007) - 2001
- [j2]Laurent Bartholdi:
Lower Bounds on The Growth of a Group Acting on the Binary Rooted Tree. Int. J. Algebra Comput. 11(1): 73-88 (2001) - 2000
- [j1]Laurent Bartholdi:
Lamps, Factorizations, and Finite Fields. Am. Math. Mon. 107(5): 429-436 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
