| 1-10 |
Distribution of inter-node distances in digital trees
Rafik Aguech and Nabil Lasmar and Hosam Mahmoud
|
| 11-16 |
Position of the maximum in a sequence with geometric distribution
M. Archibald
|
| 17-26 |
Near--perfect non-crossing harmonic matchings in randomly labeled points on a circle
József Balogh and Boris Pittel and Gelasio Salazar
|
| 27-38 |
Asymptotic analysis of a nonlinear AIMD algorithm
Y. Baryshnikov and E. Coffman and J. Feng and P. Momčilović
|
| 39-48 |
Convex hull for intersections of random lines
Daniel Berend and Vladimir Braverman
|
| 49-58 |
Cache efficient simple dynamic programming
Cary Cherng and Richard E. Ladner
|
| 59-70 |
Algorithmic and combinatoric aspects of multiple harmonic sums
Christian Costermans and Jean-Yves Enjalbert and Hoang Ngoc Minh
|
| 71-94 |
The Lyapunov tortoise and the dyadic hare
Benoît Daireaux and Véronique Maume-Deschamps and Brigitte Vallée
|
| 95-104 |
Analysis of the average depth in a suffix tree under a Markov model
Julien Fayolle and Mark Daniel Ward
|
| 105-114 |
A repertoire for additive functionals of uniformly distributed m -ary search trees
James Allen Fill and Nevin Kapur
|
| 115-124 |
Cache miss analysis of WHT algorithms
Mihai Furis and Paweł Hitczenko and Jeremy Johnson
|
| 125-138 |
Quadratic exact-size and linear approximate-size random generation of planar graphs
Éric Fusy
|
| 139-146 |
And/or tree probabilities of Boolean functions
Danièle Gardy and Alan Woods
|
| 147-156 |
The number of planar graphs and properties of random planar graphs
Omer Giménez and Marc Noy
|
| 157-166 |
Order statistics and estimating cardinalities of massive data sets
Frédéric Giroire
|
| 167-172 |
The profile of unlabeled trees
Bernhard Gittenberger
|
| 173-180 |
Some results for monotonically labelled simply generated trees
Bernhard Gittenberger and Alois Panholzer
|
| 181-192 |
A hooray for Poisson approximation
Rudolf Grübel
|
| 193-200 |
Profiles of random trees: plane-oriented recursive trees
Hsien-Kuei Hwang
|
| 201-222 |
Near optimality of the discrete persistent access caching algorithm
Predrag R. Jelenković and Xiaozhu Kang and Ana Radovanović
|
| 223-230 |
Pattern distribution in various types of random trees
Gerard Kok
|
| 231-256 |
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
Guy Louchard and Helmut Prodinger and Mark Daniel Ward
|
| 257-266 |
Average profiles, from tries to suffix-trees
Pierre Nicodème
|
| 267-274 |
Analysis of biclusters with applications to gene expression data
Gahyun Park and Wojciech Szpankowski
|
| 275-286 |
Classification of large Pólya-Eggenberger urns with regard to their asymptotics
Nicolas Pouyanne
|
| 287-296 |
The master ring problem
Hadas Shachnai and Lisa Zhang
|
| 297-306 |
Distributional analysis of Robin Hood linear probing hashing with buckets
Alfredo Viola
|
| 307-322 |
Analysis of the multiplicity matching parameter in suffix trees
Mark Daniel Ward and Wojciech Szpankowski
|
| 323-334 |
Asymptotics of Riordan arrays
Mark C. Wilson
|
| 335-342 |
Two-anticoloring of planar and related graphs
Daniel Berend and Ephraim Korach and Shira Zucker
|
| 343-352 |
The distribution of ascents of size d or more in samples of geometric random variables
Charlotte Brennan and Arnold Knopfmacher
|
| 353-356 |
Distribution-sensitive set multi-partitioning
Amr Elmasry
|
| 357-364 |
Analysis of tree algorithm for collision resolution
László Györfi and Sándor Győri
|
| 365-370 |
Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks
Philippe Jacquet, Amina Meraihi Naimi, Georgios Rodolakis
|
| 371-382 |
Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
Shuji Kijima and Tomomi Matsui
|
| 383-392 |
Human and constructive proof of combinatorial identities: an example from Romik
D. Merlini and R. Sprugnoli and M. C. Verri
|
| 393-398 |
A tight upper bound on the size of the antidictionary of a binary string
Hiroyoshi Morita and Takahiro Ota
|
| 399-408 |
Application of data compression methods to hypothesis testing for ergodic and stationary processes
Boris Ryabko and Jaakko Astola
|
| 409-416 |
Analytic combinatorics for a certain well-ordered class of iterated exponential terms
Andreas Weiermann
|
