The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. - Keren Censor; Tuvi Etzion (IEEE Trans. Inf. Theory, 2006)

Randomized consensus in expected O(n log n) individual work. - James Aspnes; Hagit Attiya; Keren Censor (PODC, 2008)

Tight bounds for asynchronous randomized consensus. - Hagit Attiya; Keren Censor (J. ACM, 2008)

Max registers, counters, and monotone circuits. - James Aspnes; Hagit Attiya; Keren Censor (PODC, 2009)

A review of PODC 2009. - Keren Censor; Christoph Lenzen 001 (SIGACT News, 2009)

Partial information spreading with application to distributed maximum coverage. - Keren Censor-Hillel; Hadas Shachnai (PODC, 2010)

Multi-sided shared coins and randomized set-agreement. - Keren Censor-Hillel (SPAA, 2010)

Combining shared-coin algorithms. - James Aspnes; Hagit Attiya; Keren Censor (J. Parallel Distributed Comput., 2010)

Lower Bounds for Randomized Consensus under a Weak Adversary. - Hagit Attiya; Keren Censor-Hillel (SIAM J. Comput., 2010)

Approximate shared-memory counting despite a strong adversary. - James Aspnes; Keren Censor (ACM Trans. Algorithms, 2010)

Probabilistic methods in distributed computing. - Keren Censor-Hillel (2010)

Optimal-time adaptive strong renaming, with applications to counting. - Dan Alistarh; James Aspnes; Keren Censor-Hillel; Seth Gilbert; Morteza Zadimoghaddam (PODC, 2011)

Faster than optimal snapshots (for a while): preliminary version. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Faith Ellen (PODC, 2012)

Lower bounds for restricted-use objects: extended abstract. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Danny Hendler (SPAA, 2012)

Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. - Keren Censor-Hillel; Bernhard Haeupler; Jonathan A. Kelner; Petar Maymounkov (STOC, 2012)

Bounded-Contention Coding for Wireless Networks in the High SNR Regime. - Keren Censor-Hillel; Bernhard Haeupler; Nancy A. Lynch; Muriel Médard (DISC, 2012)

Polylogarithmic concurrent data structures from monotone circuits. - James Aspnes; Hagit Attiya; Keren Censor-Hillel (J. ACM, 2012)

Fast Information Spreading in Graphs with Large Weak Conductance. - Keren Censor-Hillel; Hadas Shachnai (SIAM J. Comput., 2012)

Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. - James Aspnes; Keren Censor-Hillel (DISC, 2013)

Order optimal information spreading using algebraic gossip. - Chen Avin; Michael Borokhovich; Keren Censor-Hillel; Zvi Lotker (Distributed Comput., 2013)

Brief announcement: are lock-free concurrent algorithms practically wait-free? - Dan Alistarh; Keren Censor-Hillel; Nir Shavit (PODC, 2014)

Distributed connectivity decomposition. - Keren Censor-Hillel; Mohsen Ghaffari 001; Fabian Kuhn (PODC, 2014)

A New Perspective on Vertex Connectivity. - Keren Censor-Hillel; Mohsen Ghaffari 001; Fabian Kuhn (SODA, 2014)

Structuring unreliable radio networks. - Keren Censor-Hillel; Seth Gilbert; Fabian Kuhn; Nancy A. Lynch; Calvin C. Newport (Distributed Comput., 2014)

Tight Bounds for Asynchronous Renaming. - Dan Alistarh; James Aspnes; Keren Censor-Hillel; Seth Gilbert; Rachid Guerraoui (J. ACM, 2014)

Help! - Keren Censor-Hillel; Erez Petrank; Shahar Timnat (PODC, 2015)

Tight Bounds on Vertex Connectivity Under Vertex Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (SODA, 2015)

Computing in Additive Networks with Bounded-Information Codes. - Keren Censor-Hillel; Erez Kantor; Nancy A. Lynch; Merav Parter (DISC, 2015)

Bounded-Contention Coding for the additive network model. - Keren Censor-Hillel; Bernhard Haeupler; Nancy A. Lynch; Muriel Médard (Distributed Comput., 2015)

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Faith Ellen (J. ACM, 2015)

Distributed Algorithms as Combinatorial Structures. - Keren Censor-Hillel (SIGACT News, 2015)

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. - Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman (PODC, 2016)

Optimal Dynamic Distributed MIS. - Keren Censor-Hillel; Elad Haramaty; Zohar S. Karnin (PODC, 2016)

Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. - Amir Abboud; Keren Censor-Hillel; Seri Khoury (DISC, 2016)

The one-out-of-k retrieval problem and linear network coding. - Giuseppe Bianchi 001; Lorenzo Bracciale; Keren Censor-Hillel; Andrea Lincoln; Muriel Médard (Adv. Math. Commun., 2016)

A Distributed $(2+ε)$-Approximation for Vertex Cover in $O( logΔ/ε log logΔ)$ Rounds. - Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman (CoRR, 2016)

Are Lock-Free Concurrent Algorithms Practically Wait-Free? - Dan Alistarh; Keren Censor-Hillel; Nir Shavit (J. ACM, 2016)

Lower Bounds for Restricted-Use Objects. - James Aspnes; Keren Censor-Hillel; Hagit Attiya; Danny Hendler (SIAM J. Comput., 2016)

Fast Distributed Approximation for Max-Cut. - Keren Censor-Hillel; Rina Levy; Hadas Shachnai (ALGOSENSORS, 2017)

Distributed Approximation of Maximum Independent Set and Maximum Matching. - Reuven Bar-Yehuda; Keren Censor-Hillel; Mohsen Ghaffari 001; Gregory Schwartzman (PODC, 2017)

Brief Announcement: Distributed Approximation for Tree Augmentation. - Keren Censor-Hillel; Michal Dory (PODC, 2017)

Broadcasting in Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (PODC, 2017)

Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. - Keren Censor-Hillel; Seri Khoury; Ami Paz (DISC, 2017)

A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. - Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman (J. ACM, 2017)

Rumor Spreading with No Dependence on Conductance. - Keren Censor-Hillel; Bernhard Haeupler; Jonathan A. Kelner; Petar Maymounkov (SIAM J. Comput., 2017)

Tight Bounds on Vertex Connectivity Under Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (ACM Trans. Algorithms, 2017)

Making Asynchronous Distributed Computations Robust to Channel Noise. - Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler (ITCS, 2018)

Barriers due to Congestion and Two Ways to Deal With Them. - Keren Censor-Hillel (PODC, 2018)

Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication. - Keren Censor-Hillel; Dean Leitersdorf; Elia Turner (CoRR, 2018)

Distributed construction of purely additive spanners. - Keren Censor-Hillel; Telikepalli Kavitha; Ami Paz; Amir Yehudayoff (Distributed Comput., 2018)

Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Faith Ellen (J. ACM, 2018)

Concurrent use of write-once memory. - James Aspnes; Keren Censor-Hillel; Eitan Yaakobi (J. Parallel Distributed Comput., 2018)

On fast and robust information spreading in the Vertex-Congest model. - Keren Censor-Hillel; Tariq Toukan (Theor. Comput. Sci., 2018)

Distributed Detection of Cliques in Dynamic Networks. - Matthias Bonne; Keren Censor-Hillel (ICALP, 2019)

Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract). - Keren Censor-Hillel (OPODIS, 2019)

Hardness of Distributed Optimization. - Nir Bachrach; Keren Censor-Hillel; Michal Dory; Yuval Efron; Dean Leitersdorf; Ami Paz (PODC, 2019)

Erasure Correction for Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (DISC, 2019)

Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. - Keren Censor-Hillel; Neta Dafni; Victor I. Kolobov; Ami Paz; Gregory Schwartzman (CoRR, 2019)

