- 2013
- 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 - Jérémie Du Boisberranger, Danièle Gardy, Xavier Lorca
, Charlotte Truchet:
When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. ANALCO 2013: 80-90 - Miklós Bóna, Andrew Vince:
The number of ways to assemble a graph. ANALCO 2013: 8-17 - Milan Bradonjic, Iraj Saniee:
Bootstrap Percolation on Random Geometric Graphs. ANALCO 2013: 18-24 - Jacek Cichon, Zbigniew Golebiewski, Marcin Kardas, Marek Klonowski:
On Delta-Method of Moments and Probabilistic Sums. ANALCO 2013: 91-98 - Michael Drmota, Marc Noy:
Extremal Parameters in Sub-Critical Graph Classes. ANALCO 2013: 1-7 - Klaus-Tycho Förster:
Approximating Fault-Tolerant Domination in General Graphs. ANALCO 2013: 25-32 - Jeffrey Gaither, Mark Daniel Ward:
The Variance of the Number of 2-Protected Nodes in a Trie. ANALCO 2013: 43-51 - Clemens Heuberger, Daniel Krenn, Stephan G. Wagner:
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. ANALCO 2013: 33-42 - Sandra R. Kingan:
Unlabeled equivalence for matroids representable over finite fields. ANALCO 2013: 99-106 - Hosam M. Mahmoud:
Perpetuities in fair leader election algorithms. ANALCO 2013: 62-71 - Edyta Szymanska, Marek Karpinski, Andrzej Rucinski:
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. ANALCO 2013: 72-79 - Markus E. Nebel, Wojciech Szpankowski:
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. SIAM 2013, ISBN 978-1-61197-254-2 [contents] - 2012
- Cyril Banderier, Olivier Bodini, Yann Ponty, Hanane Tafat Bouzid:
Biodiversity of Pattern Distributions in Combinatorial Ecosystems. ANALCO 2012: 107-115 - Michael J. Bannister, David Eppstein:
Randomized Speedup of the Bellman-Ford Algorithm. ANALCO 2012: 41-47 - Yuliy M. Baryshnikov, Vadim Zharnitsky:
Search on the Brink of Chaos. ANALCO 2012: 65-74 - Guy E. Blelloch:
Problem Based Benchmarks. ANALCO 2012 - Amin Coja-Oghlan, Alan M. Frieze:
Analyzing Walksat on Random Formulas. ANALCO 2012: 48-55 - Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. ANALCO 2012: 9-15 - Ahmed Helmi, Alois Panholzer:
Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem. ANALCO 2012: 75-83 - Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann:
Inequalities for the Number of Walks in Graphs. ANALCO 2012: 26-39 - Emma Yu Jin, Markus E. Nebel:
The Expected Order of Saturated RNA Secondary Structures. ANALCO 2012: 84-91 - Shuji Kijima, Kentaro Koga, Kazuhisa Makino:
Deterministic Random Walks on Finite Graphs. ANALCO 2012: 16-25 - Jérémie O. Lumbroso, Olivier Bodini:
Dirichlet Random Samplers for Multiplicative Combinatorial Structures. ANALCO 2012: 92-106 - J. Ian Munro:
The Complexity of Partial Orders. ANALCO 2012: 40 - Stephan G. Wagner:
Asymptotic Enumeration of Extensional Acyclic Digraphs. ANALCO 2012: 1-8 - Osamu Watanabe:
Message Passing Algorithms for MLS-3LIN Problem. ANALCO 2012: 56-64 - Conrado Martínez, Hsien-Kuei Hwang:
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012. SIAM 2012, ISBN 978-1-61197-213-9 [contents] - 2011
- Michael Fuchs:
The Subtree Size Profile of Plane-oriented Recursive Trees. ANALCO 2011: 85-92 - Hamed Amini, Moez Draief, Marc Lelarge:
Flooding and Diameter in Weighted Random Graphs. ANALCO 2011: 1-15
