Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandeep N. Bhatt
Person information
- affiliation: Hewlett Packard Labs, Systems Security Lab
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j25]Sandeep N. Bhatt, Pratyusa K. Manadhata, Loai Zomlot:
The Operational Role of Security Information and Event Management Systems. IEEE Secur. Priv. 12(5): 35-41 (2014)- 2008
- [j24]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
:
Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008) - 2002
- [j23]Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar:
Traversing Directed Eulerian Mazes. J. Graph Algorithms Appl. 6(2): 157-173 (2002) - 2001
- [j22]Pangfeng Liu, William Aiello, Sandeep N. Bhatt:
Tree Search on an Atomic Model for Message Passing. SIAM J. Comput. 31(1): 67-85 (2001) - [j21]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. IEEE Trans. Parallel Distributed Syst. 12(6): 598-609 (2001) - 2000
- [j20]Pangfeng Liu, Sandeep N. Bhatt:
Experiences with Parallel N-Body Simulation. IEEE Trans. Parallel Distributed Syst. 11(12): 1306-1323 (2000) - 1999
- [j19]Sandeep N. Bhatt:
Parrallel algorithms. IEEE Concurr. 7(4): 89-91 (1999) - [j18]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
- [j17]Sandeep Nautam Bhatt, Richard Fujimoto, Andy Ogielski, Kalyan S. Perumalla:
Parallel simulation techniques for large-scale networks. IEEE Commun. Mag. 36(8): 42-47 (1998) - [j16]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
Tight Bounds on Parallel List Marking. J. Parallel Distributed Comput. 51(2): 75-88 (1998) - [j15]Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt:
TED Models for ATM Internetworks. SIGMETRICS Perform. Evaluation Rev. 25(4): 12-21 (1998) - 1997
- [j14]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
- [j13]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. J. ACM 43(2): 293-330 (1996) - [j12]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 Distributed Comput. 33(1): 55-68 (1996) - [j11]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) - 1995
- [j10]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Salvage-Embeddings of Complete Trees. SIAM J. Discret. Math. 8(4): 617-637 (1995) - 1993
- [j9]Sandeep N. Bhatt, Jin-yi Cai:
Taking Random Walks to Grow Trees in Hypercubes. J. ACM 40(3): 741-764 (1993) - [j8]Sandeep N. Bhatt, Marina C. Chen, James R. Cowie, Cheng-Yee Lin, Pangfeng Liu:
Object-Oriented Support for Adaptive Methods on Paranel Machines. Sci. Program. 2(4): 179-192 (1993) - [j7]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) - 1992
- [j6]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
- [j5]Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg:
Partitioning Circuits for Improved Testability. Algorithmica 6(1): 37-48 (1991) - [j4]David S. Greenberg, Sandeep N. Bhatt:
Routing Multiple Paths in Hypercubes. Math. Syst. Theory 24(4): 295-321 (1991) - 1989
- [j3]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Discret. Math. 2(2): 145-155 (1989) - 1987
- [j2]Sandeep N. Bhatt, Stavros S. Cosmadakis:
The Complexity of Minimizing Wire Lengths in VLSI Layouts. Inf. Process. Lett. 25(4): 263-267 (1987) - 1984
- [j1]Sandeep N. Bhatt, Frank Thomson Leighton:
A Framework for Solving VLSI Graph Layout Problems. J. Comput. Syst. Sci. 28(2): 300-343 (1984)
Conference and Workshop Papers
- 2012
- [c24]Sathya Chandran Sundaramurthy, Sandeep N. Bhatt, Marc R. Eisenbarth:
Examining intrusion prevention system events from worldwide networks. BADGERS@CCS 2012: 5-12 - 2011
- [c23]Sandeep N. Bhatt, William G. Horne, Prasad Rao:
On Computing Enterprise IT Risk Metrics. SEC 2011: 271-280 - 2009
- [c22]Sruthi Bandhakavi, Sandeep N. Bhatt, Cat Okita, Prasad Rao:
Analyzing end-to-end network reachability. Integrated Network Management 2009: 585-590 - 2008
- [c21]Sandeep N. Bhatt, Cat Okita, Prasad Rao:
Fast, Cheap, and in Control: Towards Pain-Free Security! LISA 2008: 75-90 - 2003
- [c20]Sandeep N. Bhatt, S. Raj Rajagopalan, Prasad Rao:
Federated Security Management for Dynamic Coalitions. DISCEX (2) 2003: 47-48 - 2000
- [c19]William 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 - [c18]Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar:
Traversing Directed Eulerian Mazes. WG 2000: 35-46 - 1999
- [c17]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci:
Area-Universal Circuits with Constant Slowdown. ARVLSI 1999: 89-98 - [c16]Alexander V. Konstantinou, Yechiam Yemini, Sandeep N. Bhatt, Sivaramakrishnan Rajagopalan:
Managing Security in Dynamic Networks. LISA 1999: 109-122 - [c15]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. SIROCCO 1999: 1-16 - 1997
- [c14]Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt:
A Virtual PNNI Network Testbed. WSC 1997: 1057-1064 - 1995
- [c13]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242 - 1994
- [c12]Sandeep 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 - [c11]Pangfeng Liu, Sandeep N. Bhatt:
Experiences with Parallel N-Body Simulation. SPAA 1994: 122-131 - 1993
- [c10]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). ESA 1993: 49-60 - [c9]Pangfeng Liu, William Aiello, Sandeep N. Bhatt:
An Atomic Model for Message-Passing. SPAA 1993: 154-163 - 1992
- [c8]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Tolerating Faults in Synchronization Networks. CONPAR 1992: 1-12 - 1991
- [c7]Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu:
Tight Bounds for On-Line Tree Embeddings. SODA 1991: 344-350 - 1990
- [c6]David S. Greenberg, Sandeep N. Bhatt:
Routing Multiple Paths in Hypercubes. SPAA 1990: 45-54 - 1988
- [c5]Sandeep N. Bhatt, Jin-yi Cai:
Take a Walk, Grow a Tree (Preliminary Version). FOCS 1988: 469-478 - [c4]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 - 1986
- [c3]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Optimal Simulations of Tree Machines (Preliminary Version). FOCS 1986: 274-282 - 1983
- [c2]Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton:
An Approximation Algorithm for Manhattan Routing (Extended Abstract). STOC 1983: 477-486 - 1982
- [c1]Sandeep N. Bhatt, Charles E. Leiserson:
How to Assemble Tree Machines (Extended Abstract). STOC 1982: 77-84
Editorship
- 1994
- [e1]Sandeep Nautam Bhatt:
Parallel Algorithms, Proceedings of a DIMACS Workshop, Brunswick, New Jersey, USA, October 17-18, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 30, DIMACS/AMS 1994, ISBN 978-0-8218-0447-6 [contents]
Coauthor Index
aka: Fan R. K. Chung
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
