Article

Free access

Persistent lists with catenation via recursive slow-down

Authors:

Haim Kaplan,

Robert E. TarjanAuthors Info & Claims

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Pages 93 - 102

https://doi.org/10.1145/225058.225090

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

J. Allen. Anatomy of LISP McGraw-Hill Com-puter Science Series. McGraw-Hill Book Co., New York, 1978.

Digital Library

Google Scholar

[2]

A. L. Buchsbaum, R. Sundar and R. E. Tar-jan. Data structural bootstrapping, linear path compression, and catenable heap ordered dou-ble ended queues, Proceedings of the 33rd IEEE Symp. on Foundations of Computer Science, 1992, 40-49.

Google Scholar

[3]

A. L. Buchsbaum and R. E. Tarjan. Confluently persistant deques via data structural bootstrap-ping, Proceedings of the,/th Annual A CM-SIAM Symposium on Discrete Algorithms, 1993, 155- 164.

Digital Library

Google Scholar

[4]

F. Warren Burton. An efficient functional imple-ment at ion of FIFO queues. Inform at ion Process-ing Letters 14:(5):205-206, July 1982.

Google Scholar

[5]

B. Chamlle. How to search in history, Informat-ion and Control 77 (1985), 77-99.

Digital Library

Google Scholar

[6]

B. Chazelle and L. J. Guibas. Fractional cascad-ing: I. A. data structure technique. Algorath-mica, 1(2):133-62, 1986.

Crossref

Google Scholar

[7]

Tyng-Ruey Chuang and Benjamin Goldberg. Real-time deques, multihead Turing machines, and purely functional program-ming. In Proceedings of the Conference on Func-tional Programming and Computer Architecture, Copenhagen, pages 289-298, 1993.

Digital Library

Google Scholar

[8]

R. Cole. Searching and storing similar lists, Jour-nal of Algorithms 7 (1986), 202-220.

Digital Library

Google Scholar

[9]

D. P. Dobkin and J. I. Munro. Efficient uses of the past, Journal of Algorithms 6 (1985), 455-465.

Crossref

Google Scholar

[10]

P. F. Dietz. Fully persistent arrays, Proceed-ings of the 1989 Workshop on Algorithms and Data Structures, Ottawa Canada, Lecture Notes in Computer Science 382, Springer-Verlag, 1989, 67-74.

Digital Library

Google Scholar

[11]

J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tar-jan. Making data structures persistent, Journal of Computer and Systems Science 38 (1989), 86- 124.

Digital Library

Google Scholar

[12]

J. Driscoll, D. Sleator, and R. Tarjan. Fully per-sistent lists with catenation. In Proc. 2nd ACM-SIAM SYMP. on Discrete Algorithms, pages 89- 99, 1991. Submitted to J. ACM.

Digital Library

Google Scholar

[13]

M. Felleisen. A calculus for assignments in higher-order languages. Proc. 15ih ACM Symposium on Principles of Programming Languages, 180-190, 1988.

Digital Library

Google Scholar

[14]

M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract continuations: a mathemati-cal semantics for handling full functional jumps. Proc. Conference on Lisp and Functional Pro-gramming, 52-62, 1988.

Digital Library

Google Scholar

[15]

Patrick C. Fisher, Albert R. Meyer, and Arnold L. Rosenberg. Real-time simulation of multihead tape units. Journal of the ACM, 19(4):590-607, October 1972.

Digital Library

Google Scholar

[16]

Hania Gajewska and Robert E. Tarjan. Deques with heap order. Informat~on Processing Letters, 12(4):197-100, April 1986.

Digital Library

Google Scholar

[17]

David Gries. The Science of Programming. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1981.

Digital Library

Google Scholar

[18]

Robert Hood. The eficzent implementation of very-high-level programming language constructs. PhD thesis, Department of Computer Science, Cornell University, 1982.

Digital Library

Google Scholar

[19]

