The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sandeep N. Bhatt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002