default search action
ANALCO 2018: New Orleans, LA, USA
- Markus E. Nebel, Stephan G. Wagner:
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018. SIAM 2018, ISBN 978-1-61197-506-2 - Ralph Neininger, Jasmin Straub:
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". 1-7 - Sebastian Wild
:
Quicksort Is Optimal For Many Equal Keys. 8-22 - Rosa M. Jiménez, Conrado Martínez:
On Deletions in Open Addressing Hashing. 23-31 - Meng He
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. 32-39 - Frédérique Bassino
The complexity of the Multiple Pattern Matching Problem for random strings. 40-53 - Lisa Hartung, Nina Holden, Yuval Peres:
Trace reconstruction with varying deletion probabilities. 54-61 - Joachim Gudmundsson, Irina Kostitsyna
Theoretical analysis of beaconless geocast protocols in 1D. 62-76 - Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Polynomial tuning of multiparametric combinatorial samplers. 92-106 - Megan Bernstein, Matthew Fahrbach, Dana Randall:
Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions. 107-117 - Jérémie O. Lumbroso
Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations. 118-132 - Konstantinos Panagiotou, Leon Ramzews:
Asymptotic Enumeration of Graph Classes with Many Components. 133-142 - Maryam Bahrani, Jérémie O. Lumbroso
Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs. 143-157 - Colin Cooper, Alan M. Frieze, Samantha Petti
The cover time of a biased random walk on Gn, p. 158-167 - Kunal Dutta, C. R. Subramanian:
On Induced Paths, Holes and Trees in Random Graphs. 168-177
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.
last updated on 2024-12-17 20:46 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: