| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Frank K. H. A. Dehne 76 Frank K. H. A. Dehne, Stefano Mardegan , Andrea Pietracaprina , Giuseppe Prencipe : Distribution Sweeping on Clustered Machines with Hierarchical Memories. IPDPS 2002 75 Frank K. H. A. Dehne, Rolf Klein , Raimund Seidel : Maximizing a Voronoi Region: The Convex Case. ISAAC 2002 : 624-634 74 C. E. R. Alves , Edson Cáceres , Frank K. H. A. Dehne: Parallel dynamic programming for solving the string editing problem on a CGM/BSP. SPAA 2002 : 275-281 73 Frank K. H. A. Dehne, Afonso Ferreira , Edson Cáceres , S. W. Song , Alessandro Roncato : Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica 33 (2): 183-200 (2002) 72 Frank K. H. A. Dehne, Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin : Parallelizing the Data Cube. Distributed and Parallel Databases 11 (2): 181-201 (2002) 71 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Springer 2001 70 Frank K. H. A. Dehne, Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin : Parallelizing the Data Cube. ICDT 2001 : 129-143 69 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining. International Conference on Computational Science (2) 2001 : 589-598 68 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001 : 319-326 67 Frank K. H. A. Dehne, Ans A. G. Steuten , Reind P. van de Riet : WORDNET++: A lexicon for the COLOR-X-method. DKE 38 (1): 3-29 (2001) 66 Ans A. G. Steuten , Frank K. H. A. Dehne, Reind P. van de Riet : WordNet++: A Lexicon Supporting the Color-X Method. NLDB 2000 : 1-16 65 Edson Cáceres , Albert Chan , Frank K. H. A. Dehne, Giuseppe Prencipe : Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. WG 2000 : 83-94 64 Thomas H. Cormen , Frank K. H. A. Dehne, Pierre Fraigniaud , Yossi Matias : Guest Editors' Foreword. Theory of Computing Systems 33 (5/6): 335-335 (2000) 63 Frank K. H. A. Dehne, Arvind Gupta , Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Springer 1999 62 P. Bose , Albert Chan , Frank K. H. A. Dehne, M. Latzel : Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. IPPS/SPDP 1999 : 125-129 61 Frank K. H. A. Dehne, David Hutchinson , Anil Maheshwari , Wolfgang Dittrich : Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999 : 14-20 60 Frank K. H. A. Dehne, Wolfgang Dittrich , David Hutchinson , Anil Maheshwari : Parallel Virtual Memory. SODA 1999 : 889-890 59 Frank K. H. A. Dehne: Guest Editor's Introduction. Algorithmica 24 (3-4): 173-176 (1999) 58 Albert Chan , Frank K. H. A. Dehne, Andrew Rau-Chaplin : Coarse-Grained Parallel Geometric Search. Journal of Parallel and Distributed Computing 57 (2): 224-235 (1999) 57 Albert Chan , Frank K. H. A. Dehne: A Note on Coarse Grained Parallel Integer Sorting. Parallel Processing Letters 9 (4): 533-538 (1999) 56 Vassil N. Alexandrov , Frank K. H. A. Dehne, Andrew Rau-Chaplin , Keith Taft : Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM. PVM/MPI 1998 : 323-330 55 Frank K. H. A. Dehne, Silvia Götz : Practical Parallel Algorithms for Minimum Spanning Trees. Symposium on Reliable Distributed Systems 1998 : 366-371 54 Frank K. H. A. Dehne, Andrew Rau-Chaplin , Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Springer 1997 53 Edson Cáceres , Frank K. H. A. Dehne, Afonso Ferreira , Paola Flocchini , Ingo Rieping , Alessandro Roncato , Nicola Santoro , Siang W. Song : Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. ICALP 1997 : 390-400 52 Albert Chan , Frank K. H. A. Dehne, Andrew Rau-Chaplin : Coarse Grained Parallel Next Element Search. IPPS 1997 : 320- 51 Frank K. H. A. Dehne, Wolfgang Dittrich , David Hutchinson : Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997 : 106-115 50 Frank K. H. A. Dehne, Rolf Klein : "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. Algorithmica 17 (1): 19-32 (1997) 49 Frank K. H. A. Dehne, Katia S. Guimarães : Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. Information Processing Letters 64 (3): 107-114 (1997) 48 Frank K. H. A. Dehne, Xiaotie Deng , Patrick W. Dymond , Andreas Fabri , Ashfaq A. Khokhar : A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers. Theory of Computing Systems 30 (6): 547-558 (1997) 47 Frank K. H. A. Dehne, Siang W. Song : Randomized Parallel List Ranking for Distributed Memory Multiprocessors. ASIAN 1996 : 1-10 46 Frank K. H. A. Dehne, Andreas Fabri , Andrew Rau-Chaplin : Scalable parallel computational geometry for coarse grained multicomputers. International Journal of Computational Geometry and Applications 6 (3): 379-400 (1996) 45 Selim G. Akl , Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Springer 1995 44 Frank K. H. A. Dehne, Xiaotie Deng , Patrick W. Dymond , Andreas Fabri , Ashfaq A. Khokhar : A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers. SPAA 1995 : 27-33 43 Frank K. H. A. Dehne: Scalable Parallel Computational Geometry (Summary). Canada-France Conference on Parallel and Distributed Computing 1994 : 115-119 42 Frank K. H. A. Dehne, Rafael D. Lins : Distributed Cyclic Reference Counting. Canada-France Conference on Parallel and Distributed Computing 1994 : 95-100 41 Frank K. H. A. Dehne, Rolf Klein : "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. MFCS 1994 : 296-305 40 Mikhail J. Atallah , Frank K. H. A. Dehne, Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay : Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers. Journal of Parallel and Distributed Computing 20 (1): 1-13 (1994) 39 Frank K. H. A. Dehne, Andreas Fabri , Mostafa Nassar , Andrew Rau-Chaplin , Rada Valiveti : Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. Journal of Parallel and Distributed Computing 23 (2): 256-262 (1994) 38 Frank K. H. A. Dehne, Afonso Ferreira , Andrew Rau-Chaplin : A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. Parallel Computing 20 (9): 1369-1382 (1994) 37 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro , Sue Whitesides : Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings. Springer 1993 36 Frank K. H. A. Dehne, Andreas Fabri , Andrew Rau-Chaplin : Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. Symposium on Computational Geometry 1993 : 298-307 35 Susanne E. Hambrusch , Frank K. H. A. Dehne: Determining Maximum K-width-connectivity on Meshes. Computational Geometry 3 : 91-105 (1993) 34 Susanne E. Hambrusch , Frank K. H. A. Dehne: Determining Maximum itk-Width Connectivity on Meshes. IPPS 1992 : 234-241 33 Frank K. H. A. Dehne, Afonso Ferreira , Andrew Rau-Chaplin : Parallel Fractional Cascading on Hypercube Multiprocessors. Computational Geometry 2 : 141-167 (1992) 32 Frank K. H. A. Dehne, Frantisek Fiala , Waldemar W. Koczkodaj : Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings. Springer 1991 31 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings. Springer 1991 30 Frank K. H. A. Dehne, Andrew Rau-Chaplin : Parallel algorithms for color image quantization on hypercubes and meshes. Algorithms and Parallel VLSI Architectures 1991 : 91-96 29 Frank K. H. A. Dehne, Alfonso G. Ferreira , Andrew Rau-Chaplin : Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991 : 255-262 28 Mikhail J. Atallah , Frank K. H. A. Dehne, Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay : Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). SPAA 1991 : 204-214 27 Frank K. H. A. Dehne: Editor's Foreword Special Issue on Parallel Algorithms for Geometric Problems on Digitzed Pictures. Algorithmica 6 (5): 621-623 (1991) 26 Frank K. H. A. Dehne, Anne-Lise Hassenklover , Jörg-Rüdiger Sack , Nicola Santoro : Computational Geometry Algorithms for the Systolic Screen. Algorithmica 6 (5): 734-761 (1991) 25 Frank K. H. A. Dehne, Susanne E. Hambrusch : Parallel Algorithms for Determining k-Width Connectivity in Binary Images. Journal of Parallel and Distributed Computing 12 (1): 12-23 (1991) 24 Frank K. H. A. Dehne, Michel Gastaldo : A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines. CONPAR 1990 : 417-422 23 Frank K. H. A. Dehne, Andrew Rau-Chaplin : Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. Journal of Parallel and Distributed Computing 8 (4): 367-375 (1990) 22 Frank K. H. A. Dehne: Computing the Largest Empty Rectangle on One- and Two-Dimensional Processor Arrays. Journal of Parallel and Distributed Computing 9 (1): 63-68 (1990) 21 Frank K. H. A. Dehne, Alfonso G. Ferreira , Andrew Rau-Chaplin : A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. Parallel Computing 15 (1-3): 201-209 (1990) 20 Frank K. H. A. Dehne, Michel Gastaldo : A note on the load balancing problem for coarse grained hypercube dictionary machines. Parallel Computing 16 (1): 75-79 (1990) 19 Frank K. H. A. Dehne, L. Ficocelli : An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images. The Computer Journal 33 (5): 424-428 (1990) 18 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings. Springer 1989 17 Frank K. H. A. Dehne, Anne-Lise Hassenklover , Jörg-Rüdiger Sack : Computing the Configuration Space for a Robot on a Mesh-of-Processors. ICPP (3) 1989 : 40-47 16 Frank K. H. A. Dehne: Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. Optimal Algorithms 1989 : 14-24 15 Frank K. H. A. Dehne, Andrew Rau-Chaplin : Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. WG 1989 : 316-329 14 Frank K. H. A. Dehne, Anne-Lise Hassenklover , Jörg-Rüdiger Sack : Computing the configuration space for a robot on a mesh-of-processors. Parallel Computing 12 (2): 221-231 (1989) 13 Frank K. H. A. Dehne, Jörg-Rüdiger Sack : A survey of paralle computational geometry algorithms. Parcella 1988 : 73-88 12 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Ivan Stomenovic : A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. SWAT 1988 : 154-162 11 Frank K. H. A. Dehne: Solving visibility and separability problems on a Mesh-of-Processors. The Visual Computer 3 (6): 356-370 (1988) 10 Frank K. H. A. Dehne, Nicola Santoro : Optimal VLSI Dictionary Machines on Meshes. ICPP 1987 : 832-840 9 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Computing on a Systolic Screen: Hulls, Contours and Applications. PARLE (1) 1987 : 121-133 8 Frank K. H. A. Dehne, Rolf Klein : A Sweepcircle Algorithm for Voronoi Diagrams. WG 1987 : 59-83 7 Frank K. H. A. Dehne, Hartmut Noltemeier : Voronoi trees and clustering problems. IS 12 (2): 171-175 (1987) 6 Frank K. H. A. Dehne, Jörg-Rüdiger Sack : Translation separability of sets of polygons. The Visual Computer 3 (4): 227-235 (1987) 5 Frank K. H. A. Dehne, Jörg-Rüdiger Sack : Seperability of Sets of Polygons. WG 1986 : 237-251 4 Frank K. H. A. Dehne: O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer. Information Processing Letters 22 (6): 303-306 (1986) 3 Frank K. H. A. Dehne, Hartmut Noltemeier : Clustering methods for geometric objects and applications to design problems. The Visual Computer 2 (1): 31-38 (1986) 2 Frank K. H. A. Dehne: Optical clustering. The Visual Computer 2 (1): 39-43 (1986) 1 Frank K. H. A. Dehne: On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching. ICALP 1983 : 160-172  DiSC'03 © 2003 Association for Computing Machinery |
