The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Frank K. H. A. Dehne: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin
    Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:298-307 [Conf]
  2. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
    Parallel Virtual Memory. [Citation Graph (1, 0)][DBLP]
    SODA, 1999, pp:889-890 [Conf]
  3. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson
    Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. [Citation Graph (1, 0)][DBLP]
    SPAA, 1997, pp:106-115 [Conf]
  4. Avinash Shankaranarayanan, Frank K. H. A. Dehne, Andrew Lewis
    A template based static coalition protocol: a3P viGrid. [Citation Graph (0, 0)][DBLP]
    ACSW Frontiers, 2006, pp:55-62 [Conf]
  5. Frank K. H. A. Dehne, Siang W. Song
    Randomized Parallel List Ranking for Distributed Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1996, pp:1-10 [Conf]
  6. Frank K. H. A. Dehne, Andrew Rau-Chaplin
    Parallel algorithms for color image quantization on hypercubes and meshes. [Citation Graph (0, 0)][DBLP]
    Algorithms and Parallel VLSI Architectures, 1991, pp:91-96 [Conf]
  7. James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
    A Parallel FPT Application For Clusters. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2003, pp:70-77 [Conf]
  8. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    A Cluster Architecture for Parallel Data Warehousing. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2001, pp:161-168 [Conf]
  9. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Parallel Multi-Dimensional ROLAP Indexing. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2003, pp:86-0 [Conf]
  10. Frank K. H. A. Dehne, Michael Lawrence
    Cooperative Caching for Grid Based DataWarehouses. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2007, pp:31-38 [Conf]
  11. Frank K. H. A. Dehne
    Scalable Parallel Computational Geometry (Summary). [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:115-119 [Conf]
  12. Frank K. H. A. Dehne, Rafael Dueire Lins
    Distributed Cyclic Reference Counting. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:95-100 [Conf]
  13. Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
    An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:859-869 [Conf]
  14. Frank K. H. A. Dehne, Michel Gastaldo
    A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1990, pp:417-422 [Conf]
  15. Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar Korn, Bela Stantic
    Simulated Annealing for Materialized View Selection in Data Warehousing Environment. [Citation Graph (0, 0)][DBLP]
    Databases and Applications, 2006, pp:89-94 [Conf]
  16. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Parallel querying of ROLAP cubes in the presence of hierarchies. [Citation Graph (0, 0)][DBLP]
    DOLAP, 2005, pp:89-96 [Conf]
  17. Edson Norberto Cáceres, Frank K. H. A. Dehne, Henrique Mongelli, Siang W. Song, Jayme Luiz Szwarcfiter
    A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:828-831 [Conf]
  18. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Top-Down Computation of Partial ROLAP Data Cubes. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:390-400 [Conf]
  20. Frank K. H. A. Dehne
    On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:160-172 [Conf]
  21. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:589-598 [Conf]
  22. Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne, Siang W. Song
    A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2003, pp:249-258 [Conf]
  23. James Cheetham, Frank K. H. A. Dehne, Sylvain Pitre, Andrew Rau-Chaplin, Peter J. Taillon
    Parallel CLUSTAL W for PC Clusters. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2003, pp:300-309 [Conf]
  24. Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    PnP: Parallel And External Memory Iceberg Cubes. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:576-577 [Conf]
  25. Ying Chen, Andrew Rau-Chaplin, Frank K. H. A. Dehne, Todd Eavis, D. Green, E. Sithirasenan
    cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:164- [Conf]
  26. Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin
    Parallelizing the Data Cube. [Citation Graph (0, 18)][DBLP]
    ICDT, 2001, pp:129-143 [Conf]
  27. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    Efficient Parallel Construction and Manipulation of Quadtrees. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:255-262 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:40-47 [Conf]
  29. Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor
    A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ICPP, 2006, pp:497-504 [Conf]
  30. Frank K. H. A. Dehne, Nicola Santoro
    Optimal VLSI Dictionary Machines on Meshes. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:832-840 [Conf]
  31. Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Building Large ROLAP Data Cubes in Parallel. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2004, pp:367-377 [Conf]
  32. Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, M. Latzel
    Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:125-129 [Conf]
  33. Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin
    Coarse Grained Parallel Next Element Search. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:320-0 [Conf]
  34. Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:70- [Conf]
  35. Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich
    Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:14-20 [Conf]
  36. Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe
    Distribution Sweeping on Clustered Machines with Hierarchical Memories. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  37. Susanne E. Hambrusch, Frank K. H. A. Dehne
    Determining Maximum itk-Width Connectivity on Meshes. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:234-241 [Conf]
  38. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: The Convex Case. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:624-634 [Conf]
  39. Frank K. H. A. Dehne
    FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:278- [Conf]
  40. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
    Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:271-280 [Conf]
  41. Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang
    The Cluster Editing Problem: Implementations and Experiments. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:13-24 [Conf]
  42. Frank K. H. A. Dehne, Rolf Klein
    "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:296-305 [Conf]
  43. Ans A. G. Steuten, Frank K. H. A. Dehne, Reind P. van de Riet
    WordNet++: A Lexicon Supporting the Color-X Method. [Citation Graph (0, 0)][DBLP]
    NLDB, 2000, pp:1-16 [Conf]
  44. Frank K. H. A. Dehne
    Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:14-24 [Conf]
  45. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    A survey of paralle computational geometry algorithms. [Citation Graph (0, 0)][DBLP]
    Parcella, 1988, pp:73-88 [Conf]
  46. Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro
    Computing on a Systolic Screen: Hulls, Contours and Applications. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1987, pp:121-133 [Conf]
  47. Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Siang W. Song
    Coarse Grained Parallel Graph Planarity Testing. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2000, pp:- [Conf]
  48. Avinash Shankar, Frank K. H. A. Dehne, Ashwin Shankar, Ganesh Subramanian
    Applying Coalition Concepts to Service Oriented Multi-Agent Load Balancing Systems - A3p viLoad. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2005, pp:1283-1289 [Conf]
  49. Vassil N. Alexandrov, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Keith Taft
    Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 1998, pp:323-330 [Conf]
  50. Albert Chan, Frank K. H. A. Dehne
    CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2003, pp:117-125 [Conf]
  51. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Computing Partial Data Cubes for Parallel Data Warehousing Applications. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2001, pp:319-326 [Conf]
  52. Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond
    NONBLOCKER: Parameterized Algorithmics for minimum dominating set. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:237-245 [Conf]
  53. Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne
    Parallel dynamic programming for solving the string editing problem on a CGM/BSP. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:275-281 [Conf]
  54. 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). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:204-214 [Conf]
  55. 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. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:27-33 [Conf]
  56. Frank K. H. A. Dehne, Susanne E. Hambrusch
    Parallel algorithms for determining k-width- connectivity in binary images. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:488-496 [Conf]
  57. Frank K. H. A. Dehne, Silvia Götz
    Practical Parallel Algorithms for Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Reliable Distributed Systems, 1998, pp:366-371 [Conf]
  58. Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Ivan Stojmenovic
    A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:154-162 [Conf]
  59. Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe
    Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:83-94 [Conf]
  60. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
    An FPT Algorithm for Set Splitting. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:180-191 [Conf]
  61. Frank K. H. A. Dehne, Rolf Klein
    A Sweepcircle Algorithm for Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    WG, 1987, pp:59-83 [Conf]
  62. Frank K. H. A. Dehne, Andrew Rau-Chaplin
    Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:316-329 [Conf]
  63. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    Seperability of Sets of Polygons. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:237-251 [Conf]
  64. Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne, Siang W. Song
    A CGM/BSP Parallel Similarity Algorithm. [Citation Graph (0, 0)][DBLP]
    WOB, 2002, pp:1-8 [Conf]
  65. Avinash Shankaranarayanan, Frank K. H. A. Dehne, Andrew Lewis
    A Pre-Coalition Protocol for Minimizing Message Passing and State Information Updates in the A3pviGrid System. [Citation Graph (0, 0)][DBLP]
    CIMCA/IAWTIC, 2005, pp:315-320 [Conf]
  66. Frank K. H. A. Dehne
    Editor's Foreword Special Issue on Parallel Algorithms for Geometric Problems on Digitzed Pictures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:5, pp:621-623 [Journal]
  67. Frank K. H. A. Dehne
    Guest Editor's Introduction [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:173-176 [Journal]
  68. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson
    Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:2, pp:97-122 [Journal]
  69. Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato
    Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:183-200 [Journal]
  70. Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, Nicola Santoro
    Computational Geometry Algorithms for the Systolic Screen. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:5, pp:734-761 [Journal]
  71. Frank K. H. A. Dehne, Rolf Klein
    "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:1, pp:19-32 [Journal]
  72. Frank K. H. A. Dehne
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:3, pp:263-267 [Journal]
  73. Frank K. H. A. Dehne, L. Ficocelli
    An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1990, v:33, n:5, pp:424-428 [Journal]
  74. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    Parallel Fractional Cascading on Hypercube Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:141-167 [Journal]
  75. Susanne E. Hambrusch, Frank K. H. A. Dehne
    Determining Maximum K-width-connectivity on Meshes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:91-105 [Journal]
  76. Frank K. H. A. Dehne, Andrew Rau-Chaplin, Afonso Ferreira
    Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1995, v:62, n:1, pp:1-10 [Journal]
  77. Frank K. H. A. Dehne, Ans A. G. Steuten, Reind P. van de Riet
    WORDNET++: A lexicon for the COLOR-X-method. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2001, v:38, n:1, pp:3-29 [Journal]
  78. Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin
    Parallelizing the Data Cube. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2002, v:11, n:2, pp:181-201 [Journal]
  79. Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2004, v:15, n:3, pp:219-236 [Journal]
  80. Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
    The cgmCUBE project: Optimizing parallel data cube generation for ROLAP. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2006, v:19, n:1, pp:29-62 [Journal]
  81. Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin
    Scalable parallel computational geometry for coarse grained multicomputers. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:379-400 [Journal]
  82. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: the Convex Case. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:5, pp:463-476 [Journal]
  83. Frank K. H. A. Dehne
    O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:6, pp:303-306 [Journal]
  84. Frank K. H. A. Dehne, Katia S. Guimarães
    Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:3, pp:107-114 [Journal]
  85. Frank K. H. A. Dehne, Hartmut Noltemeier
    Voronoi trees and clustering problems. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1987, v:12, n:2, pp:171-175 [Journal]
  86. James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
    Solving large FPT problems on coarse-grained parallel machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:691-706 [Journal]
  87. 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. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:1, pp:1-13 [Journal]
  88. Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin
    Coarse-Grained Parallel Geometric Search. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:57, n:2, pp:224-235 [Journal]
  89. Frank K. H. A. Dehne
    Computing the Largest Empty Rectangle on One- and Two-Dimensional Processor Arrays. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:9, n:1, pp:63-68 [Journal]
  90. Frank K. H. A. Dehne, Andreas Fabri, Mostafa Nassar, Andrew Rau-Chaplin, Rada Valiveti
    Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:2, pp:256-262 [Journal]
  91. Frank K. H. A. Dehne, Susanne E. Hambrusch
    Parallel Algorithms for Determining k-Width Connectivity in Binary Images. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:12, n:1, pp:12-23 [Journal]
  92. Frank K. H. A. Dehne, Andrew Rau-Chaplin
    Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:8, n:4, pp:367-375 [Journal]
  93. Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:5/6, pp:335-335 [Journal]
  94. 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. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:6, pp:547-558 [Journal]
  95. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
    Bulk Synchronous Parallel Algorithms for the External Memory Model. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:6, pp:567-597 [Journal]
  96. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:15, n:1-3, pp:201-209 [Journal]
  97. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1994, v:20, n:9, pp:1369-1382 [Journal]
  98. Frank K. H. A. Dehne, Michel Gastaldo
    A note on the load balancing problem for coarse grained hypercube dictionary machines. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:16, n:1, pp:75-79 [Journal]
  99. 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. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:12, n:2, pp:221-231 [Journal]
  100. Albert Chan, Frank K. H. A. Dehne
    A Note on Coarse Grained Parallel Integer Sorting. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:4, pp:533-538 [Journal]
  101. Frank K. H. A. Dehne
    Optical clustering. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1986, v:2, n:1, pp:39-43 [Journal]
  102. Frank K. H. A. Dehne
    Solving visibility and separability problems on a Mesh-of-Processors. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1988, v:3, n:6, pp:356-370 [Journal]
  103. Frank K. H. A. Dehne, Hartmut Noltemeier
    Clustering methods for geometric objects and applications to design problems. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1986, v:2, n:1, pp:31-38 [Journal]
  104. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    Translation separability of sets of polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1987, v:3, n:4, pp:227-235 [Journal]
  105. Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau-Chaplin
    Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-8 [Conf]

  106. A computational geometry approach to clustering problems. [Citation Graph (, )][DBLP]


  107. OLAP for Trajectories. [Citation Graph (, )][DBLP]


  108. Efficient computation of view subsets. [Citation Graph (, )][DBLP]


  109. Shortest paths in time-dependent FIFO networks using edge load forecasts. [Citation Graph (, )][DBLP]


  110. Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments. [Citation Graph (, )][DBLP]


  111. Introduction to Special Issue. [Citation Graph (, )][DBLP]


  112. PIPE: a protein-protein interaction prediction engine based on the re-occurring short polypeptide sequences between known interacting protein pairs. [Citation Graph (, )][DBLP]


  113. Compressing Data Cube in Parallel OLAP Systems. [Citation Graph (, )][DBLP]


  114. PnP: sequential, external memory, and parallel iceberg cube computation. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002