- Panpan Zhang:
On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits. ANALCO 2016: 80-92 - Jun Zhao, Panpan Zhang:
On Connectivity in a General Random Intersection Graph. ANALCO 2016: 128-137 - James Allen Fill, Mark Daniel Ward:
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016. SIAM 2016, ISBN 978-1-61197-432-4 [contents] - 2015
- Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. ANALCO 2015: 16-25 - Jun Zhao, Osman Yagan, Virgil D. Gligor:
On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs. ANALCO 2015: 1-15 - Cyril Banderier, Michael Wallner
:
Lattice paths of slope 2/5. ANALCO 2015: 105-113 - Frédérique Bassino, Andrea Sportiello:
Linear-time generation of inhomogeneous random directed walks. ANALCO 2015: 51-65 - Olivier Bodini, Antoine Genitrini:
Cuts in Increasing Trees. ANALCO 2015: 66-77 - Olivier Bodini, Jérémie O. Lumbroso, Nicolas Rolin:
Analytic Samplers and the Combinatorial Rejection Method. ANALCO 2015: 40-50 - Milan Bradonjic, Iraj Saniee:
Bootstrap Percolation on Periodic Trees. ANALCO 2015: 89-96 - Philippe Jacquet, Abram Magner:
Variance of Size in Regular Graph Tries. ANALCO 2015: 97-104 - Marcin Kardas, Miroslaw Kutylowski, Jakub Lemiesz:
On Distributed Cardinality Estimation: Random Arcs Recycled. ANALCO 2015: 129-137 - Marcos A. Kiwi, Dieter Mitsche:
A Bound for the Diameter of Random Hyperbolic Graphs. ANALCO 2015: 26-39 - Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. ANALCO 2015: 114-128 - Dimbinaina Ralaivaosaona, Stephan G. Wagner:
Repeated fringe subtrees in random rooted trees. ANALCO 2015: 78-88 - Robert Sedgewick, Mark Daniel Ward:
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015. SIAM 2015, ISBN 978-1-61197-376-1 [contents] - 2014
- Michael J. Bannister, William E. Devanny, David Eppstein:
Small Superpatterns for Dominance Drawing. ANALCO 2014: 92-103 - Olivier Bernardi, Gwendal Collet, Éric Fusy:
A bijection for plane graphs and its applications. ANALCO 2014: 52-61 - Olivier Bodini, Bernhard Gittenberger:
On the asymptotic number of BCK(2)-terms. ANALCO 2014: 25-39 - Benjamin Dadoun, Ralph Neininger:
A statistical view on exchanges in Quickselect. ANALCO 2014: 40-51 - Benjamin Doerr, Marvin Künnemann:
Tight Analysis of Randomized Rumor Spreading in Complete Graphs. ANALCO 2014: 82-91 - Shirshendu Ganguly, Yuval Peres:
Permuted Random Walk Exits Typically in Linear Time. ANALCO 2014: 74-81 - Kanal Hun, Brigitte Vallée:
Typical Depth of a Digital Search Tree built on a general source. ANALCO 2014: 1-15 - Ravi Kalpathy, Hosam M. Mahmoud, Walter Rosenkrantz:
Survivors in Leader Election Algorithms. ANALCO 2014: 113-120 - Abram Magner, Charles Knessl, Wojciech Szpankowski:
Expected External Profile of PATRICIA Tries. ANALCO 2014: 16-24 - Pat Morin, Sander Verdonschot:
On the Average Number of Edges in Theta Graphs. ANALCO 2014: 121-132 - Mireille Régnier, Billy Fang, Daria Iakovishina:
Clump Combinatorics, Automata, and Word Asymptotics. ANALCO 2014: 62-73 - Noam Solomon, Shay Solomon:
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. ANALCO 2014: 104-112 - Michael Drmota, Mark Daniel Ward:
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014. SIAM 2014, ISBN 978-1-61197-320-4 [contents]
