Keren Censor-Hillel

ORCID

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 122

Top Venues

Publications

Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela
Distributed computations in fully-defective networks. Distributed Comput. 36 (4) (2023)
Keren Censor-Hillel, Yuka Machino, Pedro Soto
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. CoRR (2023)
Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela
Correction to: Distributed computations in fully-defective networks. Distributed Comput. 36 (4) (2023)
Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
Quantum Distributed Algorithms for Detection of Cliques. CoRR (2022)
Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC (2022)
Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela
Distributed Computations in Fully-Defective Networks. PODC (2022)
Keren Censor-Hillel
Distributed Subgraph Finding: Progress and Challenges. CoRR (2022)
Keren Censor-Hillel, Dean Leitersdorf, David Vulakh
Deterministic Near-Optimal Distributed Listing of Cliques. CoRR (2022)
Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela
Distributed Computations in Fully-Defective Networks. CoRR (2022)
Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan
Distributed Vertex Cover Reconfiguration. ITCS (2022)
Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
Quantum Distributed Algorithms for Detection of Cliques. ITCS (2022)
Keren Censor-Hillel, Dean Leitersdorf, David Vulakh
Deterministic Near-Optimal Distributed Listing of Cliques. PODC (2022)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
On Sparsity Awareness in Distributed Computations. CoRR (2021)
Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin
Near-Optimal Scheduling in the Congested Clique. SIROCCO (2021)
Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela
Locally Checkable Labelings with Small Messages. CoRR (2021)
Keren Censor-Hillel, Michal Dory
Distributed Spanner Approximation. SIAM J. Comput. 50 (3) (2021)
Keren Censor-Hillel
Distributed Subgraph Finding: Progress and Challenges (Invited Talk). ICALP (2021)
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. CoRR (2021)
Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan
Fault Tolerant Max-Cut. CoRR (2021)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast approximate shortest paths in the congested clique. Distributed Comput. 34 (6) (2021)
Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman
Finding Subgraphs in Highly Dynamic Networks. SPAA (2021)
Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan
Distributed Vertex Cover Reconfiguration. CoRR (2021)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
On Sparsity Awareness in Distributed Computations. SPAA (2021)
Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC (2021)
Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela
Locally Checkable Labelings with Small Messages. DISC (2021)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
Smaller Cuts, Higher Lower Bounds. ACM Trans. Algorithms 17 (4) (2021)
Alexandr Andoni, Keren Censor-Hillel, Jing Chen, Debmalya Panigrahi
Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016). SIAM J. Comput. 50 (3) (2021)
Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan
Fault Tolerant Max-Cut. ICALP (2021)
Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin
Near-Optimal Scheduling in the Congested Clique. CoRR (2021)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
Distance Computations in the Hybrid Network Model via Oracle Simulations. STACS (2021)
Keren Censor-Hillel
2021 Edsger W. Dijkstra Prize in Distributed Computing. Bull. EATCS 134 (2021)
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Tight Distributed Listing of Cliques. SODA (2021)
Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33 (3-4) (2020)
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC (2020)
Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju
Distributed Approximation on Power Graphs. PODC (2020)
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Sparse matrix multiplication and triangle listing in the Congested Clique model. Theor. Comput. Sci. 809 (2020)
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams
Distributed Distance Approximation. OPODIS (2020)
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams
Distributed Distance Approximation. CoRR (2020)
Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
On Distributed Listing of Cliques. PODC (2020)
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Tight Distributed Listing of Cliques. CoRR (2020)
Keren Censor-Hillel, Ami Paz, Mor Perry
Approximate proof-labeling schemes. Theor. Comput. Sci. 811 (2020)
Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman
Finding Subgraphs in Highly Dynamic Networks. CoRR (2020)
Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju
Distributed Approximation on Power Graphs. CoRR (2020)
Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin
Distance Computations in the Hybrid Network Model via Oracle Simulations. CoRR (2020)
Keren Censor-Hillel, Mikaël Rabie
Distributed reconfiguration of maximal independent sets. J. Comput. Syst. Sci. 112 (2020)
Keren Censor-Hillel, Michal Dory
Fast distributed approximation for TAP and 2-edge-connectivity. Distributed Comput. 33 (2) (2020)
Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
On Distributed Listing of Cliques. CoRR (2020)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
Fooling views: a new lower bound technique for distributed computations under congestion. Distributed Comput. 33 (6) (2020)
Keren Censor-Hillel, Ami Paz, Noam Ravid
The sparsest additive spanner via multiple weighted BFS trees. Theor. Comput. Sci. 840 (2020)
Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman
Fast Deterministic Algorithms for Highly-Dynamic Networks. OPODIS (2020)
Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler
Making asynchronous distributed computations robust to noise. Distributed Comput. 32 (5) (2019)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic methods in the congested clique. Distributed Comput. 32 (6) (2019)
Keren Censor-Hillel, Mikaël Rabie
Distributed Reconfiguration of Maximal Independent Sets. ICALP (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. PODC (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. PODC (2019)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz
Smaller Cuts, Higher Lower Bounds. CoRR (2019)
Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. CoRR (2019)
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Erasure Correction for Noisy Radio Networks. DISC (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. CoRR (2019)
Keren Censor-Hillel
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract). OPODIS (2019)
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast distributed algorithms for testing graph properties. Distributed Comput. 32 (1) (2019)
Matthias Bonne, Keren Censor-Hillel
Distributed Detection of Cliques in Dynamic Networks. ICALP (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. CoRR (2019)
Matthias Bonne, Keren Censor-Hillel
Distributed Detection of Cliques in Dynamic Networks. CoRR (2019)
Keren Censor-Hillel, Tariq Toukan
On fast and robust information spreading in the Vertex-Congest model. Theor. Comput. Sci. 751 (2018)
James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
Concurrent use of write-once memory. J. Parallel Distributed Comput. 113 (2018)
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. OPODIS (2018)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed construction of purely additive spanners. Distributed Comput. 31 (3) (2018)
Keren Censor-Hillel, Mikaël Rabie
Distributed Reconfiguration of Maximal Independent Sets. CoRR (2018)
Keren Censor-Hillel
Barriers due to Congestion and Two Ways to Deal With Them. PODC (2018)
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Erasure Correction for Noisy Radio Networks. CoRR (2018)
Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler
Making Asynchronous Distributed Computations Robust to Channel Noise. ITCS (2018)
Keren Censor-Hillel, Ami Paz, Noam Ravid
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. OPODIS (2018)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65 (6) (2018)
Keren Censor-Hillel, Ami Paz, Noam Ravid
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. CoRR (2018)
Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication. CoRR (2018)
Keren Censor-Hillel, Michal Dory
Distributed Spanner Approximation. CoRR (2018)
Keren Censor-Hillel, Michal Dory
Distributed Spanner Approximation. PODC (2018)
Keren Censor-Hillel, Seri Khoury, Ami Paz
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DISC (2017)
Keren Censor-Hillel, Michal Dory
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. OPODIS (2017)
Keren Censor-Hillel, Michal Dory
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. CoRR (2017)
Keren Censor-Hillel, Seri Khoury, Ami Paz
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. CoRR (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR (2017)
Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler
Making Asynchronous Distributed Computations Robust to Noise. CoRR (2017)
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Broadcasting in Noisy Radio Networks. PODC (2017)
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Broadcasting in Noisy Radio Networks. CoRR (2017)
Keren Censor-Hillel, Michal Dory
Brief Announcement: Distributed Approximation for Tree Augmentation. PODC (2017)
Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13 (2) (2017)
Keren Censor-Hillel, Rina Levy, Hadas Shachnai
Fast Distributed Approximation for Max-Cut. ALGOSENSORS (2017)
Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. DISC (2017)
Keren Censor-Hillel, Ami Paz, Mor Perry
Approximate Proof-Labeling Schemes. SIROCCO (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC (2017)
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR (2017)
Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov
Rumor Spreading with No Dependence on Conductance. SIAM J. Comput. 46 (1) (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. J. ACM 64 (3) (2017)
Keren Censor-Hillel, Rina Levy, Hadas Shachnai
Fast Distributed Approximation for Max-Cut. CoRR (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. PODC (2016)
Amir Abboud, Keren Censor-Hillel, Seri Khoury
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. CoRR (2016)
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast Distributed Algorithms for Testing Graph Properties. CoRR (2016)
Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. CoRR (2016)

Keren Censor-Hillel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Keren Censor-Hillel