A path integral approach to data structure evolution

DOI10.1016/0885-064X(91)90035-VzbMath0735.60104WikidataQ62796184 ScholiaQ62796184MaRDI QIDQ1179455

Robert S. Maier

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

path integralsanalysis of dynamic data structuresimplementations of dictionaries

Mathematics Subject Classification ID

Stochastic analysis (60H99) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Limit theorems in probability theory (60F99)

Related Items (2)

Dynamic analysis of some relational databases parameters ⋮ The shape of stretched planar trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
• Path integral evaluation of ALOHA network transients
• The analysis of simple list structures
• Brownian motion and algorithm complexity
• Random walks, Gaussian processes and list structures
• Implicit data structures for fast search and update
• A trivial algorithm whose analysis isn't
• Repeated random insertion into a priority queue
• Sequence of operations analysis for dynamic data structures
• Analysis of an algorithm for priority queue administration
• Rough Limit Theorems on Large Deviations for Markov Stochastic Processes. I
• Rough Limit Theorems on Large Deviations for Markov Stochastic Processes, II
• On the weighted approximation of continuous functions by polynomials on the entire number axis
• Large deviations for processes with independent increments

This page was built for publication: A path integral approach to data structure evolution