Publications

Editorials:

• Avery Miller, Keren Censor-Hillel, Janne H. Korhonen (Eds.)
  Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC).
  ACM, 2021.
• Keren Censor-Hillel and Michele Flammini (Eds.)
  Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity  (SIROCCO).
  Lecture Notes in Computer Science 11639, Springer 2019.
• Keren Censor-Hillel and Valerie King (Eds.)
  Proceedings of the 9th International Workshop on Foundations of Mobile Computing (FOMC).
  Jerusalem, Israel, October 17-18, 2013. EPTCS 132, 2013.

Conference Publications:

• Keren Censor-Hillel, Majd Khoury.
  On Distributed Computation of the Minimum Triangle Edge TRansversal.
  In Proceedings of the 31st International Colloquium On Structural Information and Communication Complexity (SIROCCO), 2024.
• Keren Censor-Hillel, Yuka Machino, Pedro Soto.
  Near-Optima Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens.
  In Proceedings of the 31st International Colloquium On Structural Information and Communication Complexity (SIROCCO), 2024.
• Keren Censor-Hillel, Dean Leitersdorf, David Vulakh.
  Deterministic Near-Optimal Distributed Listing of Cliques.
  In Proceedings of the 41st ACM Symposium on Principles of Distributed Computing (PODC), 2022.
• Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela.
  Distributed Computations in Fully-Defective Networks.
  In Proceedings of the 41st ACM Symposium on Principles of Distributed Computing (PODC), 2022.
• Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan.
  Distributed Vertex Cover Reconfiguration.
  In Proceedings of Innovations in Theoretical Computer Science (ITCS), 2022.
• Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman.
  Quantum Distributed Algorithms for Detection of Cliques.
  In Proceedings of Innovations in Theoretical Computer Science (ITCS), 2022.
• Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, and Jukka Suomela.
  Locally Checkable Labelings with Small Messages.
  In Proceedings of the 35th International Symposium on Distributed Computing (DISC), 2021.
• Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan.
  Fault Tolerant Max-Cut.In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP), 2021.
• Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman.
  Finding Subgraphs in Highly Dynamic Networks.
  In Proceedings of the 33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021.
• Keren Censor-Hillel, Dean Leitersdorf and Volodymyr Polosukhin.
  On Sparsity Awareness in Distributed Computations.
  In Proceedings of the 33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021.
• Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin.
  Near-Optimal Scheduling in the Congested Clique.
  In Proceedings of the 28th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2021.
• Keren Censor-Hillel, Dean Leitersdorf and Volodymyr Polosukhin.
  Distance Computations in the Hybrid Network Model via Oracle Simulations.
  In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), 2021.
• Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf.
  Tight Distributed Listing of Cliques.
  In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021.
• Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, and Gregory Schwartzman.
  Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks.
  In Proceedings of the 24th Conference on Principles of Distributed Systems (OPODIS), 2020.
• Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Williams.
  Distributed Distance Approximation.
  In Proceedings of the 24th Conference on Principles of Distributed Systems (OPODIS), 2020.
• Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman.
  Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.
  In Proceedings of the 34th International Symposium on Distributed Computing (DISC), 2020.
• Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, and Sriram Pemmaraju.
  Distributed Approximation on Power Graphs.
  In Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), 2020.
• Keren Censor-Hillel, Francois Le Gall, and Dean Leitersdorf.
  On Distributed Listing of Cliques.
  In Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), 2020.
• Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic.
  Erasure Correction for Noisy Radio Networks
  In Proceedings of the 33rd International Symposium on Distributed Computing (DISC), pages 10:1-10:17, 2019.
• Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, and Dean Leitersdorf.
  Fast Approximate Shortest Paths in the Congested Clique.
  In Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC), pages 74-83, 2019.
  Best Student Paper Award.
• Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, and Ami Paz.
  Hardness of Distributed Optimization.
  In Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC), pages 238-247, 2019.
• Keren Censor-Hillel and Mikael Rabie.
  Distributed Reconfiguration of Maximal Independent Sets.
  In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pages 135:1-135:14, 2019.
  Best Paper Award.
• Matthias Bonne and Keren Censor-Hillel.
  Distributed Detection of Cliques in Dynamic Networks.
  In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pages 132:1-132:15, 2019.
