Publication:4385514
From MaRDI portal
zbMath0900.68251MaRDI QIDQ4385514
Jeffrey Scott Vitter, Philippe Flajolet
Publication date: 4 May 1998
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
General urn models with several types of balls and Gaussian limiting fields, Comments on the analysis of parameters in a Random Graph Model, Uniform asymptotics of some Abel sums arising in coding theory, Mellin transforms and asymptotics: Harmonic sums, Random trees in queueing systems with deadlines, Average-case analysis of unification algorithms, How to select a loser, Average-case analysis on simple families of trees using a balanced probability model, Analytical depoissonization and its applications, Automatic average-case analysis of algorithms, Some comments on a bin-packing problem of W. Knödel., Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet, Average search and update costs in skip lists, FCFS-scheduling in a hard real-time environment under rush-hour conditions, Page usage in a quadtree index, Asymptotic analysis of a class of functional equations and applications, An asymptotic comment on a paper by Analyti and Pramanik, Algorithms for parallel memory, I: Two-level memories, A calculus for the random generation of labelled combinatorial structures, Combinatorial structures and structures for classification, A generating function approach to random subgraphs of the \(n\)-cycle, On the number of predecessors in constrained random mappings, Generating power of lazy semantics, Presorting algorithms: an average-case point of view, Singularity analysis, Hadamard products, and tree recurrences, Reflected Brownian bridge local time conditioned on its local time at the origin, Regular expression searching on compressed text, Real-time properties of indirect recursive procedures, Bins and balls: Large deviations of the empirical occupancy process, On Ramanujan's \(Q\)-function, Analytic methods in asymptotic enumeration, Combinatorics of geometrically distributed random variables: Left-to-right maxima, Return statistics of simple random walks, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees, Generalized Digital Trees and Their Difference—Differential Equations, Unnamed Item, Universal Limit Laws for Depths in Random Trees
