default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Dehne
Frank K. H. A. Dehne
Person information
- affiliation: Carleton University, School of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1986
[b1]Frank Dehne:
Parallel computational geometry and clustering methods. Julius Maximilians University Würzburg, Germany, 1986, pp. 1-150
Journal Articles
- 2019
- [j71]Nashira Grigg, Andrew Schoenrock, Kevin Dick
, James R. Green, Ashkan Golshani, Alex Wong, Frank Dehne, Eve C. Tsai, Kyle K. Biggar:
Insights into the suitability of utilizing brown rats (Rattus norvegicus) as a model for healing spinal cord injury with epidermal growth factor and fibroblast growth factor-II by predicting protein-protein interactions. Comput. Biol. Medicine 104: 220-226 (2019) - [j70]Jucele Franca de Alencar Vasconcellos, Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song, Frank Dehne, Jayme Luiz Szwarcfiter:
New BSP/CGM algorithms for spanning trees. Int. J. High Perform. Comput. Appl. 33(3) (2019) - 2018
- [j69]Frank Dehne, David E. Robillard, Andrew Rau-Chaplin, Neil Burke:
VOLAP: A Scalable Distributed Real-Time OLAP System for High-Velocity Data. IEEE Trans. Parallel Distributed Syst. 29(1): 226-239 (2018) - 2017
- [j68]Tom Kazmirchuk, Kevin Dick, Daniel J. Burnside, Brad Barnes, Houman Moteshareie, Maryam Hajikarimlou, Katayoun Omidi, Duale Ahmed, Andrew Low, Clara Lettl, Mohsen Hooshyar, Andrew Schoenrock, Sylvain Pitre, Mohan Babu, Edana Cassol, Bahram Samanfar, Alex Wong, Frank Dehne, James R. Green, Ashkan Golshani:
Designing anti-Zika virus peptides derived from predicted human-Zika virus protein-protein interactions. Comput. Biol. Chem. 71: 180-187 (2017) - 2015
- [j67]David E. Robillard, Phelelani T. Mpangase, Scott Hazelhurst, Frank Dehne:
SpeeDB: fast structural protein searches. Bioinform. 31(18): 3027-3034 (2015) - [j66]Frank Dehne, Hamidreza Zaboli:
Parallel Real-Time OLAP on Multi-Core Processors. Int. J. Data Warehous. Min. 11(1): 23-44 (2015) - [j65]Frank K. H. A. Dehne, Q. Kong, Andrew Rau-Chaplin, Hamidreza Zaboli, R. Zhou:
Scalable real-time OLAP on cloud architectures. J. Parallel Distributed Comput. 79-80: 31-41 (2015) - 2014
- [j64]Andrew Schoenrock, Bahram Samanfar, Sylvain Pitre, Mohsen Hooshyar, Ke Jin, Charles A. Phillips, Hui Wang, Sadhna Phanse, Katayoun Omidi, Yuan Gui, Md Alamgir, Alex Wong, Fredrik Barrenäs, Mohan Babu, Mikael Benson, Michael A. Langston, James R. Green, Frank K. H. A. Dehne, Ashkan Golshani:
Efficient prediction of human protein-protein interactions at a global scale. BMC Bioinform. 15: 383 (2014) - [j63]Frank Dehne, John Iacono:
Foreword. Comput. Geom. 47(2): 199 (2014) - 2013
- [j62]Oliver Baltzer, Frank Dehne, Andrew Rau-Chaplin:
OLAP for moving object data. Int. J. Intell. Inf. Database Syst. 7(1): 79-112 (2013) - [j61]Frank Dehne, Hamidreza Zaboli:
Parallel Construction of Data Cubes on Multi-Core Multi-Disk Platforms. Parallel Process. Lett. 23(1) (2013) - 2012
- [j60]Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack:
Shortest Paths in Time-Dependent FIFO Networks. Algorithmica 62(1-2): 416-435 (2012) - [j59]Frank Dehne, Hamidreza Zaboli:
Deterministic Sample Sort for GPUs. Parallel Process. Lett. 22(3) (2012) - 2011
- [j58]Adam Amos-Binks, Catalin Patulea, Sylvain Pitre, Andrew Schoenrock, Yuan Gui, James R. Green, Ashkan Golshani, Frank K. H. A. Dehne:
Binding Site Prediction for Protein-Protein Interactions and Novel Motif Discovery using Re-occurring Polypeptide Sequences. BMC Bioinform. 12: 225 (2011) - 2010
- [j57]Frank K. H. A. Dehne, Glenn Hickey, Andrew Rau-Chaplin, Mark Byrne:
Parallel catastrophe modelling on a Cell/BE. Int. J. Parallel Emergent Distributed Syst. 25(5): 401-410 (2010) - 2009
- [j56]Frank Dehne, Michael Lawrence, Andrew Rau-Chaplin:
Cooperative caching for grid-enabled OLAP. Int. J. Grid Util. Comput. 1(2): 169-181 (2009) - 2008
- [j55]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Introduction to Special Issue. Algorithmica 50(2): 173-174 (2008) - [j54]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
PnP: sequential, external memory, and parallel iceberg cube computation. Distributed Parallel Databases 23(2): 99-126 (2008) - [j53]Bishnu Bhattacharyya, Frank K. H. A. Dehne:
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees. Inf. Process. Lett. 108(5): 293-297 (2008) - [j52]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
RCUBE: Parallel Multi-Dimensional ROLAP Indexing. Int. J. Data Warehous. Min. 4(3): 1-14 (2008) - [j51]Albert Chan, Frank K. H. A. Dehne, Prosenjit Bose, Markus Latzel:
Coarse grained parallel algorithms for graph matching. Parallel Comput. 34(1): 47-62 (2008) - 2007
- [j50]Frank K. H. A. Dehne, Todd Eavis, Boyong Liang:
Compressing Data Cube in Parallel OLAP Systems. Data Sci. J. 6: 184-197 (2007) - [j49]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. Theory Comput. Syst. 41(3): 479-492 (2007) - 2006
- [j48]Frank K. H. A. Dehne:
Guest Editor's Introduction. Algorithmica 45(3): 263-267 (2006) - [j47]Sylvain Pitre, Frank K. H. A. Dehne, Albert Chan, James Cheetham, Alex Duong, Andrew Emili, Marinella Gebbia, Jack Greenblatt, Matthew Jessulat, Nevan J. Krogan, Xuemei Luo, Ashkan Golshani:
PIPE: a protein-protein interaction prediction engine based on the re-occurring short polypeptide sequences between known interacting protein pairs. BMC Bioinform. 7: 365 (2006) - [j46]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP. Distributed Parallel Databases 19(1): 29-62 (2006) - [j45]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel. Int. J. Data Warehous. Min. 2(1): 1-26 (2006) - 2005
- [j44]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geom. Appl. 15(5): 463-476 (2005) - [j43]Albert Chan, Frank K. H. A. Dehne, Ryan Taylor:
CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines. Int. J. High Perform. Comput. Appl. 19(1): 81-97 (2005) - 2004
- [j42]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors. Distributed Parallel Databases 15(3): 219-236 (2004) - 2003
- [j41]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. Algorithmica 36(2): 97-122 (2003) - [j40]James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon:
Solving large FPT problems on coarse-grained parallel machines. J. Comput. Syst. Sci. 67(4): 691-706 (2003) - 2002
- [j39]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. Algorithmica 33(2): 183-200 (2002) - [j38]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. Distributed Parallel Databases 11(2): 181-201 (2002) - [j37]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002) - 2001
- [j36]Frank K. H. A. Dehne, Ans A. G. Steuten, Reind P. van de Riet:
WORDNET++: A lexicon for the COLOR-X-method. Data Knowl. Eng. 38(1): 3-29 (2001) - 2000
- [j35]Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias:
Guest Editors' Foreword. Theory Comput. Syst. 33(5/6): 335 (2000) - 1999
- [j34]Frank K. H. A. Dehne:
Guest Editor's Introduction. Algorithmica 24(3-4): 173-176 (1999) - [j33]Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse-Grained Parallel Geometric Search. J. Parallel Distributed Comput. 57(2): 224-235 (1999) - [j32]Albert Chan, Frank K. H. A. Dehne:
A Note on Coarse Grained Parallel Integer Sorting. Parallel Process. Lett. 9(4): 533-538 (1999) - 1997
- [j31]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) - [j30]Frank Dehne, Siang W. Song:
Randomized parallel list ranking for distributed memory multiprocessors. Int. J. Parallel Program. 25(1): 1-16 (1997) - [j29]Frank K. H. A. Dehne, Katia S. Guimarães:
Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. Inf. Process. Lett. 64(3): 107-114 (1997) - [j28]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 Comput. Syst. 30(6): 547-558 (1997) - 1996
- [j27]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable parallel computational geometry for coarse grained multicomputers. Int. J. Comput. Geom. Appl. 6(3): 379-400 (1996) - 1995
- [j26]Frank K. H. A. Dehne, Andrew Rau-Chaplin, Afonso Ferreira:
Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees. Comput. Vis. Image Underst. 62(1): 1-10 (1995) - [j25]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Natana Valiveti, Boris Flach:
Analog Parallel Algorithms for Computational Geometry. Parallel Algorithms Appl. 5(1-2): 1-14 (1995) - 1994
- [j24]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. J. Parallel Distributed Comput. 20(1): 1-13 (1994) - [j23]Frank K. H. A. Dehne, Andreas Fabri, Mostafa Nassar, Andrew Rau-Chaplin, Rada Valiveti:
Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. J. Parallel Distributed Comput. 23(2): 256-262 (1994) - [j22]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. Parallel Comput. 20(9): 1369-1382 (1994) - 1993
- [j21]Susanne E. Hambrusch, Frank K. H. A. Dehne:
Determining Maximum K-width-connectivity on Meshes. Comput. Geom. 3: 91-105 (1993) - 1992
- [j20]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Parallel Fractional Cascading on Hypercube Multiprocessors. Comput. Geom. 2: 141-167 (1992) - 1991
- [j19]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) - [j18]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) - [j17]Frank Dehne, Russ Miller, Andrew Rau-Chaplin:
Optical clustering on a mesh-connected computer. Int. J. Parallel Program. 20(6): 475-486 (1991) - [j16]Frank K. H. A. Dehne, Susanne E. Hambrusch:
Parallel Algorithms for Determining k-Width Connectivity in Binary Images. J. Parallel Distributed Comput. 12(1): 12-23 (1991) - 1990
- [j15]Frank K. H. A. Dehne, L. Ficocelli:
An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images. Comput. J. 33(5): 424-428 (1990) - [j14]Frank Dehne, Quoc T. Pham, Ivan Stojmenovic:
Optimal visibility algorithms for binary images on the hypercube. Int. J. Parallel Program. 19(3): 213-224 (1990) - [j13]Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. J. Parallel Distributed Comput. 8(4): 367-375 (1990) - [j12]Frank K. H. A. Dehne:
Computing the Largest Empty Rectangle on One- and Two-Dimensional Processor Arrays. J. Parallel Distributed Comput. 9(1): 63-68 (1990) - [j11]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. Parallel Comput. 15(1-3): 201-209 (1990) - [j10]Frank K. H. A. Dehne, Michel Gastaldo:
A note on the load balancing problem for coarse grained hypercube dictionary machines. Parallel Comput. 16(1): 75-79 (1990) - 1989
- [j9]Selim G. Akl, Frank Dehne:
Pipelined search on coarse grained networks. Int. J. Parallel Program. 18(5): 359-364 (1989) - [j8]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 Comput. 12(2): 221-231 (1989) - 1988
- [j7]Frank K. H. A. Dehne, Ivan Stojmenovic:
An O(sqrt(n)) Time Algorithm for the ECDF Searching Problem for Arbitrary Dimensions on a Mesh-of-Processors. Inf. Process. Lett. 28(2): 67-70 (1988) - [j6]Frank K. H. A. Dehne:
Solving visibility and separability problems on a Mesh-of-Processors. Vis. Comput. 3(6): 356-370 (1988) - 1987
- [j5]Frank K. H. A. Dehne, Hartmut Noltemeier:
Voronoi trees and clustering problems. Inf. Syst. 12(2): 171-175 (1987) - [j4]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Translation separability of sets of polygons. Vis. Comput. 3(4): 227-235 (1987) - 1986
- [j3]Frank K. H. A. Dehne:
O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer. Inf. Process. Lett. 22(6): 303-306 (1986) - [j2]Frank K. H. A. Dehne, Hartmut Noltemeier:
Clustering methods for geometric objects and applications to design problems. Vis. Comput. 2(1): 31-38 (1986) - [j1]Frank K. H. A. Dehne:
Optical clustering. Vis. Comput. 2(1): 39-43 (1986)
Conference and Workshop Papers
- 2019
- [c91]Mikhail Genkin, Frank Dehne:
Autonomic Workload Change Classification and Prediction for Big Data Workloads. IEEE BigData 2019: 2835-2844 - 2018
- [c90]Mikhail Genkin, Frank Dehne, Pablo Navarro, Siyu Zhou:
Machine-Learning Based Spark and Hadoop Workload Classification Using Container Performance Patterns. Bench 2018: 118-130 - 2017
- [c89]Kevin Dick, Frank Dehne, Ashkan Golshani, James R. Green:
Positome: A method for improving protein-protein interaction quality and prediction accuracy. CIBCB 2017: 1-8 - [c88]Neil Burke, Frank Dehne, Andrew Rau-Chaplin, David E. Robillard:
Quantifying Eventual Consistency For Aggregate Queries. IDEAS 2017: 274-282 - 2016
- [c87]Frank Dehne, David E. Robillard, Andrew Rau-Chaplin, Neil Burke:
VOLAP: A Scalable Distributed System for Real-Time OLAP with High Velocity Data. CLUSTER 2016: 354-363 - [c86]Mikhail Genkin, Frank Dehne, Maria Pospelova, Yabing Chen, Pablo Navarro:
Automatic, On-Line Tuning of YARN Container Memory and CPU Parameters. HPCC/SmartCity/DSS 2016: 317-324 - [c85]David E. Robillard, Frank Dehne, Andrew Rau-Chaplin, Neil Burke:
The Hilbert PDC-tree: A High-Velocity Structure for Many-Dimensional Data. IDEAS 2016: 164-172 - 2015
- [c84]Craig Statchuk, Nazim H. Madhavji, Andriy V. Miranskyy, Frank Dehne:
Taming a Tiger: software engineering in the era of big data & continuous development. CASCON 2015: 303-306 - [c83]Joanna Ng, Frank Dehne, Stan Matwin, Herna L. Viktor, Olga Baysal:
Data science workshop: experience driven analytics. CASCON 2015: 344-346 - [c82]Andrew Schoenrock, Daniel J. Burnside, Houman Moteshareie, Alex Wong, Ashkan Golshani, Frank Dehne:
Engineering inhibitory proteins with InSiPS: the in-silico protein synthesizer. SC 2015: 25:1-25:11 - 2013
- [c81]Frank K. H. A. Dehne, Q. Kong, Andrew Rau-Chaplin, Hamidreza Zaboli, R. Zhou:
A distributed tree data structure for real-time OLAP on cloud architectures. IEEE BigData 2013: 499-505 - 2012
- [c80]Frank Dehne, Hamidreza Zaboli:
Parallel Real-Time OLAP on Multi-core Processors. CCGRID 2012: 588-594 - 2011
- [c79]Frank Dehne, Hamidreza Zaboli:
Parallel data cubes on multi-core processors with multiple disks. CASCON 2011: 99-106 - [c78]Andrew Schoenrock, Frank K. H. A. Dehne, James R. Green, Ashkan Golshani, Sylvain Pitre:
MP-PIPE: a massively parallel protein-protein interaction prediction engine. ICS 2011: 327-337 - [c77]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph F. JáJá, Krishna Kant, Anita La Salle, Richard LeBlanc, Manish Lumsdaine, David A. Padua, Manish Parashar, Viktor K. Prasanna, Yves Robert, Arnold L. Rosenberg, Sartaj Sahni, Behrooz A. Shirazi, Alan Sussman, Charles C. Weems, Jie Wu:
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618 - 2010
- [c76]Frank Dehne, Stephan Jou:
Parallel algorithms for multi-core and many-core processors. CASCON 2010: 391 - 2009
- [c75]Frank K. H. A. Dehne, Glenn Hickey, Andrew Rau-Chaplin, Mark Byrne:
Parallel catastrophe modelling on a cell processor. CASCON 2009: 24-31 - [c74]Frank K. H. A. Dehne, Masoud T. Omran, Jörg-Rüdiger Sack:
Shortest paths in time-dependent FIFO networks using edge load forecasts. GIS-IWCTS 2009: 1-6 - 2008
- [c73]Oliver Baltzer, Frank K. H. A. Dehne, Susanne E. Hambrusch, Andrew Rau-Chaplin:
OLAP for Trajectories. DEXA 2008: 340-347 - [c72]Roozbeh Derakhshan, Bela Stantic, Othmar Korn, Frank K. H. A. Dehne:
Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments. ICA3PP 2008: 121-132 - 2007
- [c71]Frank K. H. A. Dehne, Michael Lawrence:
Cooperative Caching for Grid Based DataWarehouses. CCGRID 2007: 31-38 - [c70]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Efficient computation of view subsets. DOLAP 2007: 65-72 - [c69]Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid. IPDPS 2007: 1-8 - 2006
- [c68]Avinash Shankaranarayanan, Frank K. H. A. Dehne, Andrew Lewis:
A template based static coalition protocol: a3P viGrid. ACSW 2006: 55-62 - [c67]Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar Korn, Bela Stantic:
Simulated Annealing for Materialized View Selection in Data Warehousing Environment. Databases and Applications 2006: 89-94 - [c66]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. ICDE 2006: 164 - [c65]Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor:
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. ICPP 2006: 497-504 - [c64]Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang:
The Cluster Editing Problem: Implementations and Experiments. IWPEC 2006: 13-24 - [c63]Frank K. H. A. Dehne:
FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems. IWPEC 2006: 278 - [c62]Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond:
NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245 - 2005
- [c61]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. CIMCA/IAWTIC 2005: 315-320 - [c60]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. COCOON 2005: 859-869 - [c59]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP 2005: 89-96 - [c58]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
PnP: Parallel And External Memory Iceberg Cubes. ICDE 2005: 576-577 - [c57]Avinash Shankar, Frank K. H. A. Dehne, Ashwin Shankar, Ganesh Subramanian:
Applying Coalition Concepts to Service Oriented Multi-Agent Load Balancing Systems - A3p viLoad. PDPTA 2005: 1283-1289 - 2004
- [c56]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. Euro-Par 2004: 828-831 - [c55]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Top-Down Computation of Partial ROLAP Data Cubes. HICSS 2004 - [c54]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Building Large ROLAP Data Cubes in Parallel. IDEAS 2004: 367-377 - [c53]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. IWPEC 2004: 271-280 - 2003
- [c52]James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon:
A Parallel FPT Application For Clusters. CCGRID 2003: 70-77 - [c51]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel Multi-Dimensional ROLAP Indexing. CCGRID 2003: 86-93 - [c50]Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne, Siang W. Song:
A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison. ICCSA (2) 2003: 249-258 - [c49]James Cheetham, Frank K. H. A. Dehne, Sylvain Pitre, Andrew Rau-Chaplin, Peter J. Taillon:
Parallel CLUSTAL W for PC Clusters. ICCSA (2) 2003: 300-309 - [c48]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. IPDPS 2003: 70 - [c47]Albert Chan, Frank K. H. A. Dehne:
CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters. PVM/MPI 2003: 117-125 - [c46]Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond:
An FPT Algorithm for Set Splitting. WG 2003: 180-191 - 2002
- [c45]Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe:
Distribution Sweeping on Clustered Machines with Hierarchical Memories. IPDPS 2002 - [c44]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: The Convex Case. ISAAC 2002: 624-634 - [c43]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. SPAA 2002: 275-281 - [c42]Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne, Siang W. Song:
A CGM/BSP Parallel Similarity Algorithm. WOB 2002: 1-8 - 2001
- [c41]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
A Cluster Architecture for Parallel Data Warehousing. CCGRID 2001: 161-168 - [c40]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 - [c39]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. ICDT 2001: 129-143 - [c38]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001: 319-326 - 2000
- [c37]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 - [c36]Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Siang W. Song:
Coarse Grained Parallel Graph Planarity Testing. PDPTA 2000 - [c35]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 - 1999
- [c34]Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich:
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999: 14-20 - [c33]Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, Markus Latzel:
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. IPPS/SPDP 1999: 125-129 - [c32]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Parallel Virtual Memory. SODA 1999: 889-890 - 1998
- [c31]Vassil 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 - [c30]Frank K. H. A. Dehne, Silvia Götz:
Practical Parallel Algorithms for Minimum Spanning Trees. SRDS 1998: 366-371 - 1997
- [c29]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 - [c28]Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse Grained Parallel Next Element Search. IPPS 1997: 320- - [c27]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997: 106-115 - 1996
- [c26]Frank K. H. A. Dehne, Siang W. Song:
Randomized Parallel List Ranking for Distributed Memory Multiprocessors. ASIAN 1996: 1-10 - 1995
- [c25]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 - 1994
- [c24]Frank K. H. A. Dehne, Rafael Dueire Lins:
Distributed Cyclic Reference Counting. Canada-France Conference on Parallel and Distributed Computing 1994: 95-100 - [c23]Frank K. H. A. Dehne:
Scalable Parallel Computational Geometry (Summary). Canada-France Conference on Parallel and Distributed Computing 1994: 115-119 - [c22]Frank K. H. A. Dehne, Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. MFCS 1994: 296-305 - [c21]Frank Dehne, Claire Kenyon, Andreas Fabri:
Scalable and architecture independent parallel geometric algorithms with high probability optimal time. SPDP 1994: 586-593 - 1993
- [c20]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. SCG 1993: 298-307 - 1992
- [c19]Susanne E. Hambrusch, Frank K. H. A. Dehne:
Determining Maximum itk-Width Connectivity on Meshes. IPPS 1992: 234-241 - 1991
- [c18]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 - [c17]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991: 255-262 - [c16]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 - 1990
- [c15]Frank K. H. A. Dehne, Michel Gastaldo:
A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines. CONPAR 1990: 417-422 - [c14]Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin:
A massively parallel knowledge-base server using a hypercube multiprocessor. TAI 1990: 660-666 - [c13]Frank K. H. A. Dehne, Susanne E. Hambrusch:
Parallel algorithms for determining k-width- connectivity in binary images. SPDP 1990: 488-496 - 1989
- [c12]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 - [c11]Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin:
Parallel branch and bound on fine-grained hypercube multiprocessors. TAI 1989: 616-622 - [c10]Frank K. H. A. Dehne:
Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. Optimal Algorithms 1989: 14-24 - [c9]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 - 1988
- [c8]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
A survey of paralle computational geometry algorithms. Parcella 1988: 73-88 - [c7]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. SWAT 1988: 154-162 - 1987
- [c6]Frank K. H. A. Dehne, Nicola Santoro:
Optimal VLSI Dictionary Machines on Meshes. ICPP 1987: 832-840 - [c5]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 - [c4]Frank K. H. A. Dehne, Rolf Klein:
A Sweepcircle Algorithm for Voronoi Diagrams. WG 1987: 59-83 - 1986
- [c3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
Seperability of Sets of Polygons. WG 1986: 237-251 - 1985
- [c2]Frank K. H. A. Dehne, Hartmut Noltemeier:
A computational geometry approach to clustering problems. SCG 1985: 245-250 - 1983
- [c1]Frank K. H. A. Dehne:
On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching. ICALP 1983: 160-172
Parts in Books or Collections
- 2010
- [p1]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
RCUBE. Strategic Advancements in Utilizing Data Mining and Warehousing Technologies 2010: 107-120
Editorship
- 2015
- [e17]Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege:
Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science 9214, Springer 2015, ISBN 978-3-319-21839-7 [contents] - 2013
- [e16]Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Lecture Notes in Computer Science 8037, Springer 2013, ISBN 978-3-642-40103-9 [contents] - 2011
- [e15]Frank Dehne, John Iacono, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6844, Springer 2011, ISBN 978-3-642-22299-3 [contents] - 2009
- [e14]Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth:
Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5664, Springer 2009, ISBN 978-3-642-03366-7 [contents] - 2007
- [e13]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh:
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4619, Springer 2007, ISBN 978-3-540-73948-7 [contents] - 2005
- [e12]Mike D. Atkinson, Frank K. H. A. Dehne:
Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005. CRPIT 41, Australian Computer Society 2005, ISBN 1-920682-23-6 [contents] - [e11]Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack:
Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings. Lecture Notes in Computer Science 3608, Springer 2005, ISBN 3-540-28101-0 [contents] - 2004
- [e10]Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne:
Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3162, Springer 2004, ISBN 3-540-23071-8 [contents] - 2003
- [e9]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid:
Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings. Lecture Notes in Computer Science 2748, Springer 2003, ISBN 3-540-40545-3 [contents] - 2001
- [e8]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. Lecture Notes in Computer Science 2125, Springer 2001, ISBN 3-540-42423-7 [contents] - 1999
- [e7]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. Lecture Notes in Computer Science 1663, Springer 1999, ISBN 3-540-66279-0 [contents] - 1997
- [e6]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. Lecture Notes in Computer Science 1272, Springer 1997, ISBN 3-540-63307-3 [contents] - 1995
- [e5]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. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8 [contents] - 1993
- [e4]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. Lecture Notes in Computer Science 709, Springer 1993, ISBN 3-540-57155-8 [contents] - 1991
- [e3]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. Lecture Notes in Computer Science 497, Springer 1991, ISBN 3-540-54029-6 [contents] - [e2]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. Lecture Notes in Computer Science 519, Springer 1991, ISBN 3-540-54343-0 [contents] - 1989
- [e1]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. Lecture Notes in Computer Science 382, Springer 1989, ISBN 3-540-51542-9 [contents]
Informal and Other Publications
- 2023
- [i3]Mikhail Genkin, Frank Dehne, Anousheh Shahmirza, Pablo Navarro, Siyu Zhou:
Autonomic Architecture for Big Data Performance Optimization. CoRR abs/2304.10503 (2023) - 2010
- [i2]Frank Dehne, Hamidreza Zaboli:
Deterministic Sample Sort For GPUs. CoRR abs/1002.4464 (2010) - [i1]Frank Dehne, Kumanan Yogaratnam:
Exploring the Limits of GPUs With Parallel Graph Algorithms. CoRR abs/1002.4482 (2010)
Coauthor Index
[j69] [j65] [j62] [j57] [j56] [j54] [j52] [j46] [j45] [j42] [j40] [j38] [j33] [j27] [j26] [j24] [j23] [j22] [j20] [j17] [j13] [j11] [c88] [c87] [c85] [c81] [c75] [c73] [c70] [c69] [c66] [c59] [c58] [c55] [c54] [c52] [c51] [c49] [c48] [c41] [c40] [c39] [c38] [c31] [c28] [c20] [c18] [c17] [c16] [c14] [c11] [c9] [p1] [e6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