• Keren Censor-Hillel, Dean Leitersdorf and Elia Turner.
  Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model.
  In Proceedings of the 22nd International Conference on Principles of Distributed Systems (OPODIS), pages 4:1-4:17, 2018.
  Best Student Paper Award.
• Keren Censor-Hillel, Ami Paz and Noam Ravid.
  The Sparsest Additive Spanner via Multiple Weighted BFS Trees.
  In Proceedings of the 22nd International Conference on Principles of Distributed Systems (OPODIS), pages 7:1-7:16, 2018.
• Keren Censor-Hillel and Michal Dory.
  Distributed Spanner Approximation.
  In Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC), pages 139-148, 2018.
• Keren Censor-Hillel, Ran Gelles and Bernhard Haeupler.
  Making Asynchronous Distributed Computations Robust to Noise. 
  In Proceedings of the 9th Innovations in Theoretical Computer Science Conference (ITCS), pages 50:1-50:20, 2018.
• Keren Censor-Hillel and Michal Dory.
  Fast Distributed Approximation for TAP and 2-Edge Connectivity.
  In OPODIS, pages 21:1-21:20, 2017.
  Best Paper Award.
• Keren Censor-Hillel, Merav Parter and Gregory Schwartzman.
  Derandomizing Local Distributed Algorithms under Bandwidth Restrictions.
  In Proceedings of the 31st International Symposium on Distributed Computing (DISC), pages 11:1-11:16, 2017.
• Keren Censor-Hillel, Seri Khoury and Ami Paz:
  Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model.
  In Proceedings of the 31st International Symposium on Distributed Computing (DISC), pages 10:1-10:16, 2017.
• Keren Censor-Hillel, Rina Levy and Hadas Shachnai.
  Fast Distributed Approximation for Max-Cut.
  In proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2017.
• Keren Censor-Hillel, Ami Paz and Mor Perry.
  Approximate Proof-Labeling Schemes.
  In Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 71-89, 2017.
• Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz and Goran Zuzic.
  Broadcasting in Noisy Radio Networks.
  In Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2017.
• Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari and Gregory Schwartzman. Distributed Approximation of Maximum Independent Set and Maximum Matching.
  In Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC), pages 165-174, 2017.
• James Aspnes, Keren Censor-Hillel and Eitan Yaakobi.
  Concurrent use of write-once memory.
  In Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 127–142, 2016.
• Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz and Amir Yehudayoff.
  Distributed Construction of Purely Additive Spanners.
  In Proceedings of the 30th International Symposium on Distributed Computing (DISC), pages 129-142, 2016.
• Amir Abboud, Keren Censor-Hillel and Seri Khoury.
  Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
  In Proceedings of the 30th International Symposium on Distributed Computing (DISC), pages 29-42, 2016.
  Best Student Paper Award.
• Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman and Yadu Vasudev.
  Fast Distributed Algorithms for Testing Graph Properties.
  In Proceedings of the 30th International Symposium on Distributed Computing (DISC), pages 43-56, 2016.
• Reuven Bar-Yehuda, Keren Censor-Hillel and Gregory Schwartzman.
  A Distributed (2+epsilon)-Approximation for Vertex Cover in O(log Delta/epsilon log log Delta) Rounds..
  In Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC), pages 3–8, 2016.
  Best Student Paper Award.
• Keren Censor-Hillel, Elad Haramaty, and Zohar Karnin.
  Optimal Dynamic Distributed MIS.
  In Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC), pages 217–226, 2016.
• Keren Censor-Hillel, Erez Kantor, Nancy Lynch, Merav Parter.
  Computing in Additive Networks with Bounded-Information Codes.
  In Proceedings of the 29th International Symposium on Distributed Computing (DISC), pages 405-419, 2015.
• Keren Censor-Hillel and Tariq Toukan.
  On Fast and Robust Information Spreading in the Vertex-Congestion Model.
  In 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 270-284, 2015.
• Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz and Jukka Suomela.
  Algebraic Methods in the Congested Clique.
  In Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pages 143-152, 2015.
• Keren Censor-Hillel, Erez Petrank and Shahar Timnat.
  Help!
  In Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pages 241-250, 2015.
  ERRATUM 2021
