default search action
ANALCO 2014: Portland, Oregon, USA
- 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 - Kanal Hun, Brigitte Vallée:
Typical Depth of a Digital Search Tree built on a general source. 1-15 - Abram Magner, Charles Knessl, Wojciech Szpankowski:
Expected External Profile of PATRICIA Tries. 16-24 - Olivier Bodini, Bernhard Gittenberger
:
On the asymptotic number of BCK(2)-terms. 25-39 - Benjamin Dadoun
A statistical view on exchanges in Quickselect. 40-51 - Olivier Bernardi, Gwendal Collet, Éric Fusy:
A bijection for plane graphs and its applications. 52-61 - Mireille Régnier, Billy Fang, Daria Iakovishina:
Clump Combinatorics, Automata, and Word Asymptotics. 62-73 - Shirshendu Ganguly, Yuval Peres:
Permuted Random Walk Exits Typically in Linear Time. 74-81 - Benjamin Doerr, Marvin Künnemann:
Tight Analysis of Randomized Rumor Spreading in Complete Graphs. 82-91 - Michael J. Bannister, William E. Devanny, David Eppstein:
Small Superpatterns for Dominance Drawing. 92-103 - Noam Solomon, Shay Solomon:
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. 104-112 - Ravi Kalpathy
Survivors in Leader Election Algorithms. 113-120 - Pat Morin
On the Average Number of Edges in Theta Graphs. 121-132
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-19 22:19 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: