Topics in Data Structures

Rajeev Raman King’s College, London 5.

[1]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[2]  Kurt Mehlhorn,et al.  A Lower Bound on the Complexity of the Union-Split-Find Problem , 1988, SIAM J. Comput..

[3]  Heikki Mannila,et al.  Timestamped Term Representation for Implementing Prolog , 1986, SLP.

[4]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[5]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.

[6]  Jaroslav Nesetril,et al.  Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder , 1997, J. Algorithms.

[7]  Robert E. Tarjan,et al.  Confluently persistent deques via data structuaral bootstrapping , 1993, SODA '93.

[8]  Takao Asano,et al.  Dynamic Segment Intersection Search with Applications , 1984, FOCS.

[9]  Robert HOOD,et al.  Real-Time Queue Operation in Pure LISP , 1980, Inf. Process. Lett..

[10]  Thomas W. Reps,et al.  Incremental Context-Dependent Analysis for Language-Based Editors , 1983, TOPL.

[11]  Robert E. Tarjan,et al.  Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[12]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[13]  Heikki Mannila,et al.  On the Complexity of Unification Sequences , 1986, ICLP.

[14]  Jeffrey D. Ullman,et al.  Set Merging Algorithms , 1973, SIAM J. Comput..

[15]  Han La Poutré.  Lower bounds for the union-find and the split-find problem on pointer machines , 1990, STOC '90.

[16]  Athanasios K. Tsakalidis.  Maintaining order in a generalized linked list , 2004, Acta Informatica.

[17]  Bernard A. Galler,et al.  An algorithm for equivalence declarations , 1961, CACM.

[18]  Rajeev Raman,et al.  Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract) , 1993, WADS.

[19]  Heikki Mannila,et al.  Time Parameter and Arbitrary Deunions in the Set Union Problem , 1988, SWAT.

[20]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[21]  Robert E. Tarjan,et al.  Amortized Analysis of Algorithms for Set Union with Backtracking , 1988, SIAM J. Comput..

[22]  Hassan Aït-Kaci,et al.  LOGIN: A Logic Programming Language with Built-In Inheritance , 1986, J. Log. Program..

[23]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.

[24]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

[25]  Gerth Stølting Brodal,et al.  Optimal purely functional priority queues , 1996, Journal of Functional Programming.

[26]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[27]  D WarrenDavidH,et al.  Prolog - the language and its implementation compared with Lisp , 1977 .

[28]  Robert Todd Hood,et al.  The Efficient Implementation of Very-high-level Programming Language Constructs , 1982 .

[29]  Robert E. Tarjan,et al.  Planar Point Location Using Persistent Search Trees a , 1989 .

[30]  Haim Kaplan,et al.  Purely functional representations of catenable sorted lists , 1996, STOC '96.

[31]  Jaroslav Nesetril,et al.  Linearity and unprovability of set union problem , 1988, STOC '88.

[32]  Michael J. Fischer,et al.  Efficiency of Equivalence Algorithms , 1972, Complexity of Computer Computations.

[33]  Robert E. Tarjan,et al.  A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..

[34]  Donald E. Knuth,et al.  A Programming and Problem-Solving Seminar , 1981 .

[35]  Mark H. Overmars,et al.  A balanced search tree with O(1) worst-case update time , 1988, Acta Informatica.

[36]  Richard Edwin Stearns,et al.  Property Grammars and Table Machines , 1969, Inf. Control..

[37]  Kurt Mehlhorn,et al.  A Lower Bound for the Complexity of the Union-Split-Find Problem , 1987, ICALP.

[38]  Paul F. Dietz.  Fully Persistent Arrays (Extended Array) , 1989, WADS.

[39]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[40]  Bernard Chazelle,et al.  How to Search in History , 1983, Inf. Control..

[41]  Giuseppe F. Italiano,et al.  Fully Persistent Data Structures for Disjoint Set Union Problems , 1991, WADS.

[42]  Jeffrey Scott Vitter,et al.  New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P , 1986, IEEE Transactions on Computers.

[43]  Robert E. Tarjan.  Testing flow graph reducibility , 1973, STOC '73.

[44]  Heikki Mannila,et al.  The Set Union Problem with Backtracking , 1986, ICALP.

[45]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[46]  Giuseppe F. Italiano,et al.  The Set Union Problem With Unlimited Backtracking , 1994, SIAM J. Comput..

[47]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[48]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[49]  Alfred V. Aho,et al.  On finding lowest common ancestors in trees , 1973, SIAM J. Comput..

[50]  R. V. Slyke,et al.  Computing minimum spanning trees efficiently , 1972, ACM Annual Conference.

[51]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[52]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 3 , 2012, EATCS Monographs on Theoretical Computer Science.

[53]  Robin Milner,et al.  Definition of standard ML , 1990 .

[54]  W. Ackermann.  Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .

[55]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.

[56]  Kurt Mehlhorn,et al.  Dynamic fractional cascading , 1990, Algorithmica.

[57]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[58]  Harold N. Gabow,et al.  A scaling algorithm for weighted matching on general graphs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[59]  Gerth Stølting Brodal,et al.  Partially Persistent Data Structures of Bounded Degree with Constant Update Time , 1994, Nord. J. Comput..

[60]  Zvi Galil,et al.  On pointers versus addresses , 1992, JACM.

[61]  Robert E. Tarjan,et al.  Deques with Heap Order , 1986, Inf. Process. Lett..

[62]  Robert E. Tarjan,et al.  Maintaining bridge-connected and biconnected components on-line , 1992, Algorithmica.

[63]  Neil Ivor Sarnak.  Persistent data structures , 1986 .

[64]  Norbert Blum,et al.  On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem , 1986, SIAM J. Comput..

[65]  Michael J. Fischer,et al.  An improved equivalence algorithm , 1964, CACM.

[66]  Christopher John Hogger,et al.  Introduction to logic programming , 1986, A.P.I.C. Studies in data processing.

[67]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[68]  Chris Okasaki,et al.  The role of lazy evaluation in amortized data structures , 1996, ICFP '96.

[69]  R. Karlsson.  Algorithms in a restricted universe , 1985 .

[70]  Rajeev Raman,et al.  Persistence, amortization and randomization , 1991, SODA '91.

[71]  Haim Kaplan,et al.  Persistent lists with catenation via recursive slow-down , 1995, STOC '95.

[72]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[73]  Daniel J. Rosenkrantz,et al.  Table Machine Simulation , 1969, SWAT.

[74]  Chris Okasaki,et al.  Functional Data Structures , 1996, Handbook of Data Structures and Applications.

[75]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[76]  Paul F. Dietz.  Maintaining order in a linked list , 1982, STOC '82.

[77]  Thomas G. Szymanski,et al.  A fast algorithm for computing longest common subsequences , 1977, CACM.

[78]  David H. D. Warren,et al.  Prolog - the language and its implementation compared with Lisp , 1977, Artificial Intelligence and Programming Languages.

[79]  Chris Okasaki,et al.  Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[80]  A. D. Palù,et al.  Universita' Degli Studi Di Verona Facolta' Di Scienze Mm Ff E Nn Tesi Di Laurea New Optimal Algorithms on Pointer Machines , 2004 .

[81]  Giuseppe F. Italiano,et al.  Worst-Case Analysis of the Set-Union Problem with Extended Backtracking , 1989, Theor. Comput. Sci..

[82]  Robert E. Tarjan,et al.  Applications of Path Compression on Balanced Trees , 1979, JACM.

[83]  Robert E. Tarjan,et al.  Fully persistent lists with catenation , 1991, SODA '91.

[84]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[85]  Norbert Blum,et al.  A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals , 1994, Inf. Process. Lett..

[86]  Zvi Galil,et al.  A Note on Set Union with Arbitrary Deunions , 1991, Inf. Process. Lett..

[87]  J. van Leeuwen,et al.  Alternative path compression techniques , 1977 .

[88]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[89]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[90]  Benjamin Goldberg,et al.  Real-time deques, multihead Turing machines, and purely functional programming , 1993, FPCA '93.

[91]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[92]  Takao Asano,et al.  Dynamic Orthogonal Segment Intersection Search , 1987, J. Algorithms.

[93]  A. N. Shiryayev.  On the Notion of Algorithm , 1993 .

[94]  R. Tarjan.  Amortized Computational Complexity , 1985 .

[95]  Hassan Aït-Kaci,et al.  An Algebraic Semantics Approach to the Effective Resolution of Type Equations , 1986, Theor. Comput. Sci..

[96]  David P. Dobkin,et al.  Efficient uses of the past , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[97]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[98]  Zvi Galil,et al.  Data structures and algorithms for disjoint set union problems , 1991, CSUR.