default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnshuman Misra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Anshuman Misra, Ajay D. Kshemkalyani:
Detecting causality in the presence of Byzantine processes: The case of synchronous systems. Inf. Comput. 301: 105212 (2024)- [j1]Anshuman Misra
, Ajay D. Kshemkalyani:
Byzantine-Tolerant Causal Ordering for Unicasts, Multicasts, and Broadcasts. IEEE Trans. Parallel Distributed Syst. 35(5): 814-828 (2024) - [c13]Anshuman Misra, Ajay D. Kshemkalyani:
Towards Stronger Blockchains: Security Against Front-Running Attacks. NETYS 2024: 171-187 - [c12]Anshuman Misra, Ajay D. Kshemkalyani:
Solvability of Byzantine Fault-Tolerant Causal Ordering: Synchronous Systems Case. SAC 2024: 251-256 - [i4]Ajay D. Kshemkalyani, Manaswini Piduguralla, Sathya Peri, Anshuman Misra:
Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers. CoRR abs/2405.19457 (2024) - 2023
- [c11]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault-Tolerant Causal Ordering. ICDCN 2023: 100-109 - [c10]Anshuman Misra, Ajay D. Kshemkalyani:
Brief Announcement: Byzantine-Tolerant Detection of Causality in Synchronous Systems. SSS 2023: 57-61 - [c9]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault-Tolerant Causal Order Satisfying Strong Safety. SSS 2023: 111-125 - [c8]Anshuman Misra, Ajay D. Kshemkalyani:
Detecting Causality in the Presence of Byzantine Processes: The Synchronous Systems Case. TIME 2023: 11:1-11:14 - [i3]Anshuman Misra, Ajay D. Kshemkalyani:
Towards Stronger Blockchains: Security Against Front-Running Attacks. CoRR abs/2311.10253 (2023) - 2022
- [c7]Anshuman Misra, Ajay D. Kshemkalyani:
Causal Ordering in the Presence of Byzantine Processes. ICPADS 2022: 130-138 - [c6]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault-Tolerant Causal Broadcast on Incomplete Graphs. NCA 2022: 63-71 - [c5]Anshuman Misra, Ajay D. Kshemkalyani:
Detecting Causality in the Presence of Byzantine Processes: There is No Holy Grail. NCA 2022: 73-80 - [c4]Anshuman Misra, Ajay D. Kshemkalyani:
Causal Ordering Properties of Byzantine Reliable Broadcast Primitives. NCA 2022: 115-122 - [c3]Anshuman Misra, Ajay D. Kshemkalyani:
Solvability of Byzantine Fault-Tolerant Causal Ordering Problems. NETYS 2022: 87-103 - 2021
- [c2]Anshuman Misra, Ajay D. Kshemkalyani:
The Bloom Clock for Causality Testing. ICDCIT 2021: 3-23 - [i2]Anshuman Misra, Ajay D. Kshemkalyani:
Byzantine Fault Tolerant Causal Ordering. CoRR abs/2112.11337 (2021) - 2020
- [c1]Ajay D. Kshemkalyani, Anshuman Misra:
The Bloom Clock to Characterize Causality in Distributed Systems. NBiS 2020: 269-279 - [i1]Anshuman Misra, Ajay D. Kshemkalyani:
The Bloom Clock for Causality Testing. CoRR abs/2011.11744 (2020)
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-09-22 00:36 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:
