☰

Frank Dehne - Publications

Affiliations: 
Carleton University, Ottawa, Canada 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

43 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Vasconcellos JFdA, Caceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees: International Journal of High Performance Computing Applications. 33: 444-461. DOI: 10.1177/1094342018803672  0.348
2018 Dehne F, Robillard DE, Rau-Chaplin A, Burke N. VOLAP: A Scalable Distributed Real-Time OLAP System for High-Velocity Data Ieee Transactions On Parallel and Distributed Systems. 29: 226-239. DOI: 10.1109/Tpds.2017.2743072  0.335
2015 Dehne F, Zaboli H. Parallel real-time OLAP on multi-core processors International Journal of Data Warehousing and Mining. 11: 23-44. DOI: 10.4018/Ijdwm.2015010102  0.373
2015 Dehne F, Kong Q, Rau-Chaplin A, Zaboli H, Zhou R. Scalable real-time OLAP on cloud architectures Journal of Parallel and Distributed Computing. 79: 31-41. DOI: 10.1016/J.Jpdc.2014.08.006  0.344
2013 Dehne F, Zaboli H. Parallel construction of data cubes on multi-core multi-disk platforms Parallel Processing Letters. 23. DOI: 10.1142/S0129626413500023  0.382
2012 Pitre S, Hooshyar M, Schoenrock A, Samanfar B, Jessulat M, Green JR, Dehne F, Golshani A. Short Co-occurring Polypeptide Regions Can Predict Global Protein Interaction Maps. Scientific Reports. 2: 239. PMID 22355752 DOI: 10.1038/Srep00239  0.302
2012 Dehne F, Omran MT, Sack JR. Shortest paths in time-dependent fifo networks Algorithmica (New York). 62: 416-435. DOI: 10.1007/S00453-010-9461-6  0.339
2010 Dehne F, Hickey G, Rau-Chaplin A, Byrne M. Parallel catastrophe modelling on a Cell/BE International Journal of Parallel, Emergent and Distributed Systems. 25: 401-410. DOI: 10.1080/17445760903492086  0.332
2009 Dehne F, Lawrence M, Rau-Chaplin A. Cooperative caching for grid-enabled OLAP International Journal of Grid and Utility Computing. 1: 169-181. DOI: 10.1504/Ijguc.2009.022032  0.333
2008 Hickey G, Dehne F, Rau-Chaplin A, Blouin C. SPR distance computation for unrooted trees. Evolutionary Bioinformatics Online. 4: 17-27. PMID 19204804 DOI: 10.4137/Ebo.S419  0.376
2008 Pitre S, North C, Alamgir M, Jessulat M, Chan A, Luo X, Green JR, Dumontier M, Dehne F, Golshani A. Global investigation of protein-protein interactions in yeast Saccharomyces cerevisiae using re-occurring short polypeptide sequences. Nucleic Acids Research. 36: 4286-94. PMID 18586826 DOI: 10.1093/Nar/Gkn390  0.327
2008 Pitre S, Alamgir M, Green JR, Dumontier M, Dehne F, Golshani A. Computational methods for predicting protein-protein interactions. Advances in Biochemical Engineering/Biotechnology. 110: 247-67. PMID 18202838 DOI: 10.1007/10_2007_089  0.331
2008 Bhattacharyya B, Dehne F. Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees Information Processing Letters. 108: 293-297. DOI: 10.1016/J.Ipl.2008.05.023  0.383
2008 Chen Y, Dehne F, Eavis T, Rau-Chaplin A. PnP: Sequential, external memory, and parallel iceberg cube computation Distributed and Parallel Databases. 23: 99-126. DOI: 10.1007/S10619-007-7023-Y  0.382
2007 Dehne F, Fellows M, Langston M, Rosamond F, Stevens K. An O(2O(k)n3) FPT algorithm for the undirected Feedback Vertex Set problem Theory of Computing Systems. 41: 479-492. DOI: 10.1007/S00224-007-1345-Z  0.388
2006 Dehne F, Maheshwari A, Taylor R. A coarse grained parallel algorithm for Hausdorff Voronoi diagrams Proceedings of the International Conference On Parallel Processing. 497-504. DOI: 10.1109/ICPP.2006.5  0.325
2006 Dehne F, Eavis T, Rau-Chaplin A. The cgmCUBE project: Optimizing parallel data cube generation for ROLAP Distributed and Parallel Databases. 19: 29-62. DOI: 10.1007/S10619-006-6575-6  0.368
2004 Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3149: 828-831.  0.301
2003 Cheetham J, Dehne F, Rau-Chaplin A, Stege U, Taillon PJ. Solving large FPT problems on coarse-grained parallel machines Journal of Computer and System Sciences. 67: 691-706. DOI: 10.1016/S0022-0000(03)00075-8  0.366
2002 Dehne F, Eavis T, Hambrusch S, Rau-Chaplin A. Parallelizing the data cube Distributed and Parallel Databases. 11: 181-201. DOI: 10.1023/A:1013940219415  0.408
2002 Dehne F, Dittrich W, Hutchinson D, Maheshwari A. Bulk synchronous parallel algorithms for the external memory model Theory of Computing Systems. 35: 567-597. DOI: 10.1007/S00224-002-1066-2  0.314
2002 Dehne F, Ferreira A, Cáceres E, Song SW, Roncato A. Efficient parallel graph algorithms for coarse-grained multicomputers and BSP Algorithmica (New York). 33: 183-200.  0.322
2001 Dehne F, Eavis T, Rau-Chaplin A. Computing partial data cubes for parallel data warehousing applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2131: 319-326.  0.305
1999 Chan A, Dehne F, Rau-Chaplin A. Coarse-Grained Parallel Geometric Search Journal of Parallel and Distributed Computing. 57: 224-235. DOI: 10.1006/Jpdc.1998.1527  0.405
1997 Dehne F, Guimarães K. Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem Information Processing Letters. 64: 107-114. DOI: 10.1016/S0020-0190(97)00168-3  0.419
1997 Dehne F, Deng X, Dymond P, Fabri A, Khokhar AA. A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers Theory of Computing Systems. 30: 547-558. DOI: 10.1007/S002240000067  0.375
1997 Cáceres E, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputer and BSP Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1256: 390-400.  0.327
1996 Dehne F, Fabri A, Rau-Chaplin A. Scalable parallel computational geometry for coarse grained multicomputers International Journal of Computational Geometry and Applications. 6: 379-400. DOI: 10.1142/S0218195996000241  0.306
1996 Dehne F, Song SW. Randomized parallel list ranking for distributed memory multiprocesors Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1179: 1-10. DOI: 10.1007/Bf02700044  0.352
1995 Dehne F, Rau-Chaplin A, Ferreira AG. Hypercube algorithms for parallel processing of pointer-based quadtrees Computer Vision and Image Understanding. 62: 11-26. DOI: 10.1006/Cviu.1995.1038  0.324
1994 Dehne F, Fabri A, Nassar M, Rauchaplin A, Valiveti R. Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor Journal of Parallel and Distributed Computing. 23: 256-261. DOI: 10.1006/Jpdc.1994.1137  0.344
1994 Atallah MJ, Dehne F, Miller R, Rauchaplin A, Tsay JJ. Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers Journal of Parallel and Distributed Computing. 20: 1-13. DOI: 10.1006/Jpdc.1994.1001  0.419
1993 Hambrusch SE, Dehne F. Determining maximum k-width-connectivity on meshes Computational Geometry: Theory and Applications. 3: 91-105. DOI: 10.1016/0925-7721(93)90002-N  0.341
1992 Dehne F, Ferreira A, Rau-Chaplin A. Parallel fractional cascading on hypercube multiprocessors Computational Geometry: Theory and Applications. 2: 141-167. DOI: 10.1016/0925-7721(92)90005-D  0.406
1991 Dehne F, Hambrusch SE. Parallel algorithms for determining k-width connectivity in binary images Journal of Parallel and Distributed Computing. 12: 12-23. DOI: 10.1016/0743-7315(91)90025-5  0.338
1991 Dehne F, Hassenklover AL, Sack JR, Santoro N. Computational geometry algorithms for the systolic screen Algorithmica. 6: 734-761. DOI: 10.1007/Bf01759069  0.398
1990 Dehne F, Ficocelli L. Efficient computational geometry method for detecting dotted lines in noisy images Computer Journal. 33: 424-428. DOI: 10.1093/Comjnl/33.5.424  0.375
1990 Dehne F, Rau-Chaplin A. Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry Atomic Data and Nuclear Data Tables. 8: 367-375. DOI: 10.1016/0743-7315(90)90135-C  0.396
1990 Dehne F. Computing the largest empty rectangle on One- and two-dimensional processor arrays Journal of Parallel and Distributed Computing. 9: 63-68. DOI: 10.1016/0743-7315(90)90112-3  0.35
1990 Dehne F, Pham QT, Stojmenović I. Optimal visibility algorithms for binary images on the hypercube International Journal of Parallel Programming. 19: 213-224. DOI: 10.1007/Bf01407955  0.381
1989 Akl SG, Dehne F. Pipelined search on coarse grained networks International Journal of Parallel Programming. 18: 359-364. DOI: 10.1007/Bf01379185  0.328
1988 Dehne F. Solving visibility and separability problems on a mesh-of-processors The Visual Computer. 3: 356-370. DOI: 10.1007/BF01901193  0.331
1986 Dehne F. O(n 1 2) algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer Information Processing Letters. 22. DOI: 10.1016/0020-0190(86)90070-0  0.417
Show low-probability matches.