E-LIB Suche - Ergebnisse für: Bhatt, Sandeep N.

1

Area-time tradeoffs for universal VLSI circuits:

Bhatt, Sandeep N. ; Bilardi, Gianfranco ; Pucci, Geppino
Theoretical Computer Science. 408 (2008) 2-3 - p. 143-150 , 2008

Link: https://doi.org/10.1016/..

2

Tight Bounds on Parallel List Marking:

Bhatt, Sandeep N. ; Bilardi, Gianfranco ; Herley, Kieran T...
Journal of Parallel and Distributed Computing. 51 (1998) 2 - p. 75-88 , 1998

Link: https://doi.org/10.1006/..

3

Scheduling Tree-Dags Using FIFO Queues: A Control–Memory Tr..:

Bhatt, Sandeep N. ; Chung, Fan R.K. ; Leighton, F.Thomas.
Journal of Parallel and Distributed Computing. 33 (1996) 1 - p. 55-68 , 1996

Link: https://doi.org/10.1006/..

4

Optimal emulations by butterfly-like networks:

Bhatt, Sandeep N. ; Chung, Fan R. K. ; Hong, Jia-Wei...
Journal of the ACM. 43 (1996) 2 - p. 293-330 , 1996

Link: https://doi.org/10.1145/..

5

Optimal emulations by butterfly-like networks:

Bhatt, Sandeep N. ; Chung, Fan R. K. ; Hong, Jia-Wei...
Journal of the ACM (JACM). 43 (1996) 2 - p. 293-330 , 1996

Link: https://dl.acm.org/doi/1..

6

Salvage-Embeddings of Complete Trees:

Bhatt, Sandeep N. ; Chung, Fan R. K. ; Leighton, Frank Thomson.
SIAM Journal on Discrete Mathematics. 8 (1995) 4 - p. 617-637 , 1995

Link: https://doi.org/10.1137/..

7

Experiences with parallel N-body simulation:

, In: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures,

Liu, Pangfeng ; Bhatt, Sandeep N. - p. 122-131 , 1994

Link: https://dl.acm.org/doi/1..

8

Editor's foreword:

Bhatt, Sandeep N.
Mathematical Systems Theory. 27 (1994) 1 - p. 1-1 , 1994

Link: https://doi.org/10.1007/..

9

Efficient Embeddings of Trees in Hypercubes:

Bhatt, Sandeep N. ; Chung, Fan R. K. ; Leighton, F. Thomson.
SIAM Journal on Computing. 21 (1992) 1 - p. 151-162 , 1992

Link: https://doi.org/10.1137/..

10

Partitioning circuits for improved testability:

Bhatt, Sandeep N. ; Chung, Fan R. K. ; Rosenberg, Arnold L.
Algorithmica. 6 (1991) 1-6 - p. 37-48 , 1991

Link: https://doi.org/10.1007/..

11

Routing multiple paths in hypercubes:

Greenberg, David S. ; Bhatt, Sandeep N.
Mathematical Systems Theory. 24 (1991) 1 - p. 295-321 , 1991

Link: https://doi.org/10.1007/..

12

Universal Graphs for Bounded-Degree Trees and Planar Graphs:

Bhatt, Sandeep N. ; Chung, F. R. K. ; Leighton, F. T..
SIAM Journal on Discrete Mathematics. 2 (1989) 2 - p. 145-155 , 1989

Link: https://doi.org/10.1137/..

13

The complexity of minimizing wire lengths in VLSI layouts:

Bhatt, Sandeep N. ; Cosmadakis, Stavros S.
Information Processing Letters. 25 (1987) 4 - p. 263-267 , 1987

Link: https://doi.org/10.1016/..

14

A framework for solving VLSI graph layout problems:

Bhatt, Sandeep N. ; Thomson Leighton, Frank
Journal of Computer and System Sciences. 28 (1984) 2 - p. 300-343 , 1984

Link: https://doi.org/10.1016/..

15

An approximation algorithm for manhattan routing:

, In: Proceedings of the fifteenth annual ACM symposium on Theory of computing,

Baker, Brenda S. ; Bhatt, Sandeep N. ; Leighton, Frank Thomson - p. 477-486 , 1983

Link: https://dl.acm.org/doi/1..