R. Hood and R. Melville, Real-time queue oper-ations in pure LISP, Information Processing Let-ters 13 (1981), 50-54.

Crossref

Google Scholar

[20]

Rob R. Hoogerwood. A Symmetric set of efficient list operations. Journal of Functional Program-ming, 2(4):505-513, October 1992.

Crossref

Google Scholar

[21]

G. F. Johnson and D, Duggan. Stores and partial continuations as first-class objects in a language and its environment. Proc. 15th ACM Symposium on Principles of Programming Languages, 158- 168, 1988.

Digital Library

Google Scholar

[22]

D. E, Knuth. The Art of Computer Programming, volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, second edition, 1973.

Digital Library

Google Scholar

[23]

S. R. Kosaraju. Real-time simulation of con-catenable double-ended queues by double-ended queues. In Proc. llth ACM Symp. on Theory of Computing, pages 346-51, 1979.

Digital Library

Google Scholar

[24]

S. R. Kosaraju. An optimal RAM implementa-tion of catenable min double-ended queues, In Proc. 5th ACM-SIAM Symp. on Discrete Algo-rithms, pages 195-203, 1994.

Digital Library

Google Scholar

[25]

Benton L. Leong and Joel I. Seiferas. New real-time simulations of multihead tape units.,lournai of the ACM, 28(1):166-180, January 1981.

Digital Library

Google Scholar

[26]

Chris Okasaki. Simple and efficient purely func-tional queues and deques. J. Functional Progra-mming, to appear.

Google Scholar

[27]

Chris Okasaki, Private Communication, February 1995.

Google Scholar

[28]

M. H. Overmars, Searching in the past, I. Infor-mation and Computation, in press.

Google Scholar

[29]

M. H, Overmars, '(Searching in the past, II: Gen-eral Transofrms," Technical Report RUU-CS-81- 9, Department of Computer Science, University of Utrecht, Utricht, The Netherlands, 1981.

Google Scholar

[30]

T. Reps, T. Etitelbaum, and A. Demers, Incre-mental context-dependent analysis for language based editors, ACM Transactions on Progra-mming Languages and Systems 5 (1983), 449-477.

Digital Library

Google Scholar

[31]

N. Sarnak. Persistent Data Structures. Ph.D. the-sis, Department of Computer Sciences, New York University, 1986.

Digital Library

Google Scholar

[32]

N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29(7):669-79, 1986.

Digital Library

Google Scholar

[33]

D. Sitaram, M. Felleisen. Control delimiters and their hierarchies. LISP and Symbolic Computa-tion: An International Journal, 3 (1990), 67-99.

Digital Library

Google Scholar

[34]

J. M. Spitzer, K. N. Levitt, and L. Robinson. An example of hierarchical design and proof. Com-munications of the ACM, 21(12):1064-75, 1978.

Digital Library

Google Scholar

[35]

Hans-Jorg Stoss. K-band simulation von k-Kopf- Turing-maschinen. Computzng, 6(3):309- 317, 1970.

Crossref

Google Scholar

[36]

G. F. Swart, "Efficient Algorithms for Comput-ing Geometric Intersections, " Technical Report 85-01-02, Department of Computer Science, Uni-versity of Washington, Seattle, WA, 1985.

Google Scholar

Cited By

View all

Xia LIsrael LKramarz MColtharp NClaessen KWeirich SLi Y(2024)Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy ProgramsProceedings of the ACM on Programming Languages10.1145/36746268:ICFP(30-63)Online publication date: 15-Aug-2024
https://dl.acm.org/doi/10.1145/3674626
Tangwongsan KHirzel MSchneider S(2023)Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and InsertionsProceedings of the VLDB Endowment10.14778/3611479.361152116:11(3227-3239)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611521
Brodal GRysgaard CSchou JSvenning R(2023)Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point LocationAlgorithms and Data Structures10.1007/978-3-031-38906-1_43(644-659)Online publication date: 28-Jul-2023
https://doi.org/10.1007/978-3-031-38906-1_43
Show More Cited By

