Purely functional worst case constant time catenable sorted lists

Authors:
Gerth Stølting Brodal;Christos Makris;Kostas Tsichlas
Affiliations:
Department of Computer Science, University of Aarhus, BRICS, Basic Research in Computer Science, funded by the Danish National Research Foundation;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece
Venue:
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Year:
2006

Citing 14
Cited 0

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Persistence, amortization and randomization

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fully persistent lists with catenation

Journal of the ACM (JACM)
Confluently persistent deques via data-structural bootstrapping

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Purely functional random-access lists

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Persistent lists with catenation via recursive slow-down

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Purely functional data structures

Purely functional data structures
Purely functional, real-time deques with catenation

Journal of the ACM (JACM)
Simple Confluently Persistent Catenable Lists

SIAM Journal on Computing
Partially persistent data structures of bounded degree with constant update time

Nordic Journal of Computing
Fully Persistent Arrays (Extended Array)

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Making data structures confluently persistent

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)

Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a purely functional implementation of search trees that requires O(logn) time for search and update operations and supports the join of two trees in worst case constant time. Hence, we solve an open problem posed by Kaplan and Tarjan as to whether it is possible to envisage a data structure supporting simultaneously the join operation in O(1) time and the search and update operations in O(logn) time.