Hanan Samet Online DBLP entries are available for Hanan Samet and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.) Gisli R. Hjaltason, Hanan Samet: Incremental Distance Join Algorithms for Spatial Databases. SIGMOD Conference 1998: 237-248 Gisli R. Hjaltason, Hanan Samet, Yoram J. Sussmann: Speeding up Bulk-Loading of Quadtrees. ACM-GIS 1997: 50-53 Claudio Esperança, Hanan Samet: Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies. SSD 1997: 197-220 Walid G. Aref, Hanan Samet: Efficient Window Block Retrieval in Quadtree-Based Spatial Databases. GeoInformatica 1(1): 59-91 (1997) Walid G. Aref, Hanan Samet: Cascaded Spatial Join Algorithms with Spatially Sorted Output. ACM-GIS 1996: 17-24 Aya Soffer, Hanan Samet: Retrieval by Content in Symbolic-Image Databases. Storage and Retrieval for Image and Video Databases (SPIE) 1996: 144-155 Michael B. Dillencourt, Hanan Samet: Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. Algorithmica 15(1): 82-102 (1996) Walid G. Aref, Hanan Samet: A Window Retrieval Algorithm for Spatial Databases Using Quadtrees. ACM-GIS 1995: 69- Hanan Samet, Walid G. Aref: Spatial Data Models and Query Processing. Modern Database Systems 1995: 338-360 Hanan Samet: Spatial Data Structures. Modern Database Systems 1995: 361-385 Gisli R. Hjaltason, Hanan Samet: Ranking in Spatial Databases. SSD 1995: 83-95 Erik G. Hoel, Hanan Samet: Benchmarking Spatial Join Operations with Spatial Output. VLDB 1995: 606-618 Hanan Samet: General Research Issues in Multimedia Database Systems. Computing Surveys 27(4): 630-632 (1995) Hanan Samet: Spatial Databases. ADB 1994: 25 Walid G. Aref, Hanan Samet: Hashing by Proximity to Process Duplicates in Spatial Databases. CIKM 1994: 347-354 Erik G. Hoel, Hanan Samet: Performance of Data-Parallel Spatial Operations. VLDB 1994: 156-167 Walid G. Aref, Hanan Samet: Estimating Selectivity Factors of Spatial Operations. FMLDO 1993: 31-43 Walid G. Aref, Hanan Samet: Decomposing a Window into Maximal Quadtree Blocks. Acta Informatica 30(5): 425-439 (1993) Kikuo Fujimura, Hanan Samet: Planning a Time-Minimal Motion Among Moving Obstacles. Algorithmica 10(1): 41-63 (1993) Erik G. Hoel, Hanan Samet: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. SIGMOD Conference 1992: 205-214 Hanan Samet: Spatial Databases. VLDB 1992: 221 Ekow J. Otoo, Ron Lake, Wo-Shun Luk, T. H. Merrett, Hanan Samet: Georgraphic Information Systems, A Challenge for the 90's (Panel). VLDB 1992: 263 Robert E. Webber, Hanan Samet: Linear-Time Border-Tracing Algorithms for Quadtrees. Algorithmica 8(1): 39-54 (1992) Michael B. Dillencourt, Hanan Samet, Markku Tamminen: A General Approach to Connected-Component Labelling for Arbitrary Image Representations. JACM 39(2): 253-280 (1992) Michael B. Dillencourt, Hanan Samet, Markku Tamminen: Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. JACM 39(4): 985-986 (1992) Erik G. Hoel, Hanan Samet: Efficient Processing of Spatial Queries in Line Segment Databases. SSD 1991: 237-256 Walid G. Aref, Hanan Samet: Extending a DBMS with Spatial Operations. SSD 1991: 299-318 Walid G. Aref, Hanan Samet: Optimization for Spatial Query Processing. VLDB 1991: 81-90 Walid G. Aref, Hanan Samet: Efficient Processing of Window Queries in The Pyramid Data Structure. PODS 1990: 265-272 Hanan Samet: Hierarchical Spatial Data Structures. SSD 1989: 193-212 Chuan-Heng Ang, Hanan Samet: Node Distribution in a PR Quadtree. SSD 1989: 233-252 Hanan Samet: Hierarchical Representations of Collections of Small Rectangles. Computing Surveys 20(4): 271-309 (1988) Randal C. Nelson, Hanan Samet: A Population Analysis for Hierarchical Data Structures. SIGMOD Conference 1987: 270-277 Hanan Samet, Clifford A. Shaffer, Robert E. Webber: Digitizing the Plane with Cells of Nonuniform Size. IPL 24(6): 369-375 (1987) Hanan Samet, Robert E. Webber: Storing a Collection of Polygons Using Quadtrees. ACM Transactions on Graphics 4(3): 182-222 (1985) Hanan Samet: Data Structures for Quadtree Approximation and Compression. CACM 28(9): 973-993 (1985) Hanan Samet: Bidirectional Coroutines. Information Processing Letters 21(1): 1-6 (1985) Hanan Samet: The Quadtree and related Hierarchical Data Structures. Computing Surveys 16(2): 187-260 (1984) Hanan Samet: A Quadtree Medial Axis Transform. CACM 26(9): 680-693 (1983) Hanan Samet: Heuristics for the Line Divison Problem in Computer Justified Text. CACM 25(8): 564-571 (1982) Hanan Samet: Code Optimization Considerations in List Processing Systems. TSE 8(2): 107-112 (1982) Hanan Samet: Connected Component Labeling Using Quadtrees. JACM 28(3): 487-501 (1981) Hanan Samet: Experience with Software Conversion. SP&E 11(10): 1053-1069 (1981) Hanan Samet: Deletion in Two-Dimensional Quad Trees. CACM 23(12): 703-710 (1980) Hanan Samet: Region Representation: Quadtrees from Boundary Codes. CACM 23(3): 163-170 (1980) Charles R. Dyer, Azriel Rosenfeld, Hanan Samet: Region Representation: Boundary Codes from Quadtrees. CACM 23(3): 171-179 (1980) Hanan Samet, Leo Marcus: Purging in an Equality Data Base. Information Processing Letters 10(2): 89-95 (1980) Hanan Samet: A Coroutine Approach to Parsing. TOPLAS 2(3): 290-306 (1980) Peter J. Downey, Hanan Samet, Ravi Sethi: Off-Line and On-Line Algorithms for Deducing Equalities. POPL 1978: 158-170 Hanan Samet: Proving the Correctness of Heuristically Optimized Code. CACM 21(7): 570-582 (1978) Hanan Samet: A Canonical Form Algorithm for Proving Equivalence of Conditional Forms. Information Processing Letters 7(2): 103-106 (1978) Hanan Samet: A Machine Description Facility for Compiler Testing. TSE 3(5): 343-351 (1977) DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).