scientific article; zbMATH DE number 1142298

Philippe Flajolet, Jeffrey Scott Vitter

Publication date: 4 May 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

functional equations combinatorial structure

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Bins and balls: Large deviations of the empirical occupancy process, The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees, Algorithms for parallel memory, I: Two-level memories, A calculus for the random generation of labelled combinatorial structures, Reductions in binary search trees, On Ramanujan's \(Q\)-function, On moment sequences and mixed Poisson distributions, Combinatorial structures and structures for classification, A generating function approach to random subgraphs of the \(n\)-cycle, Average case analysis of DJ graphs, On the number of predecessors in constrained random mappings, Analytic methods in asymptotic enumeration, Combinatorics of geometrically distributed random variables: Left-to-right maxima, Generalized Digital Trees and Their Difference—Differential Equations, On the degree distribution of the nodes in increasing trees, Return statistics of simple random walks, Analytical depoissonization and its applications, Generating power of lazy semantics, Generalized Stirling permutations, families of increasing trees and urn models, Comments on the analysis of parameters in a Random Graph Model, Automatic average-case analysis of algorithms, Some comments on a bin-packing problem of W. Knödel., Mellin transforms and asymptotics: Harmonic sums, Random trees in queueing systems with deadlines, Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet, Average search and update costs in skip lists, Average-case analysis of unification algorithms, FCFS-scheduling in a hard real-time environment under rush-hour conditions, Page usage in a quadtree index, How to select a loser, Average-case analysis on simple families of trees using a balanced probability model, On the distribution of distances between specified nodes in increasing trees, Singularity analysis, Hadamard products, and tree recurrences, Reflected Brownian bridge local time conditioned on its local time at the origin, Uniform asymptotics of some Abel sums arising in coding theory, Level of nodes in increasing trees revisited, A combinatorial approach to the analysis of bucket recursive trees, The distribution of nodes of given degree in random trees, Analytic analysis of algorithms, Cuckoo hashing: Further analysis, General urn models with several types of balls and Gaussian limiting fields, Functionally-Generalised MOQA Operations, Reconstruction of Partial Orders and List Representation as Random Structures, Upper tail analysis of bucket sort and random tries, Upper tail analysis of bucket sort and random tries, Average-case analysis of Robinson's unification algorithm with two different variables, The probabilistic analysis of a greedy satisfiability algorithm, Regular expression searching on compressed text, Presorting algorithms: an average-case point of view, Universal Limit Laws for Depths in Random Trees, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis, Real-time properties of indirect recursive procedures, Counting phylogenetic networks, Asymptotic analysis of a class of functional equations and applications, An asymptotic comment on a paper by Analyti and Pramanik