


default search action
ANALCO 2015: San Diego, CA, USA
- 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 - Jun Zhao, Osman Yagan, Virgil D. Gligor:

On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs. 1-15 - Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:

On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. 16-25 - Marcos A. Kiwi, Dieter Mitsche:

A Bound for the Diameter of Random Hyperbolic Graphs. 26-39 - Olivier Bodini, Jérémie O. Lumbroso, Nicolas Rolin:

Analytic Samplers and the Combinatorial Rejection Method. 40-50 - Frédérique Bassino, Andrea Sportiello:

Linear-time generation of inhomogeneous random directed walks. 51-65 - Olivier Bodini, Antoine Genitrini:

Cuts in Increasing Trees. 66-77 - Dimbinaina Ralaivaosaona, Stephan G. Wagner:

Repeated fringe subtrees in random rooted trees. 78-88 - Milan Bradonjic, Iraj Saniee:

Bootstrap Percolation on Periodic Trees. 89-96 - Philippe Jacquet, Abram Magner:

Variance of Size in Regular Graph Tries. 97-104 - Cyril Banderier, Michael Wallner

:
Lattice paths of slope 2/5. 105-113 - Conrado Martínez, Markus E. Nebel, Sebastian Wild

:
Analysis of Branch Misses in Quicksort. 114-128 - Marcin Kardas, Miroslaw Kutylowski, Jakub Lemiesz

:
On Distributed Cardinality Estimation: Random Arcs Recycled. 129-137

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














