Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Rau-Chaplin, Andrew"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths
Chris H. Hamilton
,
Andrew Rau-Chaplin
Information Processing Letters
105
(5), 2007, pp. 155-163
Solving large FPT problems on coarse-grained parallel machines
James Cheetham
,
Frank Dehne
,
Andrew Rau-Chaplin
,
Ulrike Stege
,
Peter J. Taillon
Journal of Computer and System Sciences
67
(4), 2003, pp. 691-706
A note on communication-efficient deterministic parallel algorithms for planar point location and 2D Voronoï diagram
Mohamadou Diallo
,
Afonso Ferreira
,
Andrew Rau-Chaplin
Parallel Processing Letters
11
(2-3), 2001, pp. 327-340
Scalable parallel algorithms for geometric pattern recognition
Laurence Boxer
,
Russ Miller
,
Andrew Rau-Chaplin
Journal Parallel Distributed Computing
58
(3), 1999, pp. 466-486
Coarse-grained parallel geometric search
Albert Chan
,
Frank Dehne
,
Andrew Rau-Chaplin
Journal Parallel Distributed Computing
57
(2), 1999, pp. 224-235
Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
Mohamadou Diallo
,
Afonso Ferreira
,
Andrew Rau-Chaplin
,
Stéphane Ubéda
Journal Parallel Distributed Computing
56
(1), 1999, pp. 47-70
Parallel algorithms for grounded range search and applications
Michael G. Lamoureux
,
Andrew Rau-Chaplin
Lecture Notes in Computer Science
1685
, 1999, pp. 525-532
Scaleable parallel algorithms for lower envelopes with applications
Laurence Boxer
,
Russ Miller
,
Andrew Rau-Chaplin
Journal Parallel Distributed Computing
53
(2), 1998, pp. 91-118
Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram
Mohamadou Diallo
,
Afonso Ferreira
,
Andrew Rau-Chaplin
Lecture Notes in Computer Science
1373
, 1998, pp. 399-409
Maintaining the extent of a moving point set
Pankaj K. Agarwal
,
Leonidas J. Guibas
,
John Hershberger
,
Eric Veach
Lecture Notes in Computer Science
1272
, 1997, pp. 31-44
Finding cores of limited length
Stephen Alstrup
,
Peter W. Lauridsen
,
Peer Sommerlund
,
Mikkel Thorup
Lecture Notes in Computer Science
1272
, 1997, pp. 45-54
Pattern matching in hypertext
Amihood Amir
,
Moshe Lewenstein
,
Noa Lewenstein
Lecture Notes in Computer Science
1272
, 1997, pp. 160-173
Multiple approximate string matching
Ricardo Baeza-Yates
,
Gonzalo Navarro
Lecture Notes in Computer Science
1272
, 1997, pp. 174-184
Offset-polygon annulus placement problems
Gill Barequet
,
Amy J. Briggs
,
Matthew T. Dickerson
,
Michael T. Goodrich
Lecture Notes in Computer Science
1272
, 1997, pp. 378-391
Voronoi diagrams for polygon-offset distance functions
Gill Barequet
,
Matthew T. Dickerson
,
Michael T. Goodrich
Lecture Notes in Computer Science
1272
, 1997, pp. 200-209
On-line load balancing for related machines
Piotr Berman
,
Moses Charikar
,
Marek Karpinski
Lecture Notes in Computer Science
1272
, 1997, pp. 116-125
Dynamic motion planning in low obstacle density environments
Robert-Paul Berretty
,
Mark Overmars
,
A. Frank van der Stappen
Lecture Notes in Computer Science
1272
, 1997, pp. 3-16
Computing orthogonal drawings with the minimum number of bends
Paola Bertolazzi
,
Giuseppe di Battista
,
Walter Didimo
Lecture Notes in Computer Science
1272
, 1997, pp. 331-344
Trans-dichotomous algorithms without multiplication - Some upper and lower bounds
Andrej Brodnik
,
Peter Bro Miltersen
,
J. Ian Munro
Lecture Notes in Computer Science
1272
, 1997, pp. 426-439
Constrained TSP and low-power computing
Moses Charikar
,
Rajeev Motwani
,
Prabhakar Raghavan
,
Craig Silverstein
Lecture Notes in Computer Science
1272
, 1997, pp. 104-115
Discrepancy theory and computational geometry
Bernard Chazelle
Lecture Notes in Computer Science
1272
, 1997, pp. 1-2
On geometric path query problems
Danny Z. Chen
,
Ovidiu Daescu
,
Kevin S. Klenk
Lecture Notes in Computer Science
1272
, 1997, pp. 248-257
Planarity, revisited
Zhi-Zhong Chen
,
Michelangelo Grigni
,
Christos H. Papadimitriou
Lecture Notes in Computer Science
1272
, 1997, pp. 472-473
Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
Sajal K. Das
,
M. Cristina Pinotti
Lecture Notes in Computer Science
1272
, 1997, pp. 272-281
Checking the convexity of polytopes and the planarity of subdivisions
O. Devillers
,
G. Liotta
,
F.P. Preparata
,
R. Tamassia
Lecture Notes in Computer Science
1272
, 1997, pp. 186-199
Seiten 1
2
3
>