Random walks, Gaussian processes and list structures

DOI10.1016/0304-3975(87)90028-4zbMath0644.60103OpenAlexW2142997539MaRDI QIDQ1102637

Guy Louchard

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90028-4

zbMATH Keywords

priority queuesGaussian Markovian processeslist implementationlist structure cost functionssuccessful queries and unsuccessful queries

Mathematics Subject Classification ID

Gaussian processes (60G15) Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

Probabilistic analysis of some (un)directed animals ⋮ Colliding stacks: A large deviations analysis ⋮ The Random Connection Model on the Torus ⋮ Weighted Dyck paths and nonstationary queues ⋮ A Probabilistic Analysis of a String Editing Problem and its Variations ⋮ The permutation-path coloring problem on trees. ⋮ Analysis of dynamic algorithms in Knuth's model ⋮ Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence ⋮ A path integral approach to data structure evolution ⋮ Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis ⋮ Dynamic analysis of some relational databases parameters ⋮ Probabilistic analysis of some distributed algorithms ⋮ The shape of stretched planar trees ⋮ Trie size in a dynamic list structure ⋮ Robust variations of interpolation search: An asymptotic analysis

Cites Work

• The Brownian excursion area: A numerical analysis
• The analysis of simple list structures
• Brownian motion and algorithm complexity
• Combinatorial aspects of continued fractions
• The average height of binary trees and other simple trees
• Excursions in Brownian motion
• Kac's formula, levy's local time and brownian excursion
• Register Allocation for Unary–Binary Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random walks, Gaussian processes and list structures