On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning. - Felix Martin Schuhknecht; Pankaj Khanchandani; Jens Dittrich (Proc. VLDB Endow., 2015)

Distributed Stable Matching with Similar Preference Lists. - Pankaj Khanchandani; Roger Wattenhofer (OPODIS, 2016)

Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers. - Pankaj Khanchandani; Roger Wattenhofer (PODC, 2017)

On the Importance of Synchronization Primitives with Low Consensus Numbers. - Pankaj Khanchandani; Roger Wattenhofer (ICDCN, 2018)

Is Compare-and-Swap Really Necessary? - Pankaj Khanchandani; Roger Wattenhofer (CoRR, 2018)

The Arvy Distributed Directory Protocol. - Pankaj Khanchandani; Roger Wattenhofer (SPAA, 2019)

Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. - Pankaj Khanchandani; Christoph Lenzen 001 (Theory Comput. Syst., 2019)

Brief Announcement: Byzantine Agreement with Unknown Participants and Failures. - Pankaj Khanchandani; Roger Wattenhofer (PODC, 2020)

Two Elementary Instructions make Compare-and-Swap. - Pankaj Khanchandani; Roger Wattenhofer (J. Parallel Distributed Comput., 2020)

Robust and Scalable Distributed Ordering: Counting, Queueing and Agreement. - Pankaj Khanchandani (2020)

On Consensus Number 1 Objects. - Pankaj Khanchandani; Jan Schäppi; Ye Wang 017; Roger Wattenhofer (ICPADS, 2021)

Learning Algorithms with Self-Play: A New Approach to the Distributed Directory Problem. - Pankaj Khanchandani; Oliver Richter; Lukas Rusch; Roger Wattenhofer (ICTAI, 2021)

Byzantine Agreement with Unknown Participants and Failures. - Pankaj Khanchandani; Roger Wattenhofer (IPDPS, 2021)