Sandeep N. Bhatt

48 papers A* 7A 1B 6Misc 2Journal 24Unranked 8
YearRankTypeTitle / Venue / Authors
2014 J jnl
The Operational Role of Security Information and Event Management Systems.
IEEE Secur. Priv.
Sandeep N. Bhatt, Pratyusa K. Manadhata, Loai Zomlot
2012 — conf
Examining intrusion prevention system events from worldwide networks.
BADGERS@CCS
Sathya Chandran Sundaramurthy, Sandeep N. Bhatt, Marc R. Eisenbarth
2011 Misc conf
On Computing Enterprise IT Risk Metrics.
SEC
Sandeep N. Bhatt, William G. Horne, Prasad Rao
2009 — conf
Analyzing end-to-end network reachability.
Integrated Network Management
Sruthi Bandhakavi, Sandeep N. Bhatt, Cat Okita, Prasad Rao
2008 J jnl
Area-time tradeoffs for universal VLSI circuits.
Theor. Comput. Sci.
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
2008 — conf
Fast, Cheap, and in Control: Towards Pain-Free Security!
LISA
Sandeep N. Bhatt, Cat Okita, Prasad Rao
2003 — conf
Federated Security Management for Dynamic Coalitions.
DISCEX (2)
Sandeep N. Bhatt, S. Raj Rajagopalan, Prasad Rao
2002 J jnl
Traversing Directed Eulerian Mazes.
J. Graph Algorithms Appl.
Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
2001 J jnl
Augmented Ring Networks.
IEEE Trans. Parallel Distributed Syst.
William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
2001 J jnl
Tree Search on an Atomic Model for Message Passing.
SIAM J. Comput.
Pangfeng Liu, William Aiello, Sandeep N. Bhatt
2000 J jnl
Experiences with Parallel N-Body Simulation.
IEEE Trans. Parallel Distributed Syst.
Pangfeng Liu, Sandeep N. Bhatt
2000 A* conf
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP.
ICALP
William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan
2000 B conf
Traversing Directed Eulerian Mazes.
WG
Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
1999 — conf
Area-Universal Circuits with Constant Slowdown.
ARVLSI
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
1999 B conf
Augmented Ring Networks.
SIROCCO
William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
1999 — conf
Managing Security in Dynamic Networks.
LISA
Alexander V. Konstantinou, Yechiam Yemini, Sandeep N. Bhatt, Sivaramakrishnan Rajagopalan
1999 J jnl
Parrallel algorithms.
IEEE Concurr.
Sandeep N. Bhatt
1999 J jnl
Tight Bounds for On-Line Tree Embeddings.
SIAM J. Comput.
Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu
1998 J jnl
TED Models for ATM Internetworks.
SIGMETRICS Perform. Evaluation Rev.
Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt
1998 J jnl
Tight Bounds on Parallel List Marking.
J. Parallel Distributed Comput.
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
1997 Misc conf
A Virtual PNNI Network Testbed.
WSC
Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt
1997 J jnl
An Optimal Strategies for Cycle-Stealing in Networks of Workstations.
IEEE Trans. Computers
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1996 J jnl
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
1996 J jnl
Optimal Emulations by Butterfly-Like Networks.
J. ACM
Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe
1996 J jnl
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.
J. Parallel Distributed Comput.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1995 J jnl
Salvage-Embeddings of Complete Trees.
SIAM J. Discret. Math.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1995 — conf
Tight Bounds on Parallel List Marking.
Euro-Par
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
1994 B conf
Experiences with Parallel N-Body Simulation.
SPAA
Pangfeng Liu, Sandeep N. Bhatt
1994 B conf
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.
SPAA
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1993 B conf
An Atomic Model for Message-Passing.
SPAA
Pangfeng Liu, William Aiello, Sandeep N. Bhatt
1993 J jnl
Object-Oriented Support for Adaptive Methods on Paranel Machines.
Sci. Program.
Sandeep N. Bhatt, Marina C. Chen, James R. Cowie, Cheng-Yee Lin, Pangfeng Liu
1993 A conf
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
ESA
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe
1993 J jnl
Scattering and Gathering Messages in Networks of Processors.
IEEE Trans. Computers
Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg
1993 J jnl
Taking Random Walks to Grow Trees in Hypercubes.
J. ACM
Sandeep N. Bhatt, Jin-Yi Cai
1992 J jnl
Efficient Embeddings of Trees in Hypercubes.
SIAM J. Comput.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1992 — conf
Tolerating Faults in Synchronization Networks.
CONPAR
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1991 J jnl
Partitioning Circuits for Improved Testability.
Algorithmica
Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg
1991 J jnl
Routing Multiple Paths in Hypercubes.
Math. Syst. Theory
David S. Greenberg, Sandeep N. Bhatt
1991 A* conf
Tight Bounds for On-Line Tree Embeddings.
SODA
Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu
1990 B conf
Routing Multiple Paths in Hypercubes.
SPAA
David S. Greenberg, Sandeep N. Bhatt
1989 J jnl
Universal Graphs for Bounded-Degree Trees and Planar Graphs.
SIAM J. Discret. Math.
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1988 A* conf
Optimal Simulations by Butterfly Networks (Preliminary Version)
STOC
Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg
1988 A* conf
Take a Walk, Grow a Tree (Preliminary Version)
FOCS
Sandeep N. Bhatt, Jin-Yi Cai
1987 J jnl
The Complexity of Minimizing Wire Lengths in VLSI Layouts.
Inf. Process. Lett.
Sandeep N. Bhatt, Stavros S. Cosmadakis
1986 A* conf
Optimal Simulations of Tree Machines (Preliminary Version)
FOCS
Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1984 J jnl
A Framework for Solving VLSI Graph Layout Problems.
J. Comput. Syst. Sci.
Sandeep N. Bhatt, Frank Thomson Leighton
1983 A* conf
An Approximation Algorithm for Manhattan Routing (Extended Abstract)
STOC
Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton
1982 A* conf
How to Assemble Tree Machines (Extended Abstract)
STOC
Sandeep N. Bhatt, Charles E. Leiserson