Algorithms and Data Structures
暂无分享,去创建一个
Jörg-Rüdiger Sack | Nicola Santoro | Frank Dehne | F. Dehne | J. V. Leeuwen | Arvind Gupta | Jorg-Rtidiger Sack | Roberto Tamassia | Jorg-Riidiger Sack
[1] John Wilkes,et al. An introduction to disk drive modeling , 1994, Computer.
[2] David B. Lomet,et al. Concurrency and recovery for index trees , 1997, The VLDB Journal.
[3] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[4] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[5] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[6] Sridhar Ramaswamy,et al. Path Caching: A Technique for Optimal External Searching , 1994, PODS 1994.
[7] Klaus H. Hinrichs. The grid file system: implementation and case studies of applications , 1985 .
[8] George S. Lueker,et al. Adding range restriction capability to dynamic data structures , 1985, JACM.
[9] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.
[10] Ibrahim Kamel,et al. Bulk insertion in dynamic r-trees , 1996 .
[11] Edward M. McCreight,et al. Priority Search Trees , 1985, SIAM J. Comput..
[12] Sung Yong Shin,et al. Image metamorphosis using snakes and free-form deformations , 1995, SIGGRAPH.
[13] R. Sibson. A vector identity for the Dirichlet tessellation , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.
[14] D. Atkin. OR scheduling algorithms. , 2000, Anesthesiology.
[15] Tony DeRose,et al. Composing Bézier simplexes , 1988, TOGS.
[16] Roberto Grossi,et al. Efficient Splitting and Merging Algorithms for Order Decomposable Problems , 1999, Inf. Comput..
[17] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[18] Georgios Evangelidis,et al. The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation , 1997, The VLDB Journal.
[19] Daniel P. Miranker,et al. A lower bound theorem for indexing schemes and its application to multidimensional range queries , 1998, PODS '98.
[20] H. Edelsbrunner. A new approach to rectangle intersections part I , 1983 .
[21] Sridhar Ramaswamy,et al. The P-range tree: a new data structure for range searching in secondary memory , 1995, SODA '95.
[22] Pascal Fua,et al. Face Models from Uncalibrated Video Sequences , 1998, CAPTECH.
[23] Luc Van Gool,et al. Reading between the lines—a method for extracting dynamic 3D with texture , 1997, VRST '97.
[24] Bernhard Seeger,et al. A Generic Approach to Bulk Loading Multidimensional Index Structures , 1997, VLDB.
[25] Daniel Thalmann,et al. Simulation of Facial Muscle Actions Based on Rational Free Form Deformations , 1992, Comput. Graph. Forum.
[26] Thomas W. Sederberg,et al. Free-form deformation of solid geometric models , 1986, SIGGRAPH.
[27] Mark H. Overmars. Efficient Data Structures for Range Searching on a Grid , 1988, J. Algorithms.
[28] Ambuj K. Singh,et al. Optimal Dynamic Range Searching in Non-replicating Index Structures , 1999, ICDT.
[29] Diane Greene,et al. An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.
[30] Rakesh M. Verma,et al. An Efficient Multiversion Access STructure , 1997, IEEE Trans. Knowl. Data Eng..
[31] Peter Widmayer,et al. Spatial Data Structures: Concepts and Design Choices , 1996, Algorithmic Foundations of Geographic Information Systems.
[32] Nadia Magnenat-Thalmann,et al. Dirichlet free-form deformations and their application to hand simulation , 1997, Proceedings. Computer Animation '97 (Cat. No.97TB100120).
[33] Philippe Flajolet,et al. On the performance evaluation of extendible hashing and trie searching , 1983, Acta Informatica.
[34] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[35] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.
[36] David Scot Taylor,et al. Tight bounds for 2-dimensional indexing schemes , 1998, PODS '98.
[37] Sridhar Ramaswamy,et al. Indexing for Data Models with Constraints and Classes , 1996, J. Comput. Syst. Sci..
[38] David B. Lomet,et al. The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.
[39] Gerald E. Farin,et al. Surfaces over Dirichlet tessellations , 1990, Comput. Aided Geom. Des..
[40] David Salesin,et al. Synthesizing realistic facial expressions from photographs , 1998, SIGGRAPH.
[41] Richard J. Enbody,et al. Dynamic hashing schemes , 1988, CSUR.
[42] Christos H. Papadimitriou,et al. On the analysis of indexing schemes , 1997, PODS '97.
[43] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[44] Jeffrey Scott Vitter,et al. Efficient Memory Access in Large-Scale Computation , 1991, STACS.
[45] Klaus Küspert. Storage utilization in B*-trees with a generalized overflow technique , 2004, Acta Informatica.
[46] Christos Faloutsos,et al. On packing R-trees , 1993, CIKM '93.
[47] Uzi Vishkin,et al. Efficient approximate and dynamic matching of patterns using a labeling paradigm , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[48] Edward H. Adelson,et al. A multiresolution spline with application to image mosaics , 1983, TOGS.
[49] Hans-Peter Kriegel,et al. The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.
[50] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[51] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[52] Roberto Grossi,et al. Efficient cross-trees for external memory , 1999, External Memory Algorithms.
[53] Christos Faloutsos,et al. Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.
[54] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[55] Garth A. Gibson,et al. Report of the Working Group on Storage I/O for Large-Scale Computing , 1996 .
[56] Arif Merchant,et al. An analytic behavior model for disk drives with readahead caches and request reordering , 1998, SIGMETRICS '98/PERFORMANCE '98.
[57] Jeffrey Scott Vitter,et al. Efficient 3-D range searching in external memory , 1996, STOC '96.
[58] Haim Mendelson,et al. Analysis of Extendible Hashing , 1982, IEEE Transactions on Software Engineering.