| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Frank K. H. A. Dehne 50 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) 49 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 48 Frank K. H. A. Dehne, Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin : Parallelizing the Data Cube. ICDT 2001 : 129-143 47 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 46 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001 : 319-326 45 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) 44 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 43 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 42 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) 41 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 40 Frank K. H. A. Dehne, Wolfgang Dittrich , David Hutchinson , Anil Maheshwari : Parallel Virtual Memory. SODA 1999 : 889-890 39 Frank K. H. A. Dehne: Guest Editor's Introduction. Algorithmica 24 (3-4): 173-176 (1999) 38 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) 37 Albert Chan , Frank K. H. A. Dehne: A Note on Coarse Grained Parallel Integer Sorting. Parallel Processing Letters 9 (4): 533-538 (1999) 36 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 35 Frank K. H. A. Dehne, Silvia Götz : Practical Parallel Algorithms for Minimum Spanning Trees. Symposium on Reliable Distributed Systems 1998 : 366-371 34 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 33 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 32 Frank K. H. A. Dehne, Wolfgang Dittrich , David Hutchinson : Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997 : 106-115 31 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) 30 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) 29 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) 28 Frank K. H. A. Dehne, Siang W. Song : Randomized Parallel List Ranking for Distributed Memory Multiprocessors. ASIAN 1996 : 1-10 27 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) 26 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 25 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 24 Frank K. H. A. Dehne: Scalable Parallel Computational Geometry (Summary). Canada-France Conference on Parallel and Distributed Computing 1994 : 115-119 23 Frank K. H. A. Dehne, Rafael D. Lins : Distributed Cyclic Reference Counting. Canada-France Conference on Parallel and Distributed Computing 1994 : 95-100 22 Frank K. H. A. Dehne, Rolf Klein : "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. MFCS 1994 : 296-305 21 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) 20 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 19 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 18 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 17 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 16 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 15 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) 14 Frank K. H. A. Dehne, A.-L. Hassenklover , Jörg-Rüdiger Sack , Nicola Santoro : Computational Geometry Algorithms for the Systolic Screen. Algorithmica 6 (5): 734-761 (1991) 13 Frank K. H. A. Dehne, Michel Gastaldo : A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines. CONPAR 1990 : 417-422 12 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) 11 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 10 Frank K. H. A. Dehne: Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. Optimal Algorithms 1989 : 14-24 9 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 8 Frank K. H. A. Dehne, Jörg-Rüdiger Sack : A survey of paralle computational geometry algorithms. Parcella 1988 : 73-88 7 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 6 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 5 Frank K. H. A. Dehne, Rolf Klein : A Sweepcircle Algorithm for Voronoi Diagrams. WG 1987 : 59-83 4 Frank K. H. A. Dehne, Hartmut Noltemeier : Voronoi trees and clustering problems. IS 12 (2): 171-175 (1987) 3 Frank K. H. A. Dehne, Jörg-Rüdiger Sack : Seperability of Sets of Polygons. WG 1986 : 237-251 2 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) 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'02 © 2003 Association for Computing Machinery |
