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="Maheshwari, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determining approximate shortest paths on weighted polyhedral surfaces
L. Aleksandrov
,
A. Maheshwari
,
J.-R. Sack
Journal of the ACM
52
(1), 2005, pp. 25-53
Blocking in parallel multisearch problems
W. Dittrich
,
D.A. Hutchinson
,
A. Maheshwari
Theory of Computing Systems
34
(2), 2001, pp. 145-189
Approximating shortest paths on weighted polyhedral surfaces
M. Lanthier
,
A. Maheshwari
,
J.-R. Sack
Algorithmica
30
(4), 2001, pp. 527-562
Parallel virtual memory
F. Dehne
,
W. Dittrich
,
D. Hutchinson
,
A. Maheshwari
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 889-890
Parallel neighbourhood modeling: Research summary
D. Hutchinson
,
L. Küttner
,
M. Lanthier
,
A. Maheshwari
,
D. Nussbaum
,
D. Roytenberg
,
J.-R. Sack
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'96 (Padua, Italy, June 24-26, 1996)
, 1996, pp. 204-207
Optimal parallel algorithms for rectilinear link-distance problems
A. Lingas
,
A. Maheshwari
,
J.-R. Sack
Algorithmica
14
, 1995, pp. 261-289