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
[1]
Hilfe
Suche: Author="Ranade, Abhiram"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling light-trails on WDM rings
Soumitra Pal
,
Abhiram Ranade
Journal Parallel Distributed Computing
72
(10), 2012, pp. 1226-1236
Precedence constrained scheduling in
(2- \frac{7}{3p+1})\cdot
optimal
Devdatta Gangal
,
Abhiram Ranade
Journal of Computer and System Sciences
74
(7), 2008, pp. 1139-1146
Scheduling loosely connected task graphs
Abhiram G. Ranade
Journal of Computer and System Sciences
67
(1), 2003, pp. 198-208
I/O-complexity of graph algorithms
Kameshwar Munagala
,
Abhiram Ranade
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 687-694
Tight bounds on parallel list marking
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Kieran T. Herley
,
Geppino Pucci
,
Abhiram Ranade
Journal Parallel Distributed Computing
51
(2), 1998, pp. 75-88
On bufferless routing of variable length messages in leveled networks
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Geppino Pucci
,
Abhiram Ranade
,
Arnold L. Rosenberg
,
Eric J. Schwabe
IEEE Transactions on Computers
45
(6), 1996, pp. 714-729
Bandwidth efficient parallel computation
Abhiram Ranade
Lecture Notes in Computer Science
1099
, 1996, pp. 4-23
Tight bounds on parallel list marking
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Kieran T. Herley
,
Geppino Pucci
,
Abhiram G. Ranade
Lecture Notes in Computer Science
966
, 1995, pp. 231-242
Randomized routing and sorting on fixed-connection networks
F.T. Leighton
,
Bruce M. Maggs
,
Abhiram G. Ranade
,
Satish B. Rao
Journal of Algorithms
17
(1), 1994, pp. 157-205
Nearly tight bounds for wormhole routing
Abhiram Ranade
,
Saul Schleimer
,
Daniel Shawcross Wilkerson
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 347-355
Optimal speedup for backtrack search on a butterfly network
Abhiram Ranade
Math. Systems Theory
27
(1), 1994, pp. 85-101
Scattering and gathering messages in networks of processors
Sandeep N. Bhatt
,
Geppino Pucci
,
Abhiram Ranade
,
Arnold L. Rosenberg
IEEE Transactions on Computers
42
(8), 1993, August, pp. 938-949
SnakeSort: A family of simple optimal randomized sorting algorithms
David T. Blackston
,
Abhiram Ranade
Proceedings of the 1993 International Conference on Parallel Processing. Vol.~III: Algorithms & Applications (St.~Charles, Illinois, August 16-20, 1993)
3
, 1993, pp. 201-204
A framework for analyzing locality and portability issues in parallel computing
Abhiram Ranade
Lecture Notes in Computer Science
678
, 1993, pp. 185-194
Dynamic tree embeddings in butterflies and hypercubes
F.T. Leighton
,
Mark J. Newman
,
Abhiram G. Ranade
,
Eric J. Schwabe
SIAM Journal on Computing
21
(4), 1992, August, pp. 639-654
Maintaining dynamic ordered sets on processor networks
Abhiram Ranade
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'92 (San Diego, California, June 29 - July 1, 1992)
, 1992, pp. 127-137
How to emulate shared memory
Abhiram G. Ranade
Journal of Computer and System Sciences
42
, 1991, pp. 307-326
Optimal speedup for backtrack search on a butterfly network
Abhiram Ranade
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'91 (Hilton Head, South Carolina, July 21-24, 1991)
, 1991, pp. 40-48
A simulation-based comparison of interconnection networks
M.T. Raghunath
,
Abhiram Ranade
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 98-103