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
[2]
Hilfe
Suche: Author="Srinivasan, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Latency tolerance through parallelization of time in scientific applications
A. Srinivasan
,
N. Chandra
Parallel Computing
31
(7), 2005, pp. 777-796
The Predictive Toxicology Challenge 2000-2001
C. Helma
,
R.D. King
,
S. Kramer
,
A. Srinivasan
Bioinformatics
17
(1), 2001, pp. 107-108
Image compression for fast wavelet-based subregion retrieval
A.S. Poulakidas
,
A. Srinivasan
,
Ö. Eğecioğlu
,
O. Ibarra
,
T. Yang
Theoretical Computer Science
240
(2), 2000, pp. 447-469
Partial and perfect path covers of cographs
D.G. Kirkpatrick
,
K. Madhukar Reddy
,
C. Pandu Rangan
,
A. Srinivasan
Discrete Applied Mathematics
89
(1-3), 1998, pp. 143-153
Improved parallel approximation of a class of integer programming problems
N. Alon
,
A. Srinivasan
Algorithmica
17
, 1997, pp. 449-462
A compact storage scheme for fast wavelet-based subregion retrieval
A.S. Poulakidas
,
A. Srinivasan
,
O. Egecioglu
,
O. Ibarra
,
T. Yang
Lecture Notes in Computer Science
1276
, 1997, pp. 353-362
Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
A. Srinivasan
,
C. Pandu Rangan
Theoretical Computer Science
91
, 1991, pp. 1-21
The translation of DNA primary base sequence into three-dimensional structure
W.K. Olson
,
A.R. Srinivasan
Bioinformatics
4
(1), 1988, pp. 133-142
An investigation of some computational aspects of integer programming
A.V. Srinivasan
Journal of the ACM
12
, 1965, pp. 525-535