default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDANALCO 2007: New Orleans, Louisiana, USA
- Daniel Panario, Robert Sedgewick:
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2007, New Orleans, Louisiana, USA, January 06, 2007. SIAM 2007, ISBN 978-1-61197-297-9 - David Arthur:
Fast Sorting and Pattern-avoiding Permutations. 169-174 - Markus Kuba, Alois Panholzer:
Analysis of Insertion Costs in Priority Trees. 175-182 - Mark Daniel Ward:
The Average Profile of Suffix Trees. 183-193 - Amalia Duch, Conrado Martínez:
On the Average Cost of Insertions on Random Relaxed K-d Trees. 194-200 - Philippe Flajolet, Éric Fusy, Carine Pivoteau:
Boltzmann Sampling of Unlabeled Structures. 201-211 - Predrag R. Jelenkovic, Xiaozhu Kang:
LRU Caching with Moderately Heavy Request Distributions. 212-222 - Éric Fusy, Frédéric Giroire:
Estimating the Number of Active Flows in a Data Stream over a Sliding Window. 223-231 - Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin
, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-trees. 232-241 - Mordecai J. Golin, Xuerong Yong, Yuanping Zhang:
The Asymptotic Number of Spanning Trees in Circulant Graphs. 242-249 - Siddhartha Chaudhuri, Vladlen Koltun:
Smoothed Analysis of Probabilistic Roadmaps. 250-264 - Ali Akhavi, Jean-François Marckert, Alain Rouault:
On the Reduction of a Random Basis. 265-270 - Eda Cesaratto, Benoit Daireaux, Loïck Lhote, Véronique Maume-Deschamps, Brigitte Vallée:
Analysis of Fast Versions of the Euclid Algorithm. 271-285
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-09-26 01:03 CEST 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:
