The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew Rau-Chaplin: [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. Christian Blouin, Davin Butt, G. Hickey, Andrew Rau-Chaplin
    Fast Parallel Maximum Likelihood-Based Protein Phylogeny. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:281-287 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Michael Lawrence, Andrew Rau-Chaplin
    Dynamic View Selection for OLAP. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2006, pp:33-44 [Conf]
  8. 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]
  9. Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin
    Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:875-886 [Conf]
  10. Michael G. Lamoureux, Andrew Rau-Chaplin
    Parallel Algorithms for Grounded Range Search and Applications. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:525-532 [Conf]
  11. 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]
  12. Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
    A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering. [Citation Graph (0, 0)][DBLP]
    HPCC, 2005, pp:856-865 [Conf]
  13. Michael Lawrence, Andrew Rau-Chaplin
    The OLAP-Enabled Grid: Model and Query Processing Algorithms. [Citation Graph (0, 0)][DBLP]
    HPCS, 2006, pp:4- [Conf]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
    d-Dimensional Range Search on Multicomputers. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:616-620 [Conf]
  24. 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]
  25. 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]
  26. Philip T. Cox, Simon Gauvin, Andrew Rau-Chaplin
    Adding parallelism to visual data flow programs. [Citation Graph (0, 0)][DBLP]
    SOFTVIS, 2005, pp:135-144 [Conf]
  27. 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]
  28. Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
    Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:399-409 [Conf]
  29. Andrew Rau-Chaplin, Trevor J. Smedley
    A Graphical Language for Generating Architectural Forms. [Citation Graph (0, 0)][DBLP]
    VL, 1997, pp:264-271 [Conf]
  30. 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]
  31. Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
    d-Dimensional Range Search on Multicomputers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:195-208 [Journal]
  32. 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]
  33. Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin
    Parallel computation on interval graphs: algorithms and experiments. [Citation Graph (0, 0)][DBLP]
    Concurrency and Computation: Practice and Experience, 2002, v:14, n:11, pp:885-910 [Journal]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. Laurence Boxer, Russ Miller, Andrew Rau-Chaplin
    Scaleable Parallel Algorithms for Lower Envelopes with Applications. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:53, n:2, pp:91-118 [Journal]
  42. Laurence Boxer, Russ Miller, Andrew Rau-Chaplin
    Scalable Parallel Algorithms for Geometric Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:58, n:3, pp:466-486 [Journal]
  43. 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]
  44. 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]
  45. 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]
  46. Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin, Stéphane Ubéda
    Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:56, n:1, pp:47-70 [Journal]
  47. 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]
  48. 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]
  49. Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
    A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2001, v:11, n:2/3, pp:327-340 [Journal]
  50. Laurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin
    Polygonal approximation by boundary reduction. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1993, v:14, n:2, pp:111-119 [Journal]
  51. Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh
    Adaptive Tuple Differential Coding. [Citation Graph (0, 0)][DBLP]
    DEXA, 2007, pp:109-119 [Conf]
  52. Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh
    Parallel Computation of Skyline Queries. [Citation Graph (0, 0)][DBLP]
    HPCS, 2007, pp:12- [Conf]
  53. 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]

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


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


  56. Compact Hilbert Indices for Multi-Dimensional Data. [Citation Graph (, )][DBLP]


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


Search in 0.004secs, Finished in 0.006secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002