Sandeep N. Bhatt

Affiliations:
  • Hewlett Packard Labs, Systems Security Lab


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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
The Operational Role of Security Information and Event Management Systems.
IEEE Secur. Priv., 2014

2011
On Computing Enterprise IT Risk Metrics.
Proceedings of the Future Challenges in Security and Privacy for Academia and Industry, 2011

2009
Analyzing end-to-end network reachability.
Proceedings of the Integrated Network Management, 2009

2008
Area-time tradeoffs for universal VLSI circuits.
Theor. Comput. Sci., 2008

Fast, Cheap, and in Control: Towards Pain-Free Security!
Proceedings of the 22nd Large Installation System Administration Conference, 2008

2003
Federated Security Management for Dynamic Coalitions.
Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

2002
Traversing Directed Eulerian Mazes.
J. Graph Algorithms Appl., 2002

2001
Augmented Ring Networks.
IEEE Trans. Parallel Distributed Syst., 2001

Tree Search on an Atomic Model for Message Passing.
SIAM J. Comput., 2001

2000
Experiences with Parallel N-Body Simulation.
IEEE Trans. Parallel Distributed Syst., 2000

Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Tight Bounds for On-Line Tree Embeddings.
SIAM J. Comput., 1999

Parrallel algorithms.
IEEE Concurr., 1999

Managing Security in Dynamic Networks.
Proceedings of the 13th Conference on Systems Administration (LISA-99), 1999

Area-Universal Circuits with Constant Slowdown.
Proceedings of the 18th Conference on Advanced Research in VLSI (ARVLSI '99), 1999

1998
TED Models for ATM Internetworks.
SIGMETRICS Perform. Evaluation Rev., 1998

Tight Bounds on Parallel List Marking.
J. Parallel Distributed Comput., 1998

Parallel simulation techniques for large-scale networks.
IEEE Commun. Mag., 1998

1997
An Optimal Strategies for Cycle-Stealing in Networks of Workstations.
IEEE Trans. Computers, 1997

A Virtual PNNI Network Testbed.
Proceedings of the 29th conference on Winter simulation, 1997

1996
On Bufferless Routing of Variable Length Messages in Leveled Networks.
IEEE Trans. Computers, 1996

Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.
J. Parallel Distributed Comput., 1996

Optimal Emulations by Butterfly-Like Networks.
J. ACM, 1996

1995
Salvage-Embeddings of Complete Trees.
SIAM J. Discret. Math., 1995

1994
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993
Scattering and Gathering Messages in Networks of Processors.
IEEE Trans. Computers, 1993

Object-Oriented Support for Adaptive Methods on Paranel Machines.
Sci. Program., 1993

Taking Random Walks to Grow Trees in Hypercubes.
J. ACM, 1993

An Atomic Model for Message-Passing.
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).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Efficient Embeddings of Trees in Hypercubes.
SIAM J. Comput., 1992

Tolerating Faults in Synchronization Networks.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1991
Routing Multiple Paths in Hypercubes.
Math. Syst. Theory, 1991

Partitioning Circuits for Improved Testability.
Algorithmica, 1991

1989
Universal Graphs for Bounded-Degree Trees and Planar Graphs.
SIAM J. Discret. Math., 1989

1988
Optimal Simulations by Butterfly Networks (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Take a Walk, Grow a Tree (Preliminary Version)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
The Complexity of Minimizing Wire Lengths in VLSI Layouts.
Inf. Process. Lett., 1987

1986
Optimal Simulations of Tree Machines (Preliminary Version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1984
A Framework for Solving VLSI Graph Layout Problems.
J. Comput. Syst. Sci., 1984

1983
An Approximation Algorithm for Manhattan Routing (Extended Abstract)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
How to Assemble Tree Machines (Extended Abstract)
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982


  Loading...