Sandeep N. Bhatt

According to our database, Sandeep N. Bhatt authored at least 43 papers between 1982 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2014

The Operational Role of Security Information and Event Management Systems.

Sandeep N. Bhatt, Pratyusa K. Manadhata, Loai Zomlot

IEEE Secur. Priv., 2014

2012

Examining intrusion prevention system events from worldwide networks.

Sathya Chandran Sundaramurthy, Sandeep N. Bhatt, Marc R. Eisenbarth

Proceedings of the 2012 ACM Workshop on Building analysis datasets and gathering experience returns for security, 2012

2011

On Computing Enterprise IT Risk Metrics.

Sandeep N. Bhatt, William G. Horne, Prasad Rao

Proceedings of the Future Challenges in Security and Privacy for Academia and Industry, 2011

2009

Analyzing end-to-end network reachability.

Sruthi Bandhakavi, Sandeep N. Bhatt, Cat Okita, Prasad Rao

Proceedings of the Integrated Network Management, 2009

2008

Area-time tradeoffs for universal VLSI circuits.

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci

Theor. Comput. Sci., 2008

Fast, Cheap, and in Control: Towards Pain-Free Security!

Sandeep N. Bhatt, Cat Okita, Prasad Rao

Proceedings of the 22nd Large Installation System Administration Conference, 2008

2003

Federated Security Management for Dynamic Coalitions.

Sandeep N. Bhatt, S. Raj Rajagopalan, Prasad Rao

Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

2002

Traversing Directed Eulerian Mazes.

Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar

J. Graph Algorithms Appl., 2002

2001

Augmented Ring Networks.

William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman

IEEE Trans. Parallel Distributed Syst., 2001

Tree Search on an Atomic Model for Message Passing.

Pangfeng Liu, William Aiello, Sandeep N. Bhatt

SIAM J. Comput., 2001

2000

Experiences with Parallel N-Body Simulation.

Pangfeng Liu, Sandeep N. Bhatt

IEEE Trans. Parallel Distributed Syst., 2000

Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP.

William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Tight Bounds for On-Line Tree Embeddings.

Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu

SIAM J. Comput., 1999

Parrallel algorithms.

Sandeep N. Bhatt

IEEE Concurr., 1999

Managing Security in Dynamic Networks.

Alexander V. Konstantinou, Yechiam Yemini, Sandeep N. Bhatt, Sivaramakrishnan Rajagopalan

Proceedings of the 13th Conference on Systems Administration (LISA-99), 1999

Area-Universal Circuits with Constant Slowdown.

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci

Proceedings of the 18th Conference on Advanced Research in VLSI (ARVLSI '99), 1999

1998

TED Models for ATM Internetworks.

Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt

SIGMETRICS Perform. Evaluation Rev., 1998

Tight Bounds on Parallel List Marking.

Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade

J. Parallel Distributed Comput., 1998

Parallel simulation techniques for large-scale networks.

Sandeep Nautam Bhatt, Richard Fujimoto, Andy Ogielski, Kalyan S. Perumalla

IEEE Commun. Mag., 1998

1997

An Optimal Strategies for Cycle-Stealing in Networks of Workstations.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

IEEE Trans. Computers, 1997

A Virtual PNNI Network Testbed.

Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt

Proceedings of the 29th conference on Winter simulation, 1997

1996

On Bufferless Routing of Variable Length Messages in Leveled Networks.

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe

IEEE Trans. Computers, 1996

Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

J. Parallel Distributed Comput., 1996

Optimal Emulations by Butterfly-Like Networks.

Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe

J. ACM, 1996

1995

Salvage-Embeddings of Complete Trees.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

SIAM J. Discret. Math., 1995

1994

Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Scattering and Gathering Messages in Networks of Processors.

Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg

IEEE Trans. Computers, 1993

Object-Oriented Support for Adaptive Methods on Paranel Machines.

Sandeep N. Bhatt, Marina C. Chen, James R. Cowie, Cheng-Yee Lin, Pangfeng Liu

Sci. Program., 1993

Taking Random Walks to Grow Trees in Hypercubes.

Sandeep N. Bhatt, Jin-yi Cai

J. ACM, 1993

An Atomic Model for Message-Passing.

Pangfeng Liu, William Aiello, Sandeep N. Bhatt

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Efficient Embeddings of Trees in Hypercubes.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

SIAM J. Comput., 1992

Tolerating Faults in Synchronization Networks.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

Routing Multiple Paths in Hypercubes.

David S. Greenberg, Sandeep N. Bhatt

Math. Syst. Theory, 1991

Partitioning Circuits for Improved Testability.

Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg

Algorithmica, 1991

1989

Universal Graphs for Bounded-Degree Trees and Planar Graphs.

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

SIAM J. Discret. Math., 1989

1988

Optimal Simulations by Butterfly Networks (Preliminary Version)

Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Take a Walk, Grow a Tree (Preliminary Version)

Sandeep N. Bhatt, Jin-yi Cai

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

The Complexity of Minimizing Wire Lengths in VLSI Layouts.

Sandeep N. Bhatt, Stavros S. Cosmadakis

Inf. Process. Lett., 1987

1986

Optimal Simulations of Tree Machines (Preliminary Version)

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1984

A Framework for Solving VLSI Graph Layout Problems.

Sandeep N. Bhatt, Frank Thomson Leighton

J. Comput. Syst. Sci., 1984

1983

An Approximation Algorithm for Manhattan Routing (Extended Abstract)

Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982

How to Assemble Tree Machines (Extended Abstract)

Sandeep N. Bhatt, Charles E. Leiserson

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982