• Keren Censor-Hillel, George Giakkoupis, Mohsen Ghaffari, Bernhard Haeupler, and Fabian Kuhn.
  Tight Bounds on Vertex Connectivity under Vertex Sampling.
  In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2006–2018, 2015.
• Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, and Muriel Médard.
  The One-out-of-k Retrieval Problem and Linear Network Coding.
  The 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), 2014.
• Keren Censor-Hillel, Mohsen Ghaffari and Fabian Kuhn.
  Distributed Connectivity Decomposition.
  In Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC), pages 156–165, 2014.
  Best Student Paper Award.
• Dan Alistarh, Keren Censor-Hillel, and Nir Shavit.
  Are Lock-Free Concurrent Algorithms Practically Wait-Free?
  In Proceedings of the 46th symposium on Theory of Computing (STOC), pages 714-723, 2014.
  Brief announcement in Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC), pages 50–52, 2014.
• Keren Censor-Hillel, Mohsen Ghaffari and Fabian Kuhn.
  A New Perspective on Vertex Connectivity.
  In Proceedings of the 25th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 546–561, 2014.
• James Aspnes and Keren Censor-Hillel.
  Atomic snapshots in expected O(log³ n) steps using randomized helping.
  In Proceedings of the 27th International Symposium on Distributed Computing (DISC), pages 254–268, 2013.
  ERRATUM 2020
• Keren Censor-Hillel and George Giakkoupis.
  Fast and Robust Information Spreading.
  Unpublished Manuscript.
• Keren Censor-Hillel, Bernhard Haeupler, Nancy Lynch and Muriel Médard.
  Bounded-Contention Coding for Wireless Networks in the High SNR Regime.
  In Proceedings of the 26th International Symposium on Distributed Computing (DISC), pages 91–105 , 2012.
• James Aspnes, Hagit Attiya, Keren Censor-Hillel and Faith Ellen.
  Faster than Optimal Snapshots (for a While).
  In Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC), pages 375–384 , 2012.
• James Aspnes, Hagit Attiya, Keren Censor-Hillel and Danny Hendler.
  Lower Bounds for Restricted-Use Objects.
  In Proceedings of the 24th ACM symposium on Parallelism in algorithms and architectures (SPAA), pages 172–181, 2012.
• Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner and Petar Maymounkov.
  Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance.
  In Proceedings of the 44th symposium on Theory of Computing (STOC), pages 961–970, 2012.
• Chen Avin, Michael Borokhovich, Keren Censor-Hillel and Zvi Lotker.
  Order Optimal Information Spreading Using Algebraic Gossip.
  In Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC), pages 363-372, 2011.
• Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy Lynch and Calvin Newport.
  Structuring Unreliable Radio Networks.
  In Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC), pages 79-88, 2011.
• Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert and Morteza Zadimoghaddam.
  Optimal-Time Adaptive Tight Renaming, with Applications to Counting.
  In Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC), pages 239-248, 2011.
• Keren Censor-Hillel and Hadas Shachnai.
  Fast Information Spreading in Graphs with Large Weak Conductance.
  In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 440-448, 2011.
• Keren Censor Hillel and Hadas Shachnai.
  Partial Information Spreading with Application to Distributed Maximum Coverage.
  In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pages 161-170, 2010.
• Keren Censor Hillel.
  Multi-Sided Shared Coins and Randomized Set-Agreement.
  In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 60-68, 2010.
• James Aspnes, Hagit Attiya and Keren Censor.
  Max Registers, Counters, and Monotone Circuits.
  In Proceedings of the 28th annual ACM Symposium on Principles of Distributed Computing (PODC), pages 36–45, 2009.
  Best Student Paper Award.
• James Aspnes and Keren Censor.
  Approximate Counting Despite a Strong Adversary.
  In Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 441–450, 2009.
• James Aspnes, Hagit Attiya and Keren Censor.
  Randomized Consensus in Expected O(nlogn) Individual Work.
  In Proceedings of the 27th annual ACM Symposium on Principles of Distributed Computing (PODC), pages 325–334, 2008.
