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. AH, 2007 Conference on Analysis of Algorithms (AofA 07) (2007)
Précédent
Suivant
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Sommaire
Expected values of statistics on permutation tableaux
Corteel, Sylvie
;
Hitczenko, Pawel
Limit laws for a class of diminishing urn models.
Kuba, Markus
;
Panholzer, Alois
Minimal and maximal plateau lengths in Motzkin paths
Prodinger, Helmut
;
Wagner, Stephan
Degree distribution of random Apollonian network structures and Boltzmann sampling
Darrasse, Alexis
;
Soria, Michèle
One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling
Christophi, Costas A.
;
Mahmoud, Hosam M.
The average position of the first maximum in a sample of geometric random variables
Archibald, Margaret
;
Knopfmacher, Arnold
Tail Bounds for the Wiener Index of Random Trees
Khan, Tämur Ali
;
Neininger, Ralph
On the Exit Time of a Random Walk with Positive Drift
Drmota, Michael
;
Szpankowski, Wojciech
The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern
Dong, Li
;
Gao, Zhicheng
;
Panario, Daniel
Asynchronous Cellular Automata and Brownian Motion
Chassaing, Philippe
;
Gerin, Lucas
Distributional asymptotics in the analysis of algorithms: Periodicities and discretization
Grübel, Rudolf
Uniqueness of polynomial canonical representations
Lladser, Manuel
Online Bandwidth packing with symmetric distribution
Lelarge, Marc
A new method for computing asymptotics of diagonal coefficients of multivariate generating functions
Raichev, Alexander
;
Wilson, Mark C.
The height of watermelons with wall - Extended Abstract
Feierl, Thomas
Quantum random walks in one dimension via generating functions
Bressler, Andrew
;
Pemantle, Robin
Random permutations and their discrepancy process
Chapuy, Guillaume
Analysis of the total costs for variants of the Union-Find algorithm
Kuba, Markus
;
Panholzer, Alois
The Height of List-tries and TST
Broutin, N.
;
Devroye, L.
Combinatorial Dominance Guarantees for Heuristic Algorithms
Berend, Daniel
;
Skiena, Steven S.
;
Twitto, Yochai
Why almost all satisfiable
$k$
-CNF formulas are easy
Coja-Oghlan, Amin
;
Krivelevich, Michael
;
Vilenchik, Dan
Expected number of locally maximal solutions for random Boolean CSPs
Creignou, Nadia
;
Daudé, Hervé
;
Dubois, Olivier
Randomized Optimization: a Probabilistic Analysis
Cardinal, Jean
;
Langerman, Stefan
;
Louchard, Guy
Optimal Prefix and Suffix Queries on Texts
Crochemore, Maxime
;
Iliopoulos, Costas S.
;
Rahman, M. Sohel
On the Ehrenfeucht-Mycielski Balance Conjecture
Kieffer, John C.
;
Szpankowski, W.
Counting occurrences for a finite set of words: an inclusion-exclusion approach
Bassino, Frédérique
;
Clément, Julien
;
Fayolle, J.
;
Nicodème, P.
A Note on the Approximation of Perpetuities
Knape, Margarete
;
Neininger, Ralph
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
Flajolet, Philippe
;
Fusy, Éric
;
Gandouet, Olivier
;
Meunier, Frédéric
Message passing for the coloring problem: Gallager meets Alon and Kahale
Ben-Shimon, Sonny
;
Vilenchik, Dan
On expected number of maximal points in polytopes
Baryshnikov, Yu.
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract.
Janson, Svante
Lattice reduction in two dimensions: analyses under realistic probabilistic models
Vallée, Brigitte
;
Vera, Antonio
Hamming distance from irreducible polynomials over
$\mathbb {F}_2$
Lee, Gilbert
;
Ruskey, Frank
;
Williams, Aaron
Coherent random permutations with record statistics
Gnedin, Alexander
Properties of Random Graphs via Boltzmann Samplers
Panagiotou, Konstantinos
;
Weißl, Andreas
On Correlation Polynomials and Subword Complexity
Gheorghiciuc, Irina
;
Ward, Mark Daniel