default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDANALCO 2008: San Francisco, California, USA
- Robert Sedgewick, Wojciech Szpankowski:
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008, ISBN 978-1-61197-298-6 - George S. Lueker:
On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences. 169-182 - Manuel E. Lladser
:
Markovian Embeddings of General Random Strings. 183-190 - Ankur Gupta, Roberto Grossi, Jeffrey Scott Vitter:
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform. 191-202 - David Talbot, John M. Talbot:
Bloom Maps. 203-212 - Van Nguyen, Chip Martel:
Augmented Graph Models for Small-World Analysis with Geographic Factors. 213-227 - Akihiro Matsuura:
Exact Analysis of the Recurrence Relations Generalized from the Tower of Hanoi. 228-233 - Conrado Martínez, Alois Panholzer, Helmut Prodinger:
Generating Random Derangements. 234-240 - Heidi Gebauer:
On the Number of Hamilton Cycles in Bounded Degree Graphs. 241-248 - James Allen Fill, Takéhiko Nakama:
Analysis of the Expected Number of Bit Comparisons Required by Quickselect. 249-256
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 2025-02-19 00:50 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:
