Keren Censor-Hillel
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
60
Venues
9
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
60 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Witness-Sensitive Detection of Induced Diamonds. | Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams, Nathan Wallheimer |
| 2026 | PODC | Distributed Stochastic Graph Algorithms. | Keren Censor-Hillel, Aditi Dudeja, George Giakkoupis |
| 2025 | OPODIS | Computing in a Faulty Congested Clique. | Keren Censor-Hillel, Pedro Soto |
| 2025 | STOC | 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 |
| 2025 | SPAA | Bounded Memory in Distributed Networks. | Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang, Wenchen Han, Dean Leitersdorf, Gregory Schwartzman |
| 2025 | SIROCCO | When MIS and Maximal Matching are Easy in the Congested Clique. | Keren Censor-Hillel, Tomer Even, Maxime Flin, Magns M. Halldrsson |
| 2024 | ICALP | Fast Approximate Counting of Cycles. | Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams |
| 2024 | OPODIS | Near-Optimal Resilient Labeling Schemes. | Keren Censor-Hillel, Einav Huberman |
| 2024 | SIROCCO | On Distributed Computation of the Minimum Triangle Edge Transversal. | Keren Censor-Hillel, Majd Khoury |
| 2024 | SIROCCO | Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. | Keren Censor-Hillel, Yuka Machino, Pedro Soto |
| 2022 | PODC | 2022 Principles of Distributed Computing Doctoral Dissertation Award. | Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld |
| 2022 | PODC | Distributed Computations in Fully-Defective Networks. | Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela |
| 2022 | PODC | Deterministic Near-Optimal Distributed Listing of Cliques. | Keren Censor-Hillel, Dean Leitersdorf, David Vulakh |
| 2021 | ICALP | Distributed Subgraph Finding: Progress and Challenges (Invited Talk). | Keren Censor-Hillel |
| 2021 | ICALP | Fault Tolerant Max-Cut. | Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan |
| 2021 | PODC | 2021 Edsger W. Dijkstra Prize in Distributed Computing. | Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2021 | SODA | Tight Distributed Listing of Cliques. | Keren Censor-Hillel, Yi-Jun Chang, Franois Le Gall, Dean Leitersdorf |
| 2021 | STACS | Distance Computations in the Hybrid Network Model via Oracle Simulations. | Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
| 2021 | SPAA | Finding Subgraphs in Highly Dynamic Networks. | Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman |
| 2021 | SPAA | On Sparsity Awareness in Distributed Computations. | Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
| 2021 | SIROCCO | Near-Optimal Scheduling in the Congested Clique. | Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin |
| 2020 | OPODIS | Distributed Distance Approximation. | Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams |
| 2020 | OPODIS | Fast Deterministic Algorithms for Highly-Dynamic Networks. | Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman |
| 2020 | PODC | Distributed Approximation on Power Graphs. | Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju |
| 2020 | PODC | On Distributed Listing of Cliques. | Keren Censor-Hillel, Franois Le Gall, Dean Leitersdorf |
| 2019 | ICALP | Distributed Detection of Cliques in Dynamic Networks. | Matthias Bonne, Keren Censor-Hillel |
| 2019 | ICALP | Distributed Reconfiguration of Maximal Independent Sets. | Keren Censor-Hillel, Mikal Rabie |
| 2019 | OPODIS | Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract). | Keren Censor-Hillel |
| 2019 | PODC | Hardness of Distributed Optimization. | Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz |
| 2019 | PODC | Fast Approximate Shortest Paths in the Congested Clique. | Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf |
| 2018 | OPODIS | Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. | Keren Censor-Hillel, Dean Leitersdorf, Elia Turner |
| 2018 | OPODIS | The Sparsest Additive Spanner via Multiple Weighted BFS Trees. | Keren Censor-Hillel, Ami Paz, Noam Ravid |
| 2018 | PODC | Barriers due to Congestion and Two Ways to Deal With Them. | Keren Censor-Hillel |
| 2018 | PODC | Distributed Spanner Approximation. | Keren Censor-Hillel, Michal Dory |
| 2017 | Algosensors | Fast Distributed Approximation for Max-Cut. | Keren Censor-Hillel, Rina Levy, Hadas Shachnai |
| 2017 | OPODIS | Fast Distributed Approximation for TAP and 2-Edge-Connectivity. | Keren Censor-Hillel, Michal Dory |
| 2017 | PODC | Distributed Approximation of Maximum Independent Set and Maximum Matching. | Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman |
| 2017 | PODC | Brief Announcement: Distributed Approximation for Tree Augmentation. | Keren Censor-Hillel, Michal Dory |
| 2017 | PODC | Broadcasting in Noisy Radio Networks. | Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic |
| 2017 | SIROCCO | Approximate Proof-Labeling Schemes. | Keren Censor-Hillel, Ami Paz, Mor Perry |
| 2016 | PODC | A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. | Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman |
| 2016 | PODC | Optimal Dynamic Distributed MIS. | Keren Censor-Hillel, Elad Haramaty, Zohar S. Karnin |
| 2016 | SIROCCO | Concurrent Use of Write-Once Memory. | James Aspnes, Keren Censor-Hillel, Eitan Yaakobi |
| 2015 | PODC | Algebraic Methods in the Congested Clique. | Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela |
| 2015 | PODC | Help! | Keren Censor-Hillel, Erez Petrank, Shahar Timnat |
| 2015 | SODA | Tight Bounds on Vertex Connectivity Under Vertex Sampling. | Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn |
| 2015 | SIROCCO | On Fast and Robust Information Spreading in the Vertex-Congest Model. | Keren Censor-Hillel, Tariq Toukan |
| 2014 | PODC | Brief announcement: are lock-free concurrent algorithms practically wait-free? | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
| 2014 | PODC | Distributed connectivity decomposition. | Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn |
| 2014 | SODA | A New Perspective on Vertex Connectivity. | Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn |
| 2014 | STOC | Are lock-free concurrent algorithms practically wait-free? | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
| 2012 | PODC | Faster than optimal snapshots (for a while): preliminary version. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen |
| 2012 | STOC | 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 |
| 2012 | SPAA | Lower bounds for restricted-use objects: extended abstract. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler |
| 2011 | PODC | Optimal-time adaptive strong renaming, with applications to counting. | Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam |
| 2011 | PODC | Order optimal information spreading using algebraic gossip. | Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker |
| 2011 | PODC | Structuring unreliable radio networks. | Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport |
| 2011 | SODA | Fast Information Spreading in Graphs with Large Weak Conductance. | Keren Censor-Hillel, Hadas Shachnai |
| 2010 | PODC | Partial information spreading with application to distributed maximum coverage. | Keren Censor-Hillel, Hadas Shachnai |
| 2010 | SPAA | Multi-sided shared coins and randomized set-agreement. | Keren Censor-Hillel |