default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Rau-Chaplin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[j37]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
- [c67]Neil Burke, Frank Dehne, Andrew Rau-Chaplin, David E. Robillard:
Quantifying Eventual Consistency For Aggregate Queries. IDEAS 2017: 274-282 - 2016
- [j36]Neil Burke, Andrew Rau-Chaplin, Blesson Varghese:
Computing probable maximum loss in catastrophe reinsurance portfolios on multi-core and many-core architectures. Concurr. Comput. Pract. Exp. 28(3): 836-847 (2016) - [j35]Ishan Patel, Andrew Rau-Chaplin, Blesson Varghese:
Accelerating R-based analytics on the cloud. Concurr. Comput. Pract. Exp. 28(4): 977-994 (2016) - [j34]Omar Andrés Carmona Cortes, Andrew Rau-Chaplin:
Enhanced multiobjective population-based incremental learning with applications in risk treaty optimization. Evol. Intell. 9(4): 153-165 (2016) - [c66]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 - [c65]Egidio Carvalho, Omar Andrés Carmona Cortes, João Pedro Costa, Andrew Rau-Chaplin:
A stochastic adaptive genetic algorithm for solving unconstrained multimodal numerical problems. EAIS 2016: 130-137 - [c64]Omar Andrés Carmona Cortes, Andrew Rau-Chaplin:
Enhanced Multiobjective Population-Based Incremental Learning with Applications in Risk Treaty Optimization. EvoApplications (1) 2016: 3-18 - [c63]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
- [j33]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) - [c62]Jie Mei, Xinxin Kou, Zhimin Yao, Andrew Rau-Chaplin, Aminul Islam, Abidalrahman Moh'd, Evangelos E. Milios:
Efficient Computation of Co-occurrence Based Word Relatedness. DocEng 2015: 43-46 - [c61]Xinxin Kou, Jie Mei, Zhimin Yao, Andrew Rau-Chaplin, Aminul Islam, Abidalrahman Moh'd, Evangelos E. Milios:
Efficient Parallelization of the Google Trigram Method for Document Relatedness Computation. ICPP Workshops 2015: 98-104 - [c60]Omar Andrés Carmona Cortes, Mônica Sakuray Pais, Filipo Novo Mor, Andrew Rau-Chaplin, César Augusto Missio Marcon:
Differential Evolution on a GPGPU: The Influence of Parameters on Speedup and the Quality of Solutions. IPDPS Workshops 2015: 299-306 - [c59]Haoxu Wang, Omar Andrés Carmona Cortes, Andrew Rau-Chaplin:
Dynamic optimization of multi-layered reinsurance treaties. SAC 2015: 125-132 - 2014
- [c58]Matthew Coelho, Andrew Rau-Chaplin:
eXsight: An Analytical Framework for Quantifying Financial Loss in the Aftermath of Catastrophic Events. DEXA Workshops 2014: 165-170 - [c57]Omar Andrés Carmona Cortes, Andrew Rau-Chaplin, Duane Wilson, Jürgen Gaiser-Porter:
On PBIL, DE and PSO for Optimization of Reinsurance Contracts. EvoApplications 2014: 227-238 - [c56]Leah Brown, Anirudha Ashok Beria, Omar Andrés Carmona Cortes, Andrew Rau-Chaplin, Duane Wilson, Neil Burke, Jürgen Gaiser-Porter:
Parallel MO-PBIL: Computing pareto optimal frontiers efficiently with applications in reinsurance analytics. HPCS 2014: 766-775 - [c55]Andrew Rau-Chaplin, Zhimin Yao, Norbert Zeh:
Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce. ICCS 2014: 1557-1568 - [c54]Omar Andrés Carmona Cortes, Andrew Rau-Chaplin, Pedro Felipe do Prado:
On VEPSO and VEDE for solving a treaty optimization problem. SMC 2014: 2427-2432 - 2013
- [j32]Oliver Baltzer, Frank Dehne, Andrew Rau-Chaplin:
OLAP for moving object data. Int. J. Intell. Inf. Database Syst. 7(1): 79-112 (2013) - [c53]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 - [c52]Andrew Rau-Chaplin, Blesson Varghese, Duane Wilson, Zhimin Yao, Norbert Zeh:
QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce. IEEE BigData 2013: 703-709 - [c51]Anthony Astoul, Christopher Filliter, Andrew Rau-Chaplin, Kunal Shridhar, Blesson Varghese, Naman Varshney:
Risk Analytics for Estimating and Validating Magnitude of Earthquake Losses. DEXA Workshops 2013: 26-31 - [c50]Zhimin Yao, Blesson Varghese, Andrew Rau-Chaplin:
High performance risk aggregation: addressing the data processing challenge the hadoop mapreduce way. ScienceCloud@HPDC 2013: 53-60 - [c49]Andrew Rau-Chaplin, Blesson Varghese, Zhimin Yao:
A MapReduce Framework for Analysing Portfolios of Catastrophic Risk with Secondary Uncertainty. ICCS 2013: 2317-2326 - [c48]Aman K. Bahl, Oliver Baltzer, Andrew Rau-Chaplin, Blesson Varghese, Aaron Whiteway:
Achieving Speedup in Aggregate Risk Analysis Using Multiple GPUs. ICPP 2013: 909-916 - [c47]Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh:
Building a scalable spatial OLAP system. SAC 2013: 13-15 - [c46]Blesson Varghese, Andrew Rau-Chaplin:
Accounting for secondary uncertainty: efficient computation of portfolio risk measures on multi and many core architectures. WHPCF@SC 2013: 3:1-3:10 - [i8]Anthony Astoul, Christopher Filliter, Eric Mason, Andrew Rau-Chaplin, Kunal Shridhar, Blesson Varghese, Naman Varshney:
Developing and Testing the Automated Post-Event Earthquake Loss Estimation and Visualisation (APE-ELEV) Technique. CoRR abs/1308.1846 (2013) - [i7]Aman Kumar Bahl, Oliver Baltzer, Andrew Rau-Chaplin, Blesson Varghese:
Parallel Simulations for Analysing Portfolios of Catastrophic Event Risk. CoRR abs/1308.2066 (2013) - [i6]Aman K. Bahl, Oliver Baltzer, Andrew Rau-Chaplin, Blesson Varghese, Aaron Whiteway:
Achieving Speedup in Aggregate Risk Analysis using Multiple GPUs. CoRR abs/1308.2572 (2013) - [i5]Ishan Patel, Andrew Rau-Chaplin, Blesson Varghese:
Accelerating R-based Analytics on the Cloud. CoRR abs/1308.2787 (2013) - [i4]Andrew Rau-Chaplin, Blesson Varghese, Duane Wilson, Zhimin Yao, Norbert Zeh:
QuPARA: Query-Driven Large-Scale Portfolio Aggregate Risk Analysis on MapReduce. CoRR abs/1308.3615 (2013) - [i3]Blesson Varghese, Andrew Rau-Chaplin:
Accounting for Secondary Uncertainty: Efficient Computation of Portfolio Risk Measures on Multi and Many Core Architectures. CoRR abs/1310.2274 (2013) - [i2]Blesson Varghese, Andrew Rau-Chaplin:
Data Challenges in High-Performance Risk Analytics. CoRR abs/1311.5685 (2013) - [i1]Zhimin Yao, Blesson Varghese, Andrew Rau-Chaplin:
High Performance Risk Aggregation: Addressing the Data Processing Challenge the Hadoop MapReduce Way. CoRR abs/1311.5686 (2013) - 2012
- [c45]Omar Andrés Carmona Cortes, Andrew Rau-Chaplin, Rafael Fernandes Lopes:
A PSO-based algorithm with local search for multimodal optimization without constraints. CLEI 2012: 1-7 - [c44]Eric Mason, Andrew Rau-Chaplin, Kunal Shridhar, Blesson Varghese, Naman Varshney:
Rapid Post-event Catastrophe Modelling and Visualization. DEXA Workshops 2012: 10-15 - [c43]Ishan Patel, Andrew Rau-Chaplin, Blesson Varghese:
A Platform for Parallel R-based Analytics on Cloud Infrastructure. ICPP Workshops 2012: 188-193 - [c42]Aman Kumar Bahl, Oliver Baltzer, Andrew Rau-Chaplin, Blesson Varghese:
Parallel Simulations for Analysing Portfolios of Catastrophic Event Risk. SC Companion 2012: 1176-1184 - [c41]Blesson Varghese, Andrew Rau-Chaplin:
Data Challenges in High-Performance Risk Analytics. SC Companion 2012: 1312-1313 - 2010
- [j31]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) - [p2]Michael Lawrence, Andrew Rau-Chaplin:
Dynamic View Selection for OLAP. Strategic Advancements in Utilizing Data Mining and Warehousing Technologies 2010: 91-106 - [p1]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
RCUBE. Strategic Advancements in Utilizing Data Mining and Warehousing Technologies 2010: 107-120
2000 – 2009
- 2009
- [j30]Frank Dehne, Michael Lawrence, Andrew Rau-Chaplin:
Cooperative caching for grid-enabled OLAP. Int. J. Grid Util. Comput. 1(2): 169-181 (2009) - [c40]Frank K. H. A. Dehne, Glenn Hickey, Andrew Rau-Chaplin, Mark Byrne:
Parallel catastrophe modelling on a cell processor. CASCON 2009: 24-31 - 2008
- [j29]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) - [j28]Chris H. Hamilton, Andrew Rau-Chaplin:
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths. Inf. Process. Lett. 105(5): 155-163 (2008) - [j27]Michael Lawrence, Andrew Rau-Chaplin:
Dynamic View Selection for OLAP. Int. J. Data Warehous. Min. 4(1): 47-61 (2008) - [j26]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) - [c39]Oliver Baltzer, Frank K. H. A. Dehne, Susanne E. Hambrusch, Andrew Rau-Chaplin:
OLAP for Trajectories. DEXA 2008: 340-347 - 2007
- [j25]Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh:
Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions. J. Digit. Inf. Manag. 5(4): 180-190 (2007) - [c38]Chris H. Hamilton, Andrew Rau-Chaplin:
Compact Hilbert Indices for Multi-Dimensional Data. CISIS 2007: 139-146 - [c37]Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh:
Adaptive Tuple Differential Coding. DEXA 2007: 109-119 - [c36]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Efficient computation of view subsets. DOLAP 2007: 65-72 - [c35]Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh:
Parallel Computation of Skyline Queries. HPCS 2007: 12 - [c34]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
- [j24]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) - [j23]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) - [c33]Michael Lawrence, Andrew Rau-Chaplin:
Dynamic View Selection for OLAP. DaWaK 2006: 33-44 - [c32]Michael Lawrence, Andrew Rau-Chaplin:
The OLAP-Enabled Grid: Model and Query Processing Algorithms. HPCS 2006: 4 - [c31]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 - 2005
- [c30]Christian Blouin, Davin Butt, Glenn Hickey, Andrew Rau-Chaplin:
Fast Parallel Maximum Likelihood-Based Protein Phylogeny. PDCS 2005: 281-287 - [c29]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP 2005: 89-96 - [c28]Albert Chan, Chunmei Gao, Andrew Rau-Chaplin:
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering. HPCC 2005: 856-865 - [c27]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
PnP: Parallel And External Memory Iceberg Cubes. ICDE 2005: 576-577 - [c26]Philip T. Cox, Simon Gauvin, Andrew Rau-Chaplin:
Adding parallelism to visual data flow programs. SOFTVIS 2005: 135-144 - 2004
- [j22]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) - [c25]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Top-Down Computation of Partial ROLAP Data Cubes. HICSS 2004 - [c24]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Building Large ROLAP Data Cubes in Parallel. IDEAS 2004: 367-377 - 2003
- [j21]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) - [c23]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 - [c22]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel Multi-Dimensional ROLAP Indexing. CCGRID 2003: 86-93 - [c21]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 - [c20]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. IPDPS 2003: 70 - 2002
- [j20]Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin:
Parallel computation on interval graphs: algorithms and experiments. Concurr. Comput. Pract. Exp. 14(11): 885-910 (2002) - [j19]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) - 2001
- [j18]Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin:
A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram. Parallel Process. Lett. 11(2/3): 327-340 (2001) - [c19]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
A Cluster Architecture for Parallel Data Warehousing. CCGRID 2001: 161-168 - [c18]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 - [c17]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. ICDT 2001: 129-143 - [c16]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001: 319-326
1990 – 1999
- 1999
- [j17]Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers. Algorithmica 24(3-4): 195-208 (1999) - [j16]Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin, Stéphane Ubéda:
Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers. J. Parallel Distributed Comput. 56(1): 47-70 (1999) - [j15]Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse-Grained Parallel Geometric Search. J. Parallel Distributed Comput. 57(2): 224-235 (1999) - [j14]Laurence Boxer, Russ Miller, Andrew Rau-Chaplin:
Scalable Parallel Algorithms for Geometric Pattern Recognition. J. Parallel Distributed Comput. 58(3): 466-486 (1999) - [c15]Michael G. Lamoureux, Andrew Rau-Chaplin:
Parallel Algorithms for Grounded Range Search and Applications. Euro-Par 1999: 525-532 - 1998
- [j13]Laurence Boxer, Russ Miller, Andrew Rau-Chaplin:
Scaleable Parallel Algorithms for Lower Envelopes with Applications. J. Parallel Distributed Comput. 53(2): 91-118 (1998) - [c14]Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin:
Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments. Euro-Par 1998: 875-886 - [c13]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 - [c12]Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin:
Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram. STACS 1998: 399-409 - 1997
- [j12]Andrew Rau-Chaplin, Brian MacKay-Lyons, Timmy Doucette, Jedrzej Gajewski, Xiangqun Hu, Peter F. Spierenburg:
Graphics support for a World-Wide-Web based architectural design service. Comput. Networks ISDN Syst. 29(14): 1611-1623 (1997) - [c11]Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse Grained Parallel Next Element Search. IPPS 1997: 320- - [c10]Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers. IPPS 1997: 616-620 - [c9]Andrew Rau-Chaplin, Trevor J. Smedley:
A Graphical Language for Generating Architectural Forms. VL 1997: 264-271 - [e1]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] - 1996
- [j11]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
- [j10]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) - [c8]Afonso Ferreira, Andrew Rau-Chaplin, Stéphane Ubéda:
Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. SPDP 1995: 561-568 - 1994
- [j9]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) - [j8]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) - [j7]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
- [j6]Laurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin:
Polygonal approximation by boundary reduction. Pattern Recognit. Lett. 14(2): 111-119 (1993) - [c7]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. SCG 1993: 298-307 - 1992
- [j5]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Parallel Fractional Cascading on Hypercube Multiprocessors. Comput. Geom. 2: 141-167 (1992) - 1991
- [j4]Frank Dehne, Russ Miller, Andrew Rau-Chaplin:
Optical clustering on a mesh-connected computer. Int. J. Parallel Program. 20(6): 475-486 (1991) - [c6]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 - [c5]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991: 255-262 - [c4]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
- [j3]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) - [j2]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) - [c3]Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin:
A massively parallel knowledge-base server using a hypercube multiprocessor. TAI 1990: 660-666
1980 – 1989
- 1989
- [c2]Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin:
Parallel branch and bound on fine-grained hypercube multiprocessors. TAI 1989: 616-622 - [c1]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
- [j1]Sameh Rabie, Andrew Rau-Chaplin, Taro Shibahara:
DAD: a real-time expert system for monitoring of data packet networks. IEEE Netw. 2(5): 29-34 (1988)
Coauthor Index
Frank Dehne
aka: Frank K. H. A. Dehne
aka: Frank K. H. A. Dehne
[j37] [c67] [c66] [c63] [j33] [j32] [c53] [j31] [p1] [j30] [c40] [j29] [j26] [c39] [c36] [c34] [j24] [j23] [c31] [c29] [c27] [j22] [c25] [c24] [j21] [c23] [c22] [c21] [c20] [j19] [c19] [c18] [c17] [c16] [j15] [c13] [c11] [e1] [j11] [j10] [j9] [j8] [j7] [c7] [j5] [j4] [c6] [c5] [c4] [j3] [j2] [c3] [c2] [c1]
Afonso Ferreira
aka: Afonso G. Ferreira
aka: Afonso G. Ferreira
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 2025-01-21 00:00 CET 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:
