# Andrew Rau-Chaplin

Publications132

Citations1,011

Influential Citations78

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin
- Symposium on Computational Geometry
- 1993

Parallel Computational Geometry is concerned with solving some given geometric problem of size n on a parallel computer with p processors (e.g., a PRAM, mesh, or hypercube multiprocessor) in time… (More)

- Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin
- Int. J. Comput. Geometry Appl.
- 1993

We study scalable parallel computational geometry algorithms for the coarse grained multicomputer model: p processors solving a problem on n data items, were each processor has O(n/p)≫O(1) local… (More)

- James Cheetham, Frank Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
- J. Comput. Syst. Sci.
- 2003

Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods.… (More)

- Glenn Hickey, Frank Dehne, Andrew Rau-Chaplin, Christian Blouin
- Evolutionary bioinformatics online
- 2008

The subtree prune and regraft distance (d(SPR)) between phylogenetic trees is important both as a general means of comparing phylogenetic tree topologies as well as a measure of lateral gene transfer… (More)

- Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
- Distributed and Parallel Databases
- 2006

On-line Analytical Processing (OLAP) has become one of the most powerful and prominent technologies for knowledge discovery in VLDB (Very Large Database) environments. Central to the OLAP paradigm is… (More)

- Chris H. Hamilton, Andrew Rau-Chaplin
- Inf. Process. Lett.
- 2008

In this paper we define a new compact Hilbert index which, while maintaining all of the advantages of the standard Hilbert curve, permits spaces with unequal dimension cardinalities. The compact… (More)

- Laurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin
- Pattern Recognition Letters
- 1993

Abstract We give a sequential algorithm for approximating a given polygon P by another polygon P ′ such that P ′ is a ‘good approximation’ of P , and has fewer edges. We formalize the notion of a… (More)

- Ying Chen, Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
- Proceedings International Parallel and…
- 2003

The pre-computation of data cubes is critical to improving the response time of on-line analytical processing (OLAP) systems and can be instrumental in accelerating data mining tasks in large data… (More)

- Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
- CCGrid . 3rd IEEE/ACM International Symposium on…
- 2003

This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to implement, requires only… (More)

- Aman Kumar Bahl, Oliver Baltzer, Andrew Rau-Chaplin, Blesson Varghese
- SC Companion: High Performance Computing…
- 2012

At the heart of the analytical pipeline of a modern quantitative insurance/reinsurance company is a stochastic simulation technique for portfolio risk analysis and pricing process referred to as… (More)