1. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2. Amir Abboud , Keren Censor-Hillel , and Seri Khoury . 2016 . Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In Distributed Computing - 30th International Symposium , DISC 2016, Paris, France, September 27--29, 2016. Proceedings (Lecture Notes in Computer Science , Vol. 9888), Cyril Gavoille and David Ilcinkas (Eds.). Springer, 29-- 42 . https://doi.org/10.1007/ 978--3--662--53426--7_3 Amir Abboud, Keren Censor-Hillel, and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27--29, 2016. Proceedings (Lecture Notes in Computer Science, Vol. 9888), Cyril Gavoille and David Ilcinkas (Eds.). Springer, 29--42. https://doi.org/10.1007/ 978--3--662--53426--7_3
3. Bertie Ancona , Keren Censor-Hillel , Mina Dalirrooyfard , Yuval Efron , and Virginia Vassilevska Williams . 2020 . Distributed Distance Approximation. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14--16, 2020, Strasbourg, France (Virtual Conference) (LIPIcs , Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl - Leibniz- Zentrum für Informatik, 30:1--30: 17 . https://doi.org/10.4230/LIPIcs.OPODIS.2020. 30 10.4230/LIPIcs.OPODIS.2020 Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Williams. 2020. Distributed Distance Approximation. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14--16, 2020, Strasbourg, France (Virtual Conference) (LIPIcs, Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl - Leibniz- Zentrum für Informatik, 30:1--30:17. https://doi.org/10.4230/LIPIcs.OPODIS.2020. 30
4. Fast quantum byzantine agreement
5. Time/Space Trade-Offs for Reversible Computation