Fast distributed algorithms for testing graph properties. - Keren Censor-Hillel; Eldar Fischer; Gregory Schwartzman; Yadu Vasudev (Distributed Comput., 2019)

Making asynchronous distributed computations robust to noise. - Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler (Distributed Comput., 2019)

Algebraic methods in the congested clique. - Keren Censor-Hillel; Petteri Kaski; Janne H. Korhonen; Christoph Lenzen 001; Ami Paz; Jukka Suomela (Distributed Comput., 2019)

Distributed Distance Approximation. - Bertie Ancona; Keren Censor-Hillel; Mina Dalirrooyfard; Yuval Efron; Virginia Vassilevska Williams (OPODIS, 2020)

Fast Deterministic Algorithms for Highly-Dynamic Networks. - Keren Censor-Hillel; Neta Dafni; Victor I. Kolobov; Ami Paz; Gregory Schwartzman (OPODIS, 2020)

Distributed Approximation on Power Graphs. - Reuven Bar-Yehuda; Keren Censor-Hillel; Yannic Maus; Shreyas Pai; Sriram V. Pemmaraju (PODC, 2020)

On Distributed Listing of Cliques. - Keren Censor-Hillel; François Le Gall; Dean Leitersdorf (PODC, 2020)

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. - Keren Censor-Hillel; Orr Fischer; Tzlil Gonen; François Le Gall; Dean Leitersdorf; Rotem Oshman (DISC, 2020)

Fooling views: a new lower bound technique for distributed computations under congestion. - Amir Abboud; Keren Censor-Hillel; Seri Khoury; Christoph Lenzen 001 (Distributed Comput., 2020)

Fast distributed approximation for TAP and 2-edge-connectivity. - Keren Censor-Hillel; Michal Dory (Distributed Comput., 2020)

Derandomizing local distributed algorithms under bandwidth restrictions. - Keren Censor-Hillel; Merav Parter; Gregory Schwartzman (Distributed Comput., 2020)

Distributed reconfiguration of maximal independent sets. - Keren Censor-Hillel; Mikaël Rabie (J. Comput. Syst. Sci., 2020)

Sparse matrix multiplication and triangle listing in the Congested Clique model. - Keren Censor-Hillel; Dean Leitersdorf; Elia Turner (Theor. Comput. Sci., 2020)

Approximate proof-labeling schemes. - Keren Censor-Hillel; Ami Paz; Mor Perry (Theor. Comput. Sci., 2020)

The sparsest additive spanner via multiple weighted BFS trees. - Keren Censor-Hillel; Ami Paz; Noam Ravid (Theor. Comput. Sci., 2020)

Distributed Subgraph Finding: Progress and Challenges (Invited Talk). - Keren Censor-Hillel (ICALP, 2021)

Fault Tolerant Max-Cut. - Keren Censor-Hillel; Noa Marelly; Roy Schwartz 002; Tigran Tonoyan (ICALP, 2021)

2021 Edsger W. Dijkstra Prize in Distributed Computing. - Keren Censor-Hillel; Pierre Fraigniaud; Cyril Gavoille; Seth Gilbert; Andrzej Pelc; David Peleg (PODC, 2021)

Near-Optimal Scheduling in the Congested Clique. - Keren Censor-Hillel; Yannic Maus; Volodymyr Polosukhin (SIROCCO, 2021)

Tight Distributed Listing of Cliques. - Keren Censor-Hillel; Yi-Jun Chang; François Le Gall; Dean Leitersdorf (SODA, 2021)

Finding Subgraphs in Highly Dynamic Networks. - Keren Censor-Hillel; Victor I. Kolobov; Gregory Schwartzman (SPAA, 2021)

On Sparsity Awareness in Distributed Computations. - Keren Censor-Hillel; Dean Leitersdorf; Volodymyr Polosukhin (SPAA, 2021)

