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. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) (2012)
Précédent
Suivant
DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
A New Binomial Recurrence Arising in a Graphical Compression Algorithm
Choi, Yongwook
;
Knessl, Charles
;
Szpankowski, Wojciech
Approximate Counting via the Poisson-Laplace-Mellin Method
Fuchs, Michael
;
Lee, Chung-Kuei
;
Prodinger, Helmut
On death processes and urn models
Kuba, Markus
;
Panholzer, Alois
Asymptotic behavior of some statistics in Ewens random permutations
Feray, Valentin
Asymptotics of Divide-And-Conquer Recurrences Via Iterated Function Systems
Kieffer, John
Additive tree functionals with small toll functions and subtrees of random trees
Wagner, Stephan
Domination analysis for scheduling on non preemptive uniformly related machines
Eisner, Idan
;
Vainshtein, Alek
Enumeration and Random Generation of Concurrent Computations
Bodini, Olivier
;
Genitrini, Antoine
;
Peschanski, Frédéric
On total variation approximations for random assemblies
Manstavičius, Eugenijus
Some exact asymptotics in the counting of walks in the quarter plane
Fayolle, Guy
;
Raschel, Kilian
Biased Boltzmann samplers and generation of extended linear languages with shuffle
Darrasse, Alexis
;
Panagiotou, Konstantinos
;
Roussel, Olivier
;
Soria, Michele
On the number of transversals in random trees
Gittenberger, Bernhard
;
Kraus, Veronika
Generic properties of random subgroups of a free group for general distributions
Bassino, Frédérique
;
Nicaud, Cyril
;
Weil, Pascal
Matching solid shapes in arbitrary dimension via random sampling
Schymura, Daria
On Bernoulli Sums and Bernstein Polynomials
Cichoń, Jacek
;
Gołębiewski, Zbigniew
Support and density of the limit
$m$
-ary search trees distribution
Chauvin, Brigitte
;
Liu, Quansheng
;
Pouyanne, Nicolas
Adaptive compression against a countable alphabet
Bontemps, Dominique
;
Boucheron, Stephane
;
Gassiat, Elisabeth
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
Morcrette, Basile
;
Mahmoud, Hosam M.
Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness
Bender, Edward
;
Canfield, Rodney
;
Gao, Zhicheng
The weighted words collector
Du Boisberranger, Jérémie
;
Gardy, Danièle
;
Ponty, Yann
A phase transition in the distribution of the length of integer partitions
Ralaivaosaona, Dimbinaina
The Euclid Algorithm is totally gaussian
Vallée, Brigitte
Joint String Complexity for Markov Sources
Jacquet, Philippe
;
Szpankowski, Wojciech
Data Streams as Random Permutations: the Distinct Element Problem
Helmi, Ahmed
;
Lumbroso, Jérémie
;
Martínez, Conrado
;
Viola, Alfredo
Exact
$L^2$
-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
Bindjeme, Patrick
;
fill, james Allen
The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)
Bindjeme, Patrick
;
fill, james Allen
Stokes polyhedra for
$X$
-shaped polyminos
Baryshnikov, Yu.
;
Hickok, L.
;
Orlow, N.
;
Son, S.
Mean field analysis for inhomogeneous bike sharing systems
Fricker, Christine
;
Gast, Nicolas
;
Mohamed, Hanene
On Greedy Trie Execution
Gołębiewski, Zbigniew
;
Zagórski, Filip
On the Number of 2-Protected Nodes in Tries and Suffix Trees
Gaither, Jeffrey
;
Homma, Yushi
;
Sellke, Mark
;
Ward, Mark Daniel
Analysis of Digital Expansions of Minimal Weight
Heigl, Florian
;
Heuberger, Clemens
Mixing times of Markov chains on 3-Orientations of Planar Triangulations
Miracle, Sarah
;
Randall, Dana
;
Streib, Amanda Pascoe
;
Tetali, Prasad
Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study
Lhote, Loïck
;
Lladser, Manuel E.
Infinite Systems of Functional Equations and Gaussian Limiting Distributions
Drmota, Michael
;
Gittenberger, Bernhard
;
Morgenbesser, Johannes F.
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract
Janson, Svante