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="Bhatt, Sandeep N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Area-time tradeoffs for universal VLSI circuits
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Geppino Pucci
Theoretical Computer Science
408
(2-3), 2008, pp. 143-150
Augmented ring networks
William Aiello
,
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Arnold L. Rosenberg
,
Ramesh K. Sitaraman
IEEE Transactions on Parallel and Distributed Systems
12
(6), 2001, pp. 598-609
Experiences with parallel
N
-body simulation
Pangfeng Liu
,
Sandeep N. Bhatt
IEEE Transactions on Parallel and Distributed Systems
11
(12), 2000, pp. 1306-1323
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
Optimal emulations by butterfly-like networks
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Jia-Wei Hong
,
F. Thomson Leighton
,
Bojana Obrenić
,
Arnold L. Rosenberg
,
Eric J. Schwabe
Journal of the ACM
43
(2), 1996, pp. 293-330
Scheduling tree-dags using FIFO queues: A control-memory trade-off
Sandeep N. Bhatt
,
Fan R.K. Chung
,
F. Thomas Leighton
,
Arnold L. Rosenberg
Journal Parallel Distributed Computing
33
(1), 1996, pp. 55-68
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
Salvage-embeddings of complete trees
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Frank Thomson Leighton
,
Arnold L. Rosenberg
SIAM Journal on Discrete Mathematics
8
(4), 1995, pp. 617-637
Scheduling trees using FIFO queues: A control-memory tradeoff
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Tom Leighton
,
Arnold L. Rosenberg
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 85-93
Experiences with parallel
N
-body simulation
Pangfeng Liu
,
Sandeep N. Bhatt
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 122-131
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
Efficient embeddings of trees in hypercubes
Sandeep N. Bhatt
,
Fan R.K. Chung
,
F. Thomson Leighton
,
Arnold L. Rosenberg
SIAM Journal on Computing
21
(1), 1992, February, pp. 151-162
Tolerating faults in synchronization networks
Sandeep N. Bhatt
,
Fan R.K. Chung
,
F. Thomson Leighton
,
Arnold L. Rosenberg
Lecture Notes in Computer Science
634
, 1992, pp. 1-12
Partitioning circuits for improved testability
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Arnold L. Rosenberg
Algorithmica
6
(1), 1991, pp. 37-48
Routing multiple paths in hypercubes
David S. Greenberg
,
Sandeep N. Bhatt
Math. Systems Theory
24
, 1991, pp. 295-321
Universal graphs for bounded-degree trees and planar graphs
Sandeep N. Bhatt
,
F.R.K. Chung
,
F.T. Leighton
,
Arnold L. Rosenberg
SIAM Journal on Discrete Mathematics
2
, 1989, pp. 145-155