dblp.uni-trier.dewww.uni-trier.de

Sandeep N. Bhatt Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
41EESandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008)
2002
40EESandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar: Traversing Directed Eulerian Mazes. J. Graph Algorithms Appl. 6(2): 157-173 (2002)
2001
39EEWilliam Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. IEEE Trans. Parallel Distrib. Syst. 12(6): 598-609 (2001)
38EEPangfeng Liu, William Aiello, Sandeep N. Bhatt: Tree Search on an Atomic Model for Message Passing. SIAM J. Comput. 31(1): 67-85 (2001)
2000
37EEWilliam Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan: Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. ICALP 2000: 463-474
36EESandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar: Traversing Directed Eulerian Mazes. WG 2000: 35-46
35EEPangfeng Liu, Sandeep N. Bhatt: Experiences with Parallel N-Body Simulation. IEEE Trans. Parallel Distrib. Syst. 11(12): 1306-1323 (2000)
1999
34EESandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-Universal Circuits with Constant Slowdown. ARVLSI 1999: 89-98
33EEAlexander V. Konstantinou, Yechiam Yemini, Sandeep N. Bhatt, Sivaramakrishnan Rajagopalan: Managing Security in Dynamic Networks. LISA 1999: 109-122
32 William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. SIROCCO 1999: 1-16
31 Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu: Tight Bounds for On-Line Tree Embeddings. SIAM J. Comput. 29(2): 474-491 (1999)
1998
30 Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. J. Parallel Distrib. Comput. 51(2): 75-88 (1998)
29 Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt: TED Models for ATM Internetworks. SIGMETRICS Performance Evaluation Review 25(4): 12-21 (1998)
1997
28EEKalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt: A Virtual PNNI Network Testbed. Winter Simulation Conference 1997: 1057-1064
27 Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Trans. Computers 46(5): 545-557 (1997)
1996
26 Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable Length Messages in Leveled Networks. IEEE Trans. Computers 45(6): 714-729 (1996)
25EESandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe: Optimal Emulations by Butterfly-Like Networks. J. ACM 43(2): 293-330 (1996)
24 Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. J. Parallel Distrib. Comput. 33(1): 55-68 (1996)
1995
23EESandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242
22EESandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Salvage-Embeddings of Complete Trees. SIAM J. Discrete Math. 8(4): 617-637 (1995)
1994
21EEPangfeng Liu, Sandeep N. Bhatt: Experiences with Parallel N-Body Simulation. SPAA 1994: 122-131
20EESandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. SPAA 1994: 85-93
1993
19EESandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). ESA 1993: 49-60
18EEPangfeng Liu, William Aiello, Sandeep N. Bhatt: An Atomic Model for Message-Passing. SPAA 1993: 154-163
17 Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg: Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Computers 42(8): 938-949 (1993)
16EESandeep N. Bhatt, Jin-yi Cai: Taking Random Walks to Grow Trees in Hypercubes. J. ACM 40(3): 741-764 (1993)
15EESandeep N. Bhatt, Marina C. Chen, James R. Cowie, Cheng-Yee Lin, Pangfeng Liu: Object-Oriented Support for Adaptive Methods on Paranel Machines. Scientific Programming 2(4): 179-192 (1993)
1992
14EESandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Tolerating Faults in Synchronization Networks. CONPAR 1992: 1-12
13 Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Efficient Embeddings of Trees in Hypercubes. SIAM J. Comput. 21(1): 151-162 (1992)
1991
12 Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu: Tight Bounds for On-Line Tree Embeddings. SODA 1991: 344-350
11 Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg: Partitioning Circuits for Improved Testability. Algorithmica 6(1): 37-48 (1991)
10 David S. Greenberg, Sandeep N. Bhatt: Routing Multiple Paths in Hypercubes. Mathematical Systems Theory 24(4): 295-321 (1991)
1990
9EEDavid S. Greenberg, Sandeep N. Bhatt: Routing Multiple Paths in Hypercubes. SPAA 1990: 45-54
1989
8 Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Discrete Math. 2(2): 145-155 (1989)
1988
7 Sandeep N. Bhatt, Jin-yi Cai: Take a Walk, Grow a Tree (Preliminary Version) FOCS 1988: 469-478
6 Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg: Optimal Simulations by Butterfly Networks (Preliminary Version) STOC 1988: 192-204
1987
5 Sandeep N. Bhatt, Stavros S. Cosmadakis: The Complexity of Minimizing Wire Lengths in VLSI Layouts. Inf. Process. Lett. 25(4): 263-267 (1987)
1986
4 Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg: Optimal Simulations of Tree Machines (Preliminary Version) FOCS 1986: 274-282
1984
3 Sandeep N. Bhatt, Frank Thomson Leighton: A Framework for Solving VLSI Graph Layout Problems. J. Comput. Syst. Sci. 28(2): 300-343 (1984)
1983
2 Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton: An Approximation Algorithm for Manhattan Routing (Extended Abstract) STOC 1983: 477-486
1982
1 Sandeep N. Bhatt, Charles E. Leiserson: How to Assemble Tree Machines (Extended Abstract) STOC 1982: 77-84

Coauthor Index

1William Aiello [18] [32] [37] [38] [39]
2Matthew Andrews [28] [29]
3Brenda S. Baker [2]
4Gianfranco Bilardi [19] [23] [26] [30] [34] [41]
5Jin-yi Cai [7] [16]
6Marina C. Chen [15]
7Fan R. K. Chung (Fan Chung Graham) [4] [6] [8] [11] [13] [14] [20] [22] [24] [25] [27] [32] [39]
8Stavros S. Cosmadakis [5]
9James R. Cowie [15]
10Shimon Even [36] [40]
11David S. Greenberg [9] [10] [12] [31] [36] [40]
12Kieran T. Herley [23] [30]
13Jia-Wei Hong [6] [25]
14Alexander V. Konstantinou [33]
15Frank Thomson Leighton (Tom Leighton) [2] [3] [4] [6] [8] [12] [13] [14] [20] [22] [24] [25] [27] [31]
16Charles E. Leiserson [1]
17Cheng-Yee Lin [15]
18Pangfeng Liu [12] [15] [18] [21] [31] [35] [38]
19Bojana Obrenic [25]
20Rafail Ostrovsky [37]
21Kalyan S. Perumalla [28] [29]
22Geppino Pucci [17] [19] [23] [26] [30] [34] [41]
23Sivaramakrishnan Rajagopalan [33] [37]
24Abhiram G. Ranade [17] [19] [23] [26] [30]
25Arnold L. Rosenberg [4] [6] [8] [11] [13] [14] [17] [19] [20] [22] [24] [25] [26] [27] [32] [39]
26Eric J. Schwabe [19] [25] [26]
27Ramesh K. Sitaraman [32] [39]
28Rafi Tayar [36] [40]
29Yechiam Yemini [33]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)