Index Terms

Persistent lists with catenation via recursive slow-down
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Linked lists
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Design and analysis of algorithms

Recommendations

Fully persistent lists with catenation

This paper considers the problem of representing stacks with catenation so that any stack, old or new, is available for access or update operations. This problem arises in the implementation of list-based and functional programming languages. A solution ...
Simple Confluently Persistent Catenable Lists

We consider the problem of maintaining persistent lists subject to concatenation and to insertions and deletions at both ends. Updates to a persistent data structure are nondestructive---each operation produces a new list incorporating the change, ...
Short lists with short programs from programs of functions and strings

Let {źp} be an optimal Gödel numbering of the family of computable functions (in Schnorr's sense), where p ranges over binary strings. Assume that a list of strings L(p) is computable from p and for all p contains a ź-program for źp whose length is at ...

Comments

Information & Contributors

Information

Published In

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

May 1995

776 pages

ISBN:0897917189

DOI:10.1145/225058

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC95

Sponsor:

SIGACT

STOC95: Symposium on Theory of Computing

May 29 - June 1, 1995

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
766
Total Downloads

Downloads (Last 12 months)118
Downloads (Last 6 weeks)6

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xia LIsrael LKramarz MColtharp NClaessen KWeirich SLi Y(2024)Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy ProgramsProceedings of the ACM on Programming Languages10.1145/36746268:ICFP(30-63)Online publication date: 15-Aug-2024
https://dl.acm.org/doi/10.1145/3674626
Tangwongsan KHirzel MSchneider S(2023)Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and InsertionsProceedings of the VLDB Endowment10.14778/3611479.361152116:11(3227-3239)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611521
Brodal GRysgaard CSchou JSvenning R(2023)Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point LocationAlgorithms and Data Structures10.1007/978-3-031-38906-1_43(644-659)Online publication date: 28-Jul-2023
https://doi.org/10.1007/978-3-031-38906-1_43
Biermann FSestoft PElsman MGrelck CKloeckner APadua DSolomonik E(2017)Quad Ropes: immutable, declarative arrays with parallelizable operationsProceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming10.1145/3091966.3091971(1-8)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3091966.3091971
Osvald LRompf TElsman MGrelck CKloeckner APadua DSolomonik E(2017)Flexible data views: design and implementationProceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming10.1145/3091966.3091970(25-32)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3091966.3091970
Charguéraud AAvigad JChlipala A(2016)Higher-order representation predicates in separation logicProceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs10.1145/2854065.2854068(3-14)Online publication date: 18-Jan-2016
https://dl.acm.org/doi/10.1145/2854065.2854068
Prokopec AOdersky M(2015)Conc-Trees for Functional and Parallel ProgrammingRevised Selected Papers of the 28th International Workshop on Languages and Compilers for Parallel Computing - Volume 951910.1007/978-3-319-29778-1_16(254-268)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-29778-1_16
Acar UCharguéraud ARainey M(2014)Theory and Practice of Chunked SequencesAlgorithms - ESA 201410.1007/978-3-662-44777-2_3(25-36)Online publication date: 2014
https://doi.org/10.1007/978-3-662-44777-2_3
Serwadda APhoha V(2013)Examining a Large Keystroke Biometrics Dataset for Statistical-Attack OpeningsACM Transactions on Information and System Security10.1145/251696016:2(1-30)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1145/2516960
Leonard THall-May MSurridge M(2013)Modelling Access Propagation in Dynamic SystemsACM Transactions on Information and System Security10.1145/2516951.251695216:2(1-31)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1145/2516951.2516952
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fully persistent lists with catenation

Simple Confluently Persistent Catenable Lists

Short lists with short programs from programs of functions and strings

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Fully persistent lists with catenation

Simple Confluently Persistent Catenable Lists

Short lists with short programs from programs of functions and strings

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations