Recent developments in the theory of data structures

Aho, 1975, Efficient string matching: an aid to bibliographic search, Comm. ACM, 18, 333, 10.1145/360825.360855 Aho, 1974, Bounds on the complexity of the maximal common subsequence problem, 104 Aho, 1974 Aho, 1975, Equivalence of programs with structured variables, J. Comput. Syst. Sci., 6, 125, 10.1016/S0022-0000(72)80018-7 Bancilhon, 1976, Data structures: specification and realization Bollman, 1976, On preserving proximity in extendible arrays, SIAM J. Comput., 5, 318, 10.1137/0205026 Brown, 1972, Program schemata and information flow—a study of some aspects of the schemata power of data structures, NTIS Rpt. PB 211375, 175 Brown, 1972, Program schemes with pushdown stores, SIAM J. Comput., 1, 242, 10.1137/0201017 Burstall, 1972, Some techniques for proving correctness of programs which alter data structures, Machine Intelligence, 7, 23 Chandra, 1973, On the properties and applications of program schemas, Stanford AI Lab. Memo AIM-188, 231 Chandra, 1975, On the power of programming features, Computer Languages, 1, 219, 10.1016/0096-0551(75)90032-6 Clark, 1976, An efficient list-moving algorithm using constant workspace, Comm. ACM, 19, 352, 10.1145/360238.360247 Constable, 1972, On classes of program schemata, SIAM J. Comput., 1, 66, 10.1137/0201006 Conway, 1963, Design of a separable transition-diagram compiler, Comm. ACM, 6, 396, 10.1145/366663.366704 Duncan, 1976, Studies in program correctness Dwyer, 1974, Simple algorithms for traversing a tree without an auxiliary stack, Inform. Processing Lett., 2, 143, 10.1016/0020-0190(74)90052-0 Earley, 1971, Toward an understanding of data structures, Comm. ACM, 14, 377, 10.1145/362759.362764 Ehrich, 1974, Theory of direct-access storage functions, Information Processing, 74, 647 Elspas, 1972, An assessment of techniques for proving program correctness, Comput. Survey, 4, 97, 10.1145/356599.356602 Fischer, 1974, String-matching and other products, 113 Fisher, 1975, Copying cyclic list structures in linear time using bounded workspace, Comm. ACM, 18, 251, 10.1145/360762.360764 Fleck, 1971, Toward a theory of data structures, J. Comput. Syst. Sci., 5, 475, 10.1016/S0022-0000(71)80011-9 Fleck, 1977, Formal models for string patterns Fleck, 1973, On the realization of data graphs, 13 Floyd, 1967, Assigning meanings to programs, 19 Furtado, 1972, Algebraic concepts in data structures, 62 Furtado, 1976, Characterizing sets of data structures by the connectivity relation, Int. J. Comput. Inf. Sci., 5, 89, 10.1007/BF00975627 Gimpel, 1973, A theory of discrete patterns and their implementation in SNOBOL4, Comm. ACM, 16, 91, 10.1145/361952.361960 Gimpel, 1975, Nonlinear pattern theory, Acta Informatica, 4, 213, 10.1007/BF00288727 Gimpel, 1976 Good, 1970, Toward a man-machine system for proving program correctness Gotlieb, 1974, Data types and structures, Dept. Comput. Sci., Univ. of Toronto. Tech. Rpt. No. 61 Gotlieb, 1974, Data schemata based on directed graphs, Dept. Comput. Sci., Univ. of Toronto. Tech. Rpt. No. 70 Griswold, 1968 Guha, 1973, A formalization of data structures Guha, 1976, A formalization and analysis of simple list structures Hall, 1973, Equivalence between AND/OR graphs and context-free languages, Comm. ACM, 16, 444, 10.1145/362280.362302 Harrison, 1971, Implementation of the substring test by hashing, Comm. ACM, 14, 777, 10.1145/362919.362934 Heller, 1970, A graph theoretic model of data structures, 4, 36 Hirschberg, 1975, A linear space algorithm for computing maximal common subsequences, Comm. ACM, 18, 341, 10.1145/360825.360861 Hoare, 1969, An axiomatic basis for computer programming, Comm. ACM, 12, 576, 10.1145/363235.363259 Hoare, 1969, An axiomatic basis for computer programming, Comm. ACM, 12, 583, 10.1145/363235.363259 Hoare, 1972, Proof of correctness of data representations, Acta Informatica, 1, 271, 10.1007/BF00289507 Hoare, 1973, Recursive data structures Hoffman, 1974, Axiomatic equivalence of programs with structured variables, 78 Hopcroft, 1969 Hopcroft, 1973, Set merging algorithms, SIAM J. Comput., 2, 294, 10.1137/0202024 Inagaki, 1975, Addressable approximations to nonaddressable data graphs Karp, 1972, Rapid identification of repeated patterns in strings, trees and arrays, 125 King, 1969, A program verifier Korfhage, 1974, On the development of data structures, SIGPLAN Notices, 9, 14, 10.1145/953246.953247 Knuth, 1968, Vol. 1 Knuth, 1974, Fast pattern matching in strings Laventhal, 1975, Verifying programs which operate on data structures, 10, 420 Leinbaugh, 1975, Finite array schemata Levi, 1976, Generalized and/or graphs, Art. Intell., 7, 243, 10.1016/0004-3702(76)90006-0 Lindstrom, 1973, Scanning list structures without stacks or tag bits, Inform. Process. Lett., 2, 47, 10.1016/0020-0190(73)90012-4 Lindstrom, 1973, Algorithms for list structure condensation, 73 Lindstrom, 1974, Copying list structures using bounded workspace, Comm. ACM, 17, 198, 10.1145/360924.360936 Lipton, 1975, The complexity of control structures and data structures, 1186 Liskov, 1975, Specification techniques for data abstractions, IEEE Trans. Software Engng., 5e-1, 7, 10.1109/TSE.1975.6312816 Lomet, 1973, A formalization of transition diagram systems, J. ACM, 20, 235, 10.1145/321752.321756 Luckham, 1976, Automatic program verification V: verification-oriented rules for arrays, records and pointers, 10.21236/ADA027455 Mealy, 1969, Another look at data, 1969, 525 Mealy, 1969, Data structures: theory and representation, Information Processing, 74, 322 McCarthy, 1967, Correctness of a compiler for arithmetic expressions, 19 More, 1973, Axioms and theorems for a theory of arrays, IBM J. Res. Develop., 17, 135, 10.1147/rd.172.0135 More, 1973, Notes on the axioms for a theory of arrays More, 1973, Notes on the development of a theory of arrays More, 1975, A theory of arrays with applications to data bases More, 1975-1976, Type and prototypes in a theory of arrays More, 1976, On the composition of array-theoretic operations Morris, 1972, Recursion schemes with lists, 35 Oppen, 1975, An assertion language for data structures, 160 Oppen, 1975, Proving assertions about programs that manipulate data structures, 107 Pfaltz, 1972, Graph structures, J. ACM, 19, 411, 10.1145/321707.321711 Pfaltz, 1975, Representing graphs by Knuth trees, J. ACM, 22, 361, 10.1145/321892.321898 Reingold, 1972, On the optimality of some set algorithms, J. ACM, 19, 649, 10.1145/321724.321730 Reingold, 1973, A nonrecursive list moving algorithm, Comm. ACM, 16, 305, 10.1145/362041.362200 Rivest, 1974, On hash-coding algorithms for partial-match retrieval, 95 Rosenberg, 1971, Data graphs and addressing schemes, J. Comput. Syst. Sci., 5, 193, 10.1016/S0022-0000(71)80034-X Rosenberg, 1972, Quasi-addressable data graphs, IBM Watson Research Ctr., Rpt. RC3742 Rosenberg, 1972, Symmetries in data graphs, SIAM J. Comput., 1, 40, 10.1137/0201005 Rosenberg, 1972, Addressable data graphs, J. ACM, 19, 309, 10.1145/321694.321703 Rosenberg, 1973, Exploiting addressability in data graphs Rosenberg, 1973, Inherent limitations of extendible array realizations, IBM Watson Research Ctr., Rpt. RC4433 Rosenberg, 1973, On storing extendible arrays of specified shapes, IBM Watson Research Ctr., Rpt. RC4450 Rosenberg, 1973, Suffixes of addressable data graphs, Inform. Contr., 23, 107, 10.1016/S0019-9958(73)90619-0 Rosenberg, 1973, Transitions in extendible arrays, 218 Rosenberg, 1974, An extrinsic characterization of addressable data graphs, Discrete Math., 9, 61, 10.1016/0012-365X(74)90071-5 Rosenberg, 1974, Preserving proximity in arrays, IBM Watson Research Ctr., Rpt. RC-4875 Rosenberg, 1974, Computed access in ragged arrays, 74, 642 Rosenberg, 1974, Allocating storage for extendible arrays, J. ACM, 21, 652, 10.1145/321850.321861 Rosenberg, 1975, On storing arbitrarily many extendible arrays of arbitrary dimensions, Int. J. Comput. Information Sci., 4, 189, 10.1007/BF00976243 Rosenberg, 1975, Managing storage for extendible arrays, SIAM J. Comput., 4, 287, 10.1137/0204024 Rosenberg, 1975, Generalized addressing schemes for data graphs, Math. Syst. Theory, 8, 353, 10.1007/BF01780582 Rosenberg, 1975, Hashing schemes for extendible arrays, 159 Rosenberg, 1975, Storage schemes for boundedly extendible arrays Rosenberg, 1975, What is a multilevel array?, IBM J. Res. Develop., 19, 163, 10.1147/rd.192.0163 Salomaa, 1969 Shneiderman, 1973, Data structures: description, manipulation and evaluation Shneiderman, 1974, Structured data structures, Comm. ACM, 17, 566, 10.1145/355620.361170 Siklossy, 1972, Fast and read-only algorithms for traversing trees, Inf. Process. Lett., 1, 149, 10.1016/0020-0190(72)90048-8 Spitzen, 1975, The verification and synthesis of data structures, Acta Informatica, 4, 127, 10.1007/BF00288745 Standish, 1973, Data structures, an axiomatic approach Stewart, 1974, An algebraic model for string patterns Stewart, 1975, An algebraic model for string patterns, 167 Stockmeyer, 1973, Extendible array realizations with additive traversal, IBM Watson Research Ctr., Rpt. RC4578 Suzuki, 1976, Automatic verification of programs with complex data structures Tarjan, 1975, Efficiency of a good but not linear set union algorithm, J. ACM, 22, 215, 10.1145/321879.321884 Tennet, 1973, Mathematical semantics of SNOBOL4, 95 Thompson, 1968, Regular expression search algorithm, Comm. ACM, 11, 419, 10.1145/363347.363387 Turski, 1970, Data structures and their ordering, IAG J., 3, 141 Turski, 1971, A model for data structures and its applications (Part I), Acta Informatica, 1, 1, 10.1007/BF00264290 Turski, 1971, A model for data structures and its applications (Part II), 1, 282 Valiant, 1975, General context-free recognition in less than cubic time, J. Comput. Syst. Sci., 10, 308, 10.1016/S0022-0000(75)80046-8 Wagner, 1974, The string-to-strong correction problem, J. ACM, 21, 168, 10.1145/321796.321811 Wegbreit, 1972, A space-efficient list structure tracing algorithm, IEEE Trans. Comput., 21, 1009, 10.1109/TC.1972.5009079 Wegner, 1971, Data structure models for programming languages, 6, 1 Weiner, 1973, Linear pattern matching, 1 Woods, 1970, Transition network grammars for natural language analysis, Comm. ACM, 13, 591, 10.1145/355598.362773 Codd, 1970, A relational model for data for large shared data banks, Comm. ACM, 13, 377, 10.1145/362384.362685 Ehrich, 1975, Grundlagen einer theorie der datastruckturen und zugriffssysteme, Acta Informatica, 4, 201, 10.1007/BF00288726 Ehrich, 1975, Grundlagen einer theorie der datastruckturen und zugriffssysteme, Acta Informatica, 4, 299, 10.1007/BF00289613 Hsaio, 1970, A formal system for information retrieval from files, Comm. ACM, 13, 67, 10.1145/362007.362015 Kobayashi, 1971, Introduction to the Information Systems (Part I), Soken Kiyo, 1, 1 Marek, 1976, Information storage and retrieval systems: mathematical foundations, Theoret. Comput. Sci., 1, 331, 10.1016/0304-3975(76)90077-3 Maurer, 1975, Hash table methods, ACM Comput. Survey, 7, 5, 10.1145/356643.356645 Nievergelt, 1974, Binary search trees and file organization, ACM Comput. Survey, 6, 195, 10.1145/356631.356634 Pooch, 1973, A survey of indexing techniques for sparse matrices, ACM Comput. Survey, 5, 190, 10.1145/356616.356618 Price, 1971, Table lookup techniques, ACM Comput. Surv., 3, 49, 10.1145/356586.356587 Severence, 1974, Identifier search mechanisms: a survey and generalized model, ACM Comput. Survey, 6, 175, 10.1145/356631.356633 Shneiderman, 1976, Towards a theory of encoded data structures and data translation, Int. J. Comput. Inf. Sci., 5, 33, 10.1007/BF00991070 Williams, 1971, A survey of data structures for computer graphics systems, ACM Comput. Survey, 3, 1, 10.1145/356583.356584