• Hagit Attiya and Keren Censor.
  Lower Bounds for Randomized Consensus under a Weak Adversary.
  In Proceedings of the 27th annual ACM Symposium on Principles of Distributed Computing (PODC), pages 315–324, 2008.
• Hagit Attiya and Keren Censor.
  Tight Bounds for Asynchronous Randomized Consensus.
  In Proceedings of the 39th annual ACM Symposium on Theory of computing (STOC), pages 155–164, 2007.
• Keren Censor and Tuvi Etzion.
  The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels.
  IEEE International Symposium on Information Theory (ISIT), Seattle, WA. July 2006.

Journal Publications:

• Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela.
  Distributed Computation in Fully Defective Networks.
  Distributed Comput. 36(4): 501-528 (2023)
  Erratum: Correction to: Distributed Computation in Fully Defective Networks.  Distributed Comput. 36(4): 529 (2023)
• Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf.
  Fast Approximate Shortest Paths in the Congested Clique.
  Distributed Comput. 34(6): 463-487 (2021)
• Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz.
  Smaller Cuts, Higher Lower Bounds.
  ACM Trans. Algorithms 17(4): 30:1-30:40 (2021)
• Keren Censor-Hillel, Michal Dory.
  Distributed Spanner Approximation.
  SIAM J. Comput. (SICOMP) 50(3): 1103-1147 (2021)
• Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen.
  Fooling views: a new lower bound technique for distributed computations under congestion.
  Distributed Computing 33(3-4): 349-366 (2020).
• Keren Censor-Hillel and Mikaël Rabie.
  Distributed reconfiguration of maximal independent sets.
  J. Comput. Syst. Sci. 112: 85-96 (2020).
• Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman.
  Derandomizing local distributed algorithms under bandwidth restrictions.
  Distributed Computing 33(3-4): 349-366 (2020).
• Keren Censor-Hillel and Michal Dory.
  Fast distributed approximation for TAP and 2-edge-connectivity.
  Distributed Computing (DC), 33(2): 145-168 (2020).
• Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner.
  Sparse matrix multiplication and triangle listing in the Congested Clique model.
  Theoretical Computer Science (TCS), 809: 45-60 (2020)
• Keren Censor-Hillel, Ami Paz, Noam Ravid.
  The sparsest additive spanner via multiple weighted BFS trees.
  Theoretical Computer Science (TCS), 840: 33-44 (2020)
• Keren Censor-Hillel, Ami Paz, and Mor Perry.
  Approximate proof-labeling schemes.
  Theoretical Computer Science (TCS), 811: 112-124 (2020)
• Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman and Yadu Vasudev.
  Fast Distributed Algorithms for Testing Graph Properties.
  Distributed Computing (DC), 32(1): 41-57 (2019).
• Keren Censor-Hillel, Ran Gelles, and Bernhard Haeupler.
  Making asynchronous distributed computations robust to noise.
  Distributed Computing (DC), 32(5): 405-421 (2019)
• Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz and Jukka Suomela.
  Algebraic Methods in the Congested Clique.
  Distributed Computing, 32(6): 461-478, 2019.
• Keren Censor-Hillel and Tariq Toukan.
  On Fast and Robust Information Spreading in the Vertex-Congestion Model.
  Theor. Comput. Sci. (TCS) 751: 74-90 (2018).
• Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz and Amir Yehudayoff.
  Distributed Construction of Purely Additive Spanners.
  Distributed Computing 31(3): 223-240 (2018).
• James Aspnes, Keren Censor-Hillel and Eitan Yaakobi.
  Concurrent use of write-once memory.
  J. Parallel Distrib. Comput. 113: 250-260 (2018).
• Reuven Bar-Yehuda, Keren Censor-Hillel and Gregory Schwartzman.
  A Distributed (2+ε)-Approximation for Vertex Cover in O(logΔ/loglogΔ) Rounds.
  Journal of the ACM (JACM), 64(3): 23:1-23:11 (2017).
• Keren Censor-Hillel, George Giakkoupis, Mohsen Ghaffari, Bernhard Haeupler, and Fabian Kuhn.
  Tight Bounds on Vertex Connectivity under Sampling.
  ACM Transactions on Algorithms (TALG), 13(2): 19:1-19:26 (2017).
