default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAxel Bacher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
[b1]Axel Bacher:
Chemins et animaux : applications de la théorie des empilements de pièces. (Walks and animals: applications of the theory of heaps of pieces). University of Bordeaux, France, 2011
Journal Articles
- 2020
- [j7]Andrei Asinowski
, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata. Algorithmica 82(3): 386-428 (2020) - 2017
- [j6]Axel Bacher, Olivier Bodini, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation. ACM Trans. Algorithms 13(2): 24:1-24:43 (2017) - [j5]Axel Bacher, Olivier Bodini, Alice Jacquot:
Efficient random sampling of binary and unary-binary trees via holonomic equations. Theor. Comput. Sci. 695: 42-53 (2017) - 2016
- [j4]Axel Bacher, Andrea Sportiello:
Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution. Algorithmica 75(4): 812-831 (2016) - 2014
- [j3]Axel Bacher, Antonio Bernini, Luca Ferrari, Benjamin Gunby, Renzo Pinzani, Julian West:
The Dyck pattern poset. Discret. Math. 321: 12-23 (2014) - 2012
- [j2]Axel Bacher:
Average site perimeter of directed animals on the two-dimensional lattices. Discret. Math. 312(5): 1038-1058 (2012) - 2011
- [j1]Axel Bacher, Mireille Bousquet-Mélou:
Weakly directed self-avoiding walks. J. Comb. Theory A 118(8): 2365-2391 (2011)
Conference and Workshop Papers
- 2024
- [c5]Axel Bacher:
Progressive and Rushed Dyck Paths. GASCom 2024: 29-34 - 2018
- [c4]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem. AofA 2018: 10:1-10:14 - [c3]Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso:
MergeShuffle: a very fast, parallel random permutation algorithm. GASCom 2018: 43-52 - [c2]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. LATA 2018: 195-206 - 2013
- [c1]Axel Bacher, Olivier Bodini, Alice Jacquot:
Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification. ANALCO 2013: 52-61
Informal and Other Publications
- 2018
- [i3]Axel Bacher:
Improving the Florentine algorithms: recovering algorithms for Motzkin and Schröder paths. CoRR abs/1802.06030 (2018) - 2015
- [i2]Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso:
MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm. CoRR abs/1508.03167 (2015) - 2014
- [i1]Axel Bacher, Olivier Bodini, Alice Jacquot:
Efficient random sampling of binary and unary-binary trees via holonomic equations. CoRR abs/1401.1140 (2014)
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-11-04 21:43 CET 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:
