| Publication | Date of Publication | Type |
|---|
Faster leader election via mobile agents and its applications
Theoretical Computer Science | 2025-12-05 | Paper |
Near-optimal dispersion on arbitrary anonymous graphs
(available as arXiv preprint) | 2024-04-15 | Paper |
| Fast dispersion of mobile robots on arbitrary graphs | 2024-04-05 | Paper |
Flexible scheduling of transactional memory on trees
Theoretical Computer Science | 2023-10-12 | Paper |
On fast pattern formation by autonomous robots
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Load balanced distributed directories
Lecture Notes in Computer Science | 2023-08-02 | Paper |
An adaptive logging framework for persistent memories
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Flexible scheduling of transactional memory on trees
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Blockchain in dynamic networks
Lecture Notes in Computer Science | 2023-06-12 | Paper |
| Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots | 2023-03-21 | Paper |
| Brief Announcement: Byzantine Geoconsensus | 2023-03-21 | Paper |
| Dispersion of mobile robots on directed anonymous graphs | 2022-11-11 | Paper |
Universally optimal gathering under limited visibility
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Constant-time complete visibility for asynchronous robots with lights
Lecture Notes in Computer Science | 2022-11-04 | Paper |
On fast pattern formation by autonomous robots
Information and Computation | 2022-05-17 | Paper |
Load balanced distributed directories
Information and Computation | 2022-05-17 | Paper |
Dynamic scheduling in distributed transactional memory
Distributed Computing | 2022-04-01 | Paper |
Time-communication impossibility results for distributed transactional memory
Distributed Computing | 2022-02-15 | Paper |
Fast scheduling in distributed transactional memory
Theory of Computing Systems | 2021-06-24 | Paper |
Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
Theoretical Computer Science | 2020-12-16 | Paper |
| Dispersion of mobile robots on grids | 2020-07-22 | Paper |
| Complete visibility for robots with lights in \(\mathrm{O}(1)\) time | 2019-11-22 | Paper |
Optimal nearest neighbor queries in sensor networks
Algorithms for Sensor Systems | 2018-10-17 | Paper |
Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
The bursty Steiner tree problem
International Journal of Foundations of Computer Science | 2018-05-14 | Paper |
Distributed queuing in dynamic networks
Parallel Processing Letters | 2017-12-15 | Paper |
Impossibility results for distributed transactional memory
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Efficient transformations for Klee's measure problem in the streaming model
Computational Geometry | 2016-01-15 | Paper |
Optimal nearest neighbor queries in sensor networks
Theoretical Computer Science | 2015-12-11 | Paper |
An analysis framework for distributed hierarchical directories
Algorithmica | 2015-05-26 | Paper |
Distributed transactional memory for general networks
Distributed Computing | 2015-02-23 | Paper |
Window-based greedy contention management for transactional memory: theory and practice
Distributed Computing | 2013-02-04 | Paper |
A competitive analysis for balanced transactional memory workloads
Algorithmica | 2012-04-26 | Paper |
Window-based greedy contention management for transactional memory
Lecture Notes in Computer Science | 2010-09-10 | Paper |
