researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
Filter by Tag
Filter by Author
[+]
OR
AND
NOT
1
Abram Magner
Alois Panholzer
Antoine Genitrini
Bernhard Gittenberger
Brigitte Vallée
Clemens Heuberger
Conrado Martínez
Dana Randall
Danièle Gardy
Jérémie Lumbroso
Mark Daniel Ward
Markus E. Nebel
Michael Drmota
Michael Mitzenmacher
Olivier Bodini
Ralph Neininger
Sebastian Wild
Wojciech Szpankowski
Yuval Peres
Éric Fusy
Filter by Top terms
[+]
OR
AND
NOT
1
algorithmics
algorithms
analco
analysis
analytic
average
combinatorics
degree
distributions
graph
graphs
january
new
number
proceedings
random
trees
usa
walks
workshop
ANALCO (analco)
Editions
Publications
Viewing Publication 1 - 100 from 196
2019
Ranked Schröder Trees
Olivier Bodini
,
Antoine Genitrini
,
Mehdi Naima
.
analco 2019
:
13-26
[doi]
Subcritical random hypergraphs, high-order components, and hypertrees
Oliver Cooley
,
Wenjie Fang
,
Nicola Del Giudice
,
Mihyun Kang
.
analco 2019
:
111-118
[doi]
Combinatorics of nondeterministic walks of the Dyck and Motzkin type
Elie de Panafieu
,
Mohamed Lamine Lamali
,
Michael Wallner
.
analco 2019
:
1-12
[doi]
Degree distributions of generalized hooking networks
Colin Desmarais
,
Cecilia Holmgren
.
analco 2019
:
103-110
[doi]
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)
James Allen Fill
,
Wei-Chun Hung
.
analco 2019
:
87-93
[doi]
Protection Number of Recursive Trees
Zbigniew Golebiewski
,
Mateusz Klimczak
.
analco 2019
:
45-53
[doi]
Reducing Simply Generated Trees by Iterative Leaf Cutting
Benjamin Hackl
,
Clemens Heuberger
,
Stephan G. Wagner
.
analco 2019
:
36-44
[doi]
Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences
Clemens Heuberger
,
Daniel Krenn
.
analco 2019
:
27-35
[doi]
Moments of Select Sets
Simon Langowski
,
Mark Daniel Ward
.
analco 2019
:
67-73
[doi]
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument
Johannes Lengler
,
Anders Martinsson
,
Angelika Steger
.
analco 2019
:
94-102
[doi]
Sesquickselect: One and a half pivots for cache-efficient selection
Conrado Martínez
,
Markus Nebel
,
Sebastian Wild
.
analco 2019
:
54-66
[doi]
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019
Marni Mishna
,
J. Ian Munro
, editors,
SIAM,
2019.
[doi]
Arithmetic Progression Hypergraphs: Examining the Second Moment Method
Michael Mitzenmacher
.
analco 2019
:
127-134
[doi]
Median-of-k Jumplists and Dangling-Min BSTs
Markus E. Nebel
,
Elisabeth Neumann
,
Sebastian Wild
.
analco 2019
:
74-86
[doi]
Random walks on graphs: new bounds on hitting, meeting, coalescing and returning
Roberto I. Oliveira
,
Yuval Peres
.
analco 2019
:
119-126
[doi]
2018
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts
Meng He 0001
,
Richard Peng
,
Yinzhan Xu
.
analco 2018
:
32-39
[doi]
Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs
Maryam Bahrani
,
Jérémie Lumbroso
.
analco 2018
:
143-157
[doi]
The complexity of the Multiple Pattern Matching Problem for random strings
Frédérique Bassino
,
Tsinjo Rakotoarimalala
,
Andrea Sportiello
.
analco 2018
:
40-53
[doi]
Polynomial tuning of multiparametric combinatorial samplers
Maciej Bendkowski
,
Olivier Bodini
,
Sergey Dovgal
.
analco 2018
:
92-106
[doi]
Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions
Megan Bernstein
,
Matthew Fahrbach
,
Dana Randall
.
analco 2018
:
107-117
[doi]
n, p
Colin Cooper
,
Alan M. Frieze
,
Samantha Petti
.
analco 2018
:
158-167
[doi]
On Induced Paths, Holes and Trees in Random Graphs
Kunal Dutta
,
C. R. Subramanian
.
analco 2018
:
168-177
[doi]
Theoretical analysis of beaconless geocast protocols in 1D
Joachim Gudmundsson
,
Irina Kostitsyna
,
Maarten Löffler
,
Tobias Müller
,
Vera Sacristán
,
Rodrigo I. Silveira
.
analco 2018
:
62-76
[doi]
Trace reconstruction with varying deletion probabilities
Lisa Hartung
,
Nina Holden
,
Yuval Peres
.
analco 2018
:
54-61
[doi]
On Deletions in Open Addressing Hashing
Rosa M. Jiménez
,
Conrado Martínez
.
analco 2018
:
23-31
[doi]
Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations
Jérémie Lumbroso
,
Jessica Shi
.
analco 2018
:
118-132
[doi]
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018
Markus E. Nebel
,
Stephan G. Wagner
, editors,
SIAM,
2018.
[doi]
Probabilistic Analysis of the Dual-Pivot Quicksort "Count"
Ralph Neininger
,
Jasmin Straub
.
analco 2018
:
1-7
[doi]
Asymptotic Enumeration of Graph Classes with Many Components
Konstantinos Panagiotou
,
Leon Ramzews
.
analco 2018
:
133-142
[doi]
Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
Chris Whidden
,
Frederick A. Matsen IV
.
analco 2018
:
77-91
[doi]
Quicksort Is Optimal For Many Equal Keys
Sebastian Wild
.
analco 2018
:
8-22
[doi]
2017
The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
Olivier Bodini
,
Matthieu Dien
,
Antoine Genitrini
,
Frédéric Peschanski
.
analco 2017
:
16-30
[doi]
Phase Transitions in Parameter Rich Optimization Problems
Joachim M. Buhmann
,
Julien Dumazert
,
Alexey Gronskiy
,
Wojciech Szpankowski
.
analco 2017
:
148-155
[doi]
On the cycle structure of the product of random maximal cycles
Miklós Bóna
,
Boris Pittel
.
analco 2017
:
1-15
[doi]
An Exact Enumeration of Distance-Hereditary Graphs
Cédric Chauve
,
Éric Fusy
,
Jérémie Lumbroso
.
analco 2017
:
31-45
[doi]
On Symmetries of Non-Plane Trees in a Non-Uniform Model
Jacek Cichon
,
Abram Magner
,
Wojciech Szpankowski
,
Krzysztof Turowski
.
analco 2017
:
156-163
[doi]
External Profile of Symmetric Digital Search Trees (Extended Abstract)
Michael Drmota
,
Michael Fuchs 0001
,
Hsien-Kuei Hwang
,
Ralph Neininger
.
analco 2017
:
124-130
[doi]
t trees
Amalia Duch
,
Gustavo Lau
.
analco 2017
:
131-138
[doi]
Multivariate CLT follows from strong Rayleigh property
Subhroshekhar Ghosh
,
Thomas M. Liggett
,
Robin Pemantle
.
analco 2017
:
139-147
[doi]
A note on the scaling limits of random Pólya trees
Bernhard Gittenberger
,
Emma Yu Jin
,
Michael Wallner
.
analco 2017
:
85-93
[doi]
An analogue to Dixon's theorem for automaton groups
Thibault Godin
.
analco 2017
:
164-173
[doi]
Iterative Cutting and Pruning of Planar Trees
Benjamin Hackl
,
Sara Kropf
,
Helmut Prodinger
.
analco 2017
:
66-72
[doi]
An Extended Note on the Comparison-optimal Dual-Pivot Quickselect
Daniel Krenn
.
analco 2017
:
115-123
[doi]
Rates of convergence for balanced irreducible two-color Pólya urns
Andrea Kuntschik
,
Ralph Neininger
.
analco 2017
:
94-99
[doi]
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017
Conrado Martínez
,
Mark Daniel Ward
, editors,
SIAM,
2017.
[doi]
A Refined Analysis of LSH for Well-dispersed Data Points
Wenlong Mou
,
Liwei Wang
.
analco 2017
:
174-182
[doi]
Isolated cycles of critical random graphs
Marc Noy
,
Vonjy Rasendrahasina
,
Vlady Ravelomanana
,
Juanjo Rué
.
analco 2017
:
46-55
[doi]
On the distribution of random walk hitting times in random trees
Joubert Oosthuizen
,
Stephan Wagner
.
analco 2017
:
73-84
[doi]
The recurrence function of a random Sturmian word
Pablo Rotondo
,
Brigitte Vallée
.
analco 2017
:
100-114
[doi]
Cycle Basis Markov Chains for the Ising Model
Amanda Pascoe Streib
,
Noah Streib
.
analco 2017
:
56-65
[doi]
2016
Randomized Strategies for Cardinality Robustness in the Knapsack Problem
Yusuke Kobayashi 0001
,
Kenjiro Takazawa
.
analco 2016
:
25-33
[doi]
Sampling Weighted Perfect Matchings on the Square-Octagon Lattice
Prateek Bhakta
,
Dana Randall
.
analco 2016
:
46-55
[doi]
Graphs with degree constraints
Elie de Panafieu
,
Lander Ramos
.
analco 2016
:
34-45
[doi]
k-trees
Michael Drmota
,
Emma Yu Jin
.
analco 2016
:
56-65
[doi]
Betweenness Centrality in Random Trees
Kevin Durant
,
Stephan Wagner
.
analco 2016
:
66-79
[doi]
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016
James Allen Fill
,
Mark Daniel Ward
, editors,
SIAM,
2016.
[doi]
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
Matús Mihalák
,
Przemyslaw Uznanski
,
Pencho Yordanov
.
analco 2016
:
93-105
[doi]
A New Approach to Analyzing Robin Hood Hashing
Michael Mitzenmacher
.
analco 2016
:
10-24
[doi]
More Analysis of Double Hashing for Balanced Allocations
Michael Mitzenmacher
.
analco 2016
:
1-9
[doi]
The CLT Analogue for Cyclic Urns
Noela S. Müller
,
Ralph Neininger
.
analco 2016
:
121-127
[doi]
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains
Takeharu Shiraga
,
Yukiko Yamauchi
,
Shuji Kijima
,
Masafumi Yamashita
.
analco 2016
:
138-148
[doi]
Ricci-Ollivier Curvature of the Rooted Phylogenetic Subtree-Prune-Regraft Graph
Chris Whidden
,
Frederick A. Matsen IV
.
analco 2016
:
106-120
[doi]
On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits
Panpan Zhang
.
analco 2016
:
80-92
[doi]
On Connectivity in a General Random Intersection Graph
Jun Zhao
,
Panpan Zhang
.
analco 2016
:
128-137
[doi]
2015
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
Ioannis Giotis 0001
,
Lefteris M. Kirousis
,
Kostas I. Psaromiligkos
,
Dimitrios M. Thilikos
.
analco 2015
:
16-25
[doi]
s-Intersection Graphs
Jun Zhao 0007
,
Osman Yagan
,
Virgil D. Gligor
.
analco 2015
:
1-15
[doi]
Lattice paths of slope 2/5
Cyril Banderier
,
Michael Wallner
.
analco 2015
:
105-113
[doi]
Linear-time generation of inhomogeneous random directed walks
Frédérique Bassino
,
Andrea Sportiello
.
analco 2015
:
51-65
[doi]
Cuts in Increasing Trees
Olivier Bodini
,
Antoine Genitrini
.
analco 2015
:
66-77
[doi]
Analytic Samplers and the Combinatorial Rejection Method
Olivier Bodini
,
Jérémie Lumbroso
,
Nicolas Rolin
.
analco 2015
:
40-50
[doi]
Bootstrap Percolation on Periodic Trees
Milan Bradonjic
,
Iraj Saniee
.
analco 2015
:
89-96
[doi]
Variance of Size in Regular Graph Tries
Philippe Jacquet
,
Abram Magner
.
analco 2015
:
97-104
[doi]
On Distributed Cardinality Estimation: Random Arcs Recycled
Marcin Kardas
,
Miroslaw Kutylowski
,
Jakub Lemiesz
.
analco 2015
:
129-137
[doi]
A Bound for the Diameter of Random Hyperbolic Graphs
Marcos A. Kiwi
,
Dieter Mitsche
.
analco 2015
:
26-39
[doi]
Analysis of Branch Misses in Quicksort
Conrado Martínez
,
Markus E. Nebel
,
Sebastian Wild
.
analco 2015
:
114-128
[doi]
Repeated fringe subtrees in random rooted trees
Dimbinaina Ralaivaosaona
,
Stephan Wagner
.
analco 2015
:
78-88
[doi]
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015
Robert Sedgewick
,
Mark Daniel Ward
, editors,
SIAM,
2015.
[doi]
2014
Small Superpatterns for Dominance Drawing
Michael J. Bannister
,
William E. Devanny
,
David Eppstein
.
analco 2014
:
92-103
[doi]
A bijection for plane graphs and its applications
Olivier Bernardi
,
Gwendal Collet
,
Éric Fusy
.
analco 2014
:
52-61
[doi]
BCK(2)-terms
Olivier Bodini
,
Bernhard Gittenberger
.
analco 2014
:
25-39
[doi]
A statistical view on exchanges in Quickselect
Benjamin Dadoun
,
Ralph Neininger
.
analco 2014
:
40-51
[doi]
Tight Analysis of Randomized Rumor Spreading in Complete Graphs
Benjamin Doerr
,
Marvin Künnemann
.
analco 2014
:
82-91
[doi]
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014
Michael Drmota
,
Mark Daniel Ward
, editors,
SIAM,
2014.
[doi]
Permuted Random Walk Exits Typically in Linear Time
Shirshendu Ganguly
,
Yuval Peres
.
analco 2014
:
74-81
[doi]
Typical Depth of a Digital Search Tree built on a general source
Kanal Hun
,
Brigitte Vallée
.
analco 2014
:
1-15
[doi]
Survivors in Leader Election Algorithms
Ravi Kalpathy
,
Hosam M. Mahmoud
,
Walter Rosenkrantz
.
analco 2014
:
113-120
[doi]
Expected External Profile of PATRICIA Tries
Abram Magner
,
Charles Knessl
,
Wojciech Szpankowski
.
analco 2014
:
16-24
[doi]
On the Average Number of Edges in Theta Graphs
Pat Morin
,
Sander Verdonschot
.
analco 2014
:
121-132
[doi]
Clump Combinatorics, Automata, and Word Asymptotics
Mireille Régnier
,
Billy Fang
,
D. Iakovishina
.
analco 2014
:
62-73
[doi]
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem
Noam Solomon
,
Shay Solomon
.
analco 2014
:
104-112
[doi]
2013
Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification
Axel Bacher
,
Olivier Bodini
,
Alice Jacquot
.
analco 2013
:
52-61
[doi]
Bootstrap Percolation on Random Geometric Graphs
Milan Bradonjic
,
Iraj Saniee
.
analco 2013
:
18-24
[doi]
On Delta-Method of Moments and Probabilistic Sums
Jacek Cichon
,
Zbigniew Golebiewski
,
Marcin Kardas
,
Marek Klonowski
.
analco 2013
:
91-98
[doi]
Extremal Parameters in Sub-Critical Graph Classes
Michael Drmota
,
Marc Noy
.
analco 2013
:
1-7
[doi]
Approximating Fault-Tolerant Domination in General Graphs
Klaus-Tycho Förster
.
analco 2013
:
25-32
[doi]
The Variance of the Number of 2-Protected Nodes in a Trie
Jeffrey Gaither
,
Mark Daniel Ward
.
analco 2013
:
43-51
[doi]
Unlabeled equivalence for matroids representable over finite fields
S. R. Kingan
.
analco 2013
:
99-106
[doi]
Perpetuities in fair leader election algorithms
Hosam Mahmoud
.
analco 2013
:
62-71
[doi]
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013
Markus E. Nebel
,
Wojciech Szpankowski
, editors,
SIAM,
2013.
Approximate Counting of Matchings in Sparse Uniform Hypergraphs
Edyta Szymanska
,
Marek Karpinski
,
Andrzej Rucinski 0001
.
analco 2013
:
72-79
[doi]
Sign in
or
sign up
to see more results.