Distance Computations in the Hybrid Network Model via Oracle Simulations. - Keren Censor-Hillel; Dean Leitersdorf; Volodymyr Polosukhin (STACS, 2021)

Locally Checkable Labelings with Small Messages. - Alkida Balliu; Keren Censor-Hillel; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2021)

Fast approximate shortest paths in the congested clique. - Keren Censor-Hillel; Michal Dory; Janne H. Korhonen; Dean Leitersdorf (Distributed Comput., 2021)

2021 Edsger W. Dijkstra Prize in Distributed Computing. - Keren Censor-Hillel (Bull. EATCS, 2021)

Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016). - Alexandr Andoni; Keren Censor-Hillel; Jing Chen; Debmalya Panigrahi (SIAM J. Comput., 2021)

Distributed Spanner Approximation. - Keren Censor-Hillel; Michal Dory (SIAM J. Comput., 2021)

Smaller Cuts, Higher Lower Bounds. - Amir Abboud; Keren Censor-Hillel; Seri Khoury; Ami Paz (ACM Trans. Algorithms, 2021)

Quantum Distributed Algorithms for Detection of Cliques. - Keren Censor-Hillel; Orr Fischer; François Le Gall; Dean Leitersdorf; Rotem Oshman (ITCS, 2022)

Distributed Vertex Cover Reconfiguration. - Keren Censor-Hillel; Yannic Maus; Shahar Romem Peled; Tigran Tonoyan (ITCS, 2022)

2022 Principles of Distributed Computing Doctoral Dissertation Award. - Yehuda Afek; Keren Censor-Hillel; Pierre Fraigniaud; Seth Gilbert; Gopal Pandurangan; Gadi Taubenfeld (PODC, 2022)

Distributed Subgraph Finding: Progress and Challenges. - Keren Censor-Hillel (CoRR, 2022)

Distributed computations in fully-defective networks. - Keren Censor-Hillel; Shir Cohen; Ran Gelles; Gal Sela 001 (Distributed Comput., 2023)

Correction to: Distributed computations in fully-defective networks. - Keren Censor-Hillel; Shir Cohen; Ran Gelles; Gal Sela 001 (Distributed Comput., 2023)

Fast Approximate Counting of Cycles. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (ICALP, 2024)

Near-Optimal Resilient Labeling Schemes. - Keren Censor-Hillel; Einav Huberman (OPODIS, 2024)

On Distributed Computation of the Minimum Triangle Edge Transversal. - Keren Censor-Hillel; Majd Khoury (SIROCCO, 2024)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. - Keren Censor-Hillel; Yuka Machino; Pedro Soto 001 (SIROCCO, 2024)

Faster Cycle Detection in the Congested Clique. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (DISC, 2024)

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471). - Keren Censor-Hillel; Yasamin Nazari; Eva Rotenberg; Thatchaphol Saranurak; Martín Costa (Dagstuhl Reports, 2024)

Deterministic near-optimal distributed listing of cliques. - Keren Censor-Hillel; Dean Leitersdorf; David Vulakh (Distributed Comput., 2024)

When MIS and Maximal Matching are Easy in the Congested Clique. - Keren Censor-Hillel; Tomer Even; Maxime Flin; Magnús M. Halldórsson (SIROCCO, 2025)

Bounded Memory in Distributed Networks. - Ran Ben Basat; Keren Censor-Hillel; Yi-Jun Chang; Wenchen Han; Dean Leitersdorf; Gregory Schwartzman (SPAA, 2025)

Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate k-Clique Counts Faster. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (STOC, 2025)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate k-clique counts faster. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (CoRR, 2025)

Computing in a Faulty Congested Clique. - Keren Censor-Hillel; Pedro Soto 001 (CoRR, 2025)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique. - Keren Censor-Hillel; Orr Fischer; Ran Gelles; Pedro Soto 001 (CoRR, 2025)