A path integral approach to data structure evolution
- 1 September 1991
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 7 (3) , 232-260
- https://doi.org/10.1016/0885-064x(91)90035-v
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Path integral evaluation of aloha network transientsInformation Processing Letters, 1990
- Path integral methods for computer performance analysisInformation Processing Letters, 1989
- Random walks, Gaussian processes and list structuresTheoretical Computer Science, 1987
- The analysis of simple list structuresInformation Sciences, 1986
- Brownian motion and algorithm complexityBIT Numerical Mathematics, 1986
- Repeated random insertion into a priority queueJournal of Algorithms, 1985
- The brownian motion : a neglected tool for the complexity analysis of sorted tables manipulationRAIRO. Informatique théorique, 1983
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- A trivial algorithm whose analysis isn'tJournal of Computer and System Sciences, 1978
- Analysis of an algorithm for priority queue administrationBIT Numerical Mathematics, 1975