Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Self-adjusting binary search trees
Journal of the ACM (JACM)
Planar point location using persistent search trees
Communications of the ACM
Searching and sorting similar lists
Journal of Algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Fractional cascading revisited
Journal of Algorithms
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Persistent data structures
Journal of Algorithms
Handbook Of Data Structures And Applications (Chapman & Hall/Crc Computer and Information Science Series.)
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Efficient computation of continuous skeletons
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We survey and highlight some of the developments in data structure research during the time of the first 25 years of the FSTTCS conference series.