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. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010)
Précédent
Suivant
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Geometric Bucket Trees: Analysis of Linear Bucket Tree
Jacquet, Philippe
;
Muhlethaler, Paul
Renewal theory in analysis of tries and strings: Extended abstract
Janson, Svante
The maximum of Brownian motion with parabolic drift (Extended abstract)
Janson, Svante
;
Louchard, Guy
;
Martin-Löf, Anders
Dynamic Threshold Strategy for Universal Best Choice Problem
Kozik, Jakub
Counting Markov Types
Jacquet, Philippe
;
Knessl, Charles
;
Szpankowski, Wojciech
The analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
Hoppen, Carlos
The Bernoulli sieve: an overview
Gnedin, Alexander
;
Iksanov, Alexander
;
Marynych, Alexander
Phase transitions in Proof Theory
Gordeev, Lev
;
Weiermann, Andreas
Random Generation Using Binomial Approximations
Gouyou-Beauchamps, Dominique
;
Nicaud, Cyril
The degree distribution in unlabelled
$2$
-connected graph families
Kraus, Veronika
A symbolic method to compute the probability distribution of the number of pattern occurences in random texts generated by stochastic 0L-systems
Loi, Cedric
;
Cournède, Paul-Henry
;
Françon, Jean
Almost sure asymptotics for the random binary search tree
Roberts, Matthew
On unary nodes in tries
Wagner, Stephan
Asymptotic Rational Approximation To Pi: Solution of an "Unsolved Problem'' Posed By Herbert Wilf
Ward, Mark Daniel
Ordered increasing
$k$
-trees: Introduction and analysis of a preferential attachment network model
Panholzer, Alois
;
Seitz, Georg
The total Steiner
$k$
-distance for
$b$
-ary recursive trees and linear recursive trees
Munsonius, Götz Olaf
An optimal cardinality estimation algorithm based on order statistics and its full analysis
Lumbroso, Jérémie
Partial Quicksort and Quickpartitionsort
Martínez, Conrado
;
Rösler, Uwe
Square root singularities of infinite systems of functional equations
Morgenbesser, Johannes F.
Random sampling of lattice paths with constraints, via transportation
Gerin, Lucas
No Shannon effect on probability distributions on Boolean functions induced by random expressions
Genitrini, Antoine
;
Gittenberger, Bernhard
Analyzing a Weighted Digital Sum Variant
Cheung, Y. K.
;
Golin, Mordecai
A Note on Invariant Random Variables
Cichoń, Jacek
;
Klonowski, Marek
The number of Euler tours of a random
$d$
-in/
$d$
-out graph
Creed, Páidí
;
Cryan, Mary
The height of scaled attachment random recursive trees
Devroye, Luc
;
Fawzi, Omar
;
Fraiman, Nicolas
Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
Chestnut, Stephen
;
Lladser, Manuel E.
On the diameter of random planar graphs
Chapuy, Guillaume
;
Fusy, Eric
;
Gimenez, Omer
;
Noy, Marc
Stochastic Analysis of the
$k$
-Server Problem on the Circle
Anagnostopoulos, Aris
;
Dombry, Clément
;
Guillotin-Plantard, Nadine
;
Kontoyiannis, Ioannis
;
Upfal, Eli
Bounded discrete walks
Banderier, C.
;
Nicodème, P.
Multi-dimensional Boltzmann Sampling of Languages
Bodini, Olivier
;
Ponty, Yann
Combinatorial aspects of pyramids of one-dimensional pieces of fixed integer length
Durhuus, Bergfinnur
;
Eilers, Søren
Induced acyclic subgraphs in random digraphs: Improved bounds
Dutta, Kunal
;
Subramanian, C. R.
The variance for partial match retrievals in
$k$
-dimensional bucket digital trees
Fuchs, Michael
The distribution of the number of small cuts in a random planar triangulation
Gao, Zhicheng
;
Schaeffer, Gilles
Asymptotics of Decomposable Combinatorial Structures of Alg-Log Type With Positive Log Exponent
Gao, Zhicheng
;
Laferrière, David
;
Panario, Daniel
Digital Trees and Memoryless Sources: from Arithmetics to Analysis
Flajolet, Philippe
;
Roux, Mathieu
;
Vallée, Brigitte
Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort (Extended Abstract)
fill, james Allen
Asymptotics for Walks in a Weyl chamber of Type
$B$
(extended abstract)
Feierl, Thomas
Finding hidden cliques in linear time
Feige, Uriel
;
Ron, Dorit
Stochastic Flips on Dimer Tilings
Fernique, Thomas
;
Regnault, Damien
Cover time of a random graph with given degree sequence
Abdullah, Mohammed
;
Cooper, Colin
;
Frieze, Alan