Data structures with dynamical random transitions

DOI10.1002/rsa.20091zbMath1103.60012OpenAlexW4230811145MaRDI QIDQ5486321

René Schott, Bruno Pinçon, Clément Dombry, Nadine Guillotin-Plantard

Publication date: 6 September 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20091

zbMATH Keywords

large deviation principledynamic random walks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial probability (60C05) Data structures (68P05)

Related Items (3)

Approximation of excessive backlog probabilities of two tandem queues ⋮ Excessive backlog probabilities of two parallel queues ⋮ A weighted random walk model, with application to a genetic algorithm

Cites Work

• Quenched, annealed and functional large deviations for one-dimensional random walk in random environment
• Distributed algorithms with dynamical random transitions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Data structures with dynamical random transitions