Gaston H. Gonnet
Frank W. Tompa
- 1 Aho, A.V., Hopcroft, J.E., and Ullman, J.D. Data Structures and Algorithms. Addison-Wesley, Reading, Mass., 1983. Google Scholar
Digital Library
- 2 Batory, D.S., and Gotlieb. C.C. A unifying model of physical databases. ACM Trans. Database Syst. 7, 4 (Dec. 1982), 509-539. Google ScholarDigital Library
- 3 Bentley, J.B. Decomposable searching problems. Inf. Process. Lett. 8, (June 1979), 244-251.Google ScholarCross Ref
- 4 Claybrook, B.G. A facility for defining and manipulating generalized data structures. ACM Trans. Database Syst. 2, 4 (Dec. 1977), 370-406. Google ScholarDigital Library
- 5 Darlington, J. A synthesis of several sorting algorithms. Acta Inf. 11, 1 (lg78J, 1-30.Google Scholar
- 6 Dungan, D.M. Bibliography on data types. ACM SIGPLAN Notices 14, 11 (Nov. 1979), 31-53.Google Scholar
- 7 Gannet, G.H., and Munro, J.l. A linear probing sort and its analysis. In Proc. SIGACT Syrup. (Milwaukee, Wis., May 11-13, 1981), ACM, New York, pp. 90-95. Google ScholarDigital Library
- 8 Gannet, G.H., and Rogers, L.D. The interpolation-sequential search algorithm. Inf. Process. Lett. 6, 4 (Aug. 1977), 136-139.Google Scholar
- 9 Gannet, G.H., Rogers, L.D., and George, I.A. An algorithmic and complexity analysis of interpolation search. Acta Inf. 13, 1 (Jan. 1980}, 39-46.Google Scholar
- 10 Guttag, J.V., Horowitz, E., and Musser. D.R. The design of data type specifications. In Current Trends in Programming Methodology IV: Data Structuring (R.T. Yeh, Ed.). Prentice-Hall, Englewood Cliffs, N.J. 1978, 60-79.Google Scholar
- 11 Koster, C.H.A. Two-level grammars. In Compiler Construction: An Advanced Course, 2nd ed. (F.L. Bauer and J. Eickel, Eds.) Lecture Notes in Computer Science 21. Springer-Verlag, 1976. pp. 146-156. Google Scholar
- 12 Nievergelt, J. Binary search trees and file organization. Comput. Surv. 6, 3 (Sept. 1974}, 195-207. Google ScholarDigital Library
- 13 Standish, T.A. Data Structure Techniques. Addison-Wesley, Reading, Mass., 1980. Google ScholarDigital Library
- 14 van Wijngaarden. A. Orthogonal design and description of a formal language. Math. Centrum Rapt. MR76, Math Centrum, Amsterdam, 1065.Google Scholar
Index Terms
- A constructive approach to the design of algorithms and their data structures
Recommendations
Data structures for multiversion data warehouse
ADBIS'09: Proceedings of the 13th East European conference on Advances in Databases and Information SystemsIn this paper we present data structures for the Multiversion Data Warehouse (MVDW). The data structures include: (1) BitmapSharing – developed for sharing data between multiple DW versions and (2) a MultiVersion Join Index – developed for supporting ...
Diagrammatic Representation of Data Types and Data Manipulations in a Combined Data- and Control-Flow Language
VL '98: Proceedings of the IEEE Symposium on Visual LanguagesMany visual languages only support data of pre-defined types. For fine-grain general-purpose visual languages based on the data-flow paradigm, there is the need to describe various data structures that will represent the structure of the data that flows ...
Hybrid and custom data structures: evolution of the data structures course
ITiCSE '09The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list, stack, queue, tree, graph), and second, the usage of these basic data ...
Comments