![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Pankaj Khanchandani
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c10]Pankaj Khanchandani, Jan Schäppi, Ye Wang, Roger Wattenhofer:
On Consensus Number 1 Objects. ICPADS 2021: 875-882 - [c9]Pankaj Khanchandani, Oliver Richter, Lukas Rusch, Roger Wattenhofer:
Learning Algorithms with Self-Play: A New Approach to the Distributed Directory Problem. ICTAI 2021: 501-505 - [c8]Pankaj Khanchandani, Roger Wattenhofer:
Byzantine Agreement with Unknown Participants and Failures. IPDPS 2021: 952-961 - [i3]Pankaj Khanchandani, Roger Wattenhofer:
Byzantine Agreement with Unknown Participants and Failures. CoRR abs/2102.10442 (2021) - 2020
- [b1]Pankaj Khanchandani:
Robust and Scalable Distributed Ordering: Counting, Queueing and Agreement. ETH Zurich, Zürich, Switzerland, 2020 - [j3]Pankaj Khanchandani, Roger Wattenhofer:
Two Elementary Instructions make Compare-and-Swap. J. Parallel Distributed Comput. 145: 176-187 (2020) - [c7]Pankaj Khanchandani, Roger Wattenhofer:
Brief Announcement: Byzantine Agreement with Unknown Participants and Failures. PODC 2020: 178-180
2010 – 2019
- 2019
- [j2]Pankaj Khanchandani, Christoph Lenzen:
Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. Theory Comput. Syst. 63(2): 261-305 (2019) - [c6]Pankaj Khanchandani, Roger Wattenhofer:
Two Elementary Instructions Make Compare-and-Swap. IPDPS 2019: 365-374 - [c5]Pankaj Khanchandani, Roger Wattenhofer:
The Arvy Distributed Directory Protocol. SPAA 2019: 225-235 - 2018
- [c4]Pankaj Khanchandani, Roger Wattenhofer:
On the Importance of Synchronization Primitives with Low Consensus Numbers. ICDCN 2018: 18:1-18:10 - [i2]Pankaj Khanchandani, Roger Wattenhofer:
Is Compare-and-Swap Really Necessary? CoRR abs/1802.03844 (2018) - 2017
- [c3]Pankaj Khanchandani, Roger Wattenhofer:
Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers. PODC 2017: 95-96 - 2016
- [c2]Pankaj Khanchandani, Roger Wattenhofer:
Distributed Stable Matching with Similar Preference Lists. OPODIS 2016: 12:1-12:16 - [c1]Pankaj Khanchandani, Christoph Lenzen:
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. SSS 2016: 213-230 - [i1]Pankaj Khanchandani, Christoph Lenzen:
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. CoRR abs/1609.09281 (2016) - 2015
- [j1]Felix Martin Schuhknecht
, Pankaj Khanchandani, Jens Dittrich:
On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning. Proc. VLDB Endow. 8(9): 934-937 (2015)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint