Data Structures of Bounded Degree with Constant Update Time (1994)
by
Gerth Stølting Brodal
,
Gerth Stølting Brodal
BibTeX
@MISC{Brodal94datastructures,
author = {Gerth Stølting Brodal and Gerth Stølting Brodal},
title = {Data Structures of Bounded Degree with Constant Update Time},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS
Citations
| 160 | Planar point location using persistent search trees - Sarnak, Tarjan - 1986 |
| 51 | Decidability of systems of set constraints with negative constraints - Aiken, Kozen, et al. - 1995 |
| 23 | Persistence, amortization and randomization - Dietz, Raman - 1991 |
| 17 | Eliminating amortization: on data structures with guaranteed response time - Raman - 1992 |
| 14 | Probabilistic Proof Systems - Goldreich - 1994 |
| 13 | A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, et al. - 1994 |
| 7 | Nisan and Amnon Ta-Shma. Symmetric Logspace is Closed Under Complement - Noam - 1994 |
| 5 | Strong Concatenable Processes: An Approach to the Category of Petri Net Computations - Sassone - 1994 |
| 4 | RS-94-30 Thore Husfeldt. Fully Dynamic Transitive Closure in Plane Dags with one Source and one - Sink - 1994 |
| 4 | Count(q) versus the Pigeon-Hole Principle - Riis - 1994 |
| 3 | Making data structures persistent - Tarjan - 1989 |