• Keren Censor-Hillel, Bernhard Haeupler, Jonathan Kelner, and Petar Maymounkov.
  Rumor Spreading with No Dependence on Conductance.
  SIAM Journal on Computing (SICOMP), Volume 46, Issue 1, pages 58-79 , 2017.
• Dan Alistarh, Keren Censor-Hillel, and Nir Shavit.
  Are Lock-Free Concurrent Algorithms Practically Wait-Free?
  Journal of the ACM (JACM), Volume 63, Issue 4, 31:1-31:20, 2016.
• James Aspnes, Hagit Attiya, Keren Censor-Hillel and Danny Hendler.
  Lower Bounds for Restricted-Use Objects.
  SIAM Journal on Computing (SICOMP), 45(3): 734-762, 2016.
• Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, and Muriel Médard.
  The One-out-of-k Retrieval Problem and Linear Network Coding.
  Advances in Mathematics of Communications (AMC), Vol. 10, no. 1, February 2016.
• Keren Censor-Hillel, Bernhard Haeupler, Nancy Lynch and Muriel Médard.
  Bounded-Contention Coding for the additive network model.
  Distributed Computing (DC), Volume 28, Issue 5, pages 297-308, 2015.
• James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen.
  Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.
  Journal of the ACM (JACM), 62(1): 3, 2015.
  Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65(6): 38:1-38:2 (2018)
• Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, and Rachid Guerraoui.
  Tight bounds for asynchronous renaming.
  Journal of the ACM (JACM), Volume 61, Issue 3, February 2014.
• Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy Lynch and Calvin Newport.
  Structuring Unreliable Radio Networks.
  Distributed Computing (DC), Volume 27, Issue 1, pages 1-19, 2014.
• Chen Avin, Michael Borokhovich, Keren Censor-Hillel and Zvi Lotker.
  Order Optimal Information Spreading Using Algebraic Gossip.
  Distributed Computing (DC), Volume 26, Issue 2, pages 99-117, 2013.
• Keren Censor-Hillel and Hadas Shachnai.
  Fast Information Spreading in Graphs with Large Weak Conductance.
  SIAM Journal on Computing (SICOMP), Volume 41, Issue 6, pages 1451-1465, 2012.
• James Aspnes, Hagit Attiya and Keren Censor-Hillel.
  Polylogarithmic Concurrent Data Structures from Monotone Circuits.
  Journal of the ACM (JACM), Volume 59, Issue 1, February 2012.
• Hagit Attiya and Keren Censor.
  Lower Bounds for Randomized Consensus Under a Weak Adversary.
  SIAM Journal of Computing (SICOMP), Volume 39, Issue 8, pp. 3885-3904, December 2010.
• James Aspnes, Hagit Attiya and Keren Censor.
  Combining Shared Coin Algorithms.
  Journal of Parallel and Distributed Computing (JPDC), Volume 70, Issue 3, pp. 317-322, March 2010.
• James Aspnes and Keren Censor.
  Approximate Shared-memory Counting Despite a Strong Adversary.
  ACM Transactions on Algorithms (TALG), SODA 2009 special issue, Volume 6, Issue 2, Article 25, March 2010.
• Hagit Attiya and Keren Censor.
  Tight Bounds for Asynchronous Randomized Consensus.
  Journal of the ACM (JACM), Volume 55, Issue 5, Article 20, October 2008.
• Keren Censor and Tuvi Etzion.
  The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels.
  IEEE Transactions on Information Theory , vol.52, no.11 pp. 5128- 5140, Nov. 2006.

Theses:

• Keren Censor Hillel.
  Probabilistic Methods in Distributed Computing.
  Ph.D. Thesis, Technion, 2010.
• Keren Censor.
  Constrained Codes for Two-Dimensional Channels.
  M.Sc. Thesis, Technion, 2006.

Other Publications:

• Keren Censor-Hillel.
  Distributed Algorithms as Combinatorial Structures.
  SIGACT News 46(1): 63-76, 2015.
• Keren Censor and Christoph Lenzen.
  A review of PODC 2009.
  SIGACT News, Volume 40, No.4, pp. 71-74, 2009.