Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete mathematics & theoretical computer science
Tome DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005)
Précédent
Suivant
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Sommaire
The profile of unlabeled trees
Gittenberger, Bernhard
Order statistics and estimating cardinalities of massive data sets
Giroire, Frédéric
The number of planar graphs and properties of random planar graphs
Gimenez, Omer
;
Noy, Marc
And/or tree probabilities of Boolean functions
Gardy, Danièle
;
Woods, Alan
Some results for monotonically labelled simply generated trees
Gittenberger, Bernhard
;
Panholzer, Alois
A hooray for Poisson approximation
Grübel, Rudolf
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
Louchard, Guy
;
Prodinger, Helmut
;
Ward, Mark Daniel
Pattern distribution in various types of random trees
Kok, Gerard
Near optimality of the discrete persistent access caching algorithm
Jelenković, Predrag R.
;
Kang, Xiaozhu
;
Radovanović, Ana
Profiles of random trees: plane-oriented recursive trees
Hwang, Hsien-Kuei
Quadratic exact-size and linear approximate-size random generation of planar graphs
Fusy, Eric
Cache miss analysis of WHT algorithms
Furis, Mihai
;
Hitczenko, Paweł
;
Johnson, Jeremy
Convex hull for intersections of random lines
Berend, Daniel
;
Braverman, Vladimir
Asymptotic analysis of a nonlinear AIMD algorithm
Baryshnikov, Y.
;
Coffman, E.
;
Feng, J.
;
Momčilović, P.
Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle
Balogh, József
;
Pittel, Boris
;
Salazar, Gelasio
Position of the maximum in a sequence with geometric distribution
Archibald, Margaret
Cache efficient simple dynamic programming
Cherng, Cary
;
Ladner, Richard E.
Algorithmic and combinatoric aspects of multiple harmonic sums
Costermans, Christian
;
Enjalbert, Jean-Yves
;
Minh, Hoang Ngoc
A repertoire for additive functionals of uniformly distributed m-ary search trees
fill, james Allen
;
Kapur, Nevin
Analysis of the average depth in a suffix tree under a Markov model
Fayolle, Julien
;
Ward, Mark Daniel
The Lyapunov tortoise and the dyadic hare
Daireaux, Benoît
;
Maume-Deschamps, Véronique
;
Vallée, Brigitte
Distribution of inter-node distances in digital trees
Aguech, Rafik
;
Lasmar, Nabil
;
Mahmoud, Hosam
Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
Kijima, Shuji
;
Matsui, Tomomi
Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks
Jacquet, Philippe
;
Naimi, Amina Meraihi
;
Rodolakis, Georgios
Analysis of tree algorithm for collision resolution
Gyorfi, Laszlo
;
Gyori, Sándor
Human and constructive proof of combinatorial identities: an example from Romik
Merlini, D.
;
Sprugnoli, R.
;
Verri, M. C.
A tight upper bound on the size of the antidictionary of a binary string
Morita, Hiroyoshi
;
Ota, Takahiro
Analytic combinatorics for a certain well-ordered class of iterated exponential terms
Weiermann, Andreas
Application of data compression methods to hypothesis testing for ergodic and stationary processes
Ryabko, Boris
;
Astola, Jaakko
Distribution-sensitive set multi-partitioning
Elmasry, Amr
The distribution of ascents of size
$d$
or more in samples of geometric random variables
Brennan, Charlotte
;
Knopfmacher, Arnold
The master ring problem
Shachnai, Hadas
;
Zhang, Lisa
Classification of large Pólya-Eggenberger urns with regard to their asymptotics
Pouyanne, Nicolas
Analysis of biclusters with applications to gene expression data
Park, Gahyun
;
Szpankowski, Wojciech
Distributional analysis of Robin Hood linear probing hashing with buckets
Viola, Alfredo
Analysis of the multiplicity matching parameter in suffix trees
Ward, Mark Daniel
;
Szpankowski, Wojciech
Two-anticoloring of planar and related graphs
Berend, Daniel
;
Korach, Ephraim
;
Zucker, Shira
Asymptotics of Riordan arrays
Wilson, Mark C.
Average profiles, from tries to suffix-trees
Nicodème, Pierre