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="Kamakoti, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Adaptive finite element analysis on a parallel and distributed environment
V. Annamalai
,
C.S. Krishnamoorthy
,
V. Kamakoti
Parallel Computing
25
(12), 1999, pp. 1413-1434
The colored sector search tree: A dynamic data structure for efficient high dimensional nearest-foreign-neighbor queries
T. Graf
,
V. Kamakoti
,
N.S. Janaki Latha
,
C. Pandu Rangan
Lecture Notes in Computer Science
1449
, 1998, pp. 35-44
Sparse dominance queries for many points in optimal time and space
T. Graf
,
V. Kamakoti
Information Processing Letters
64
(6), 1997, pp. 287-291
Efficient parallel algorithms for permutation graphs
K. Arvind
,
V. Kamakoti
,
C. Pandu Rangan
Journal Parallel Distributed Computing
26
(1), 1995, pp. 116-124
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
V. Kamakoti
,
Kamala Krithivasan
,
C. Pandu Rangan
Lecture Notes in Computer Science
959
, 1995, pp. 71-80
An optimal algorithm for reconstructing a binary tree
V. Kamakoti
,
C. Pandu Rangan
Information Processing Letters
42
, 1992, pp. 113-115