Data Structures' Maxima

DOI10.1137/S0097539791196603zbMath0896.60060OpenAlexW2029865984MaRDI QIDQ4376160

René Schott, Guy Louchard, Claire M. Kenyon

Publication date: 10 February 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791196603

zbMATH Keywords

data structuresqueueing theoryprobabilistic analysis of algorithmsBrownian bridgesdiffusion techniques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Queueing theory (aspects of probability theory) (60K25) Brownian motion (60J65) Diffusion processes (60J60) Data structures (68P05) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)

Related Items (3)

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence ⋮ Random trees in queueing systems with deadlines ⋮ Distinctness of compositions of an integer: A probabilistic analysis

This page was built for publication: Data Structures' Maxima