default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeren Censor-Hillel
Keren Censor
Person information
- affiliation: Technion, Israel
- affiliation (former): MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c75]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Fast Approximate Counting of Cycles. ICALP 2024: 37:1-37:20- [c74]Keren Censor-Hillel, Yuka Machino, Pedro Soto
:
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. SIROCCO 2024: 156-173 - [c73]Keren Censor-Hillel, Majd Khoury:
On Distributed Computation of the Minimum Triangle Edge Transversal. SIROCCO 2024: 336-358 - [c72]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Faster Cycle Detection in the Congested Clique. DISC 2024: 12:1-12:18 - [i52]Keren Censor-Hillel, Majd Khoury:
On Distributed Computation of the Minimum Triangle Edge Transversal. CoRR abs/2402.13985 (2024) - [i51]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Faster Cycle Detection in the Congested Clique. CoRR abs/2408.15132 (2024) - [i50]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Fast Approximate Counting of Cycles. CoRR abs/2409.19292 (2024) - 2023
- [j41]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed computations in fully-defective networks. Distributed Comput. 36(4): 501-528 (2023) - [j40]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Correction to: Distributed computations in fully-defective networks. Distributed Comput. 36(4): 529 (2023) - [i49]Keren Censor-Hillel, Yuka Machino, Pedro Soto:
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. CoRR abs/2312.16460 (2023) - 2022
- [c71]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. ITCS 2022: 35:1-35:25 - [c70]Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan:
Distributed Vertex Cover Reconfiguration. ITCS 2022: 36:1-36:23 - [c69]Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld:
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2022: 2 - [c68]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed Computations in Fully-Defective Networks. PODC 2022: 141-150 - [c67]Keren Censor-Hillel, Dean Leitersdorf, David Vulakh:
Deterministic Near-Optimal Distributed Listing of Cliques. PODC 2022: 271-280 - [i48]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. CoRR abs/2201.03000 (2022) - [i47]Keren Censor-Hillel:
Distributed Subgraph Finding: Progress and Challenges. CoRR abs/2203.06597 (2022) - [i46]Keren Censor-Hillel, Dean Leitersdorf, David Vulakh:
Deterministic Near-Optimal Distributed Listing of Cliques. CoRR abs/2205.09245 (2022) - [i45]Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed Computations in Fully-Defective Networks. CoRR abs/2205.11148 (2022) - 2021
- [j39]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) - [j38]Keren Censor-Hillel:
2021 Edsger W. Dijkstra Prize in Distributed Computing. Bull. EATCS 134 (2021) - [j37]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) - [j36]Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. SIAM J. Comput. 50(3): 1103-1147 (2021) - [j35]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz:
Smaller Cuts, Higher Lower Bounds. ACM Trans. Algorithms 17(4): 30:1-30:40 (2021) - [c66]Keren Censor-Hillel:
Distributed Subgraph Finding: Progress and Challenges (Invited Talk). ICALP 2021: 3:1-3:14 - [c65]Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan:
Fault Tolerant Max-Cut. ICALP 2021: 46:1-46:20 - [c64]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - [c63]Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin:
Near-Optimal Scheduling in the Congested Clique. SIROCCO 2021: 50-67 - [c62]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. SODA 2021: 2878-2891 - [c61]Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. SPAA 2021: 140-150 - [c60]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
On Sparsity Awareness in Distributed Computations. SPAA 2021: 151-161 - [c59]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
Distance Computations in the Hybrid Network Model via Oracle Simulations. STACS 2021: 21:1-21:19 - [c58]Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Locally Checkable Labelings with Small Messages. DISC 2021: 8:1-8:18 - [e3]Avery Miller, Keren Censor-Hillel, Janne H. Korhonen:
PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021. ACM 2021, ISBN 978-1-4503-8548-0 [contents] - [i44]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 abs/2101.07590 (2021) - [i43]Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin:
Near-Optimal Scheduling in the Congested Clique. CoRR abs/2102.07221 (2021) - [i42]Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan:
Fault Tolerant Max-Cut. CoRR abs/2105.01138 (2021) - [i41]Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Locally Checkable Labelings with Small Messages. CoRR abs/2105.05574 (2021) - [i40]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
On Sparsity Awareness in Distributed Computations. CoRR abs/2105.06068 (2021) - [i39]Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan:
Distributed Vertex Cover Reconfiguration. CoRR abs/2109.06601 (2021) - 2020
- [j34]Keren Censor-Hillel, Michal Dory:
Fast distributed approximation for TAP and 2-edge-connectivity. Distributed Comput. 33(2): 145-168 (2020) - [j33]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33(3-4): 349-366 (2020) - [j32]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): 545-559 (2020) - [j31]Keren Censor-Hillel, Mikaël Rabie:
Distributed reconfiguration of maximal independent sets. J. Comput. Syst. Sci. 112: 85-96 (2020) - [j30]Keren Censor-Hillel, Dean Leitersdorf, Elia Turner:
Sparse matrix multiplication and triangle listing in the Congested Clique model. Theor. Comput. Sci. 809: 45-60 (2020) - [j29]Keren Censor-Hillel, Ami Paz, Mor Perry:
Approximate proof-labeling schemes. Theor. Comput. Sci. 811: 112-124 (2020) - [j28]Keren Censor-Hillel, Ami Paz, Noam Ravid:
The sparsest additive spanner via multiple weighted BFS trees. Theor. Comput. Sci. 840: 33-44 (2020) - [c57]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast Deterministic Algorithms for Highly-Dynamic Networks. OPODIS 2020: 28:1-28:16 - [c56]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. OPODIS 2020: 30:1-30:17 - [c55]Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. PODC 2020: 474-482 - [c54]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. PODC 2020: 501-510 - [c53]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: 33:1-33:17 - [i38]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. CoRR abs/2006.03746 (2020) - [i37]Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. CoRR abs/2007.05316 (2020) - [i36]Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. CoRR abs/2009.08208 (2020) - [i35]Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
Distance Computations in the Hybrid Network Model via Oracle Simulations. CoRR abs/2010.13831 (2020) - [i34]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. CoRR abs/2011.05066 (2020) - [i33]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. CoRR abs/2011.07405 (2020)
2010 – 2019
- 2019
- [j27]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast distributed algorithms for testing graph properties. Distributed Comput. 32(1): 41-57 (2019) - [j26]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making asynchronous distributed computations robust to noise. Distributed Comput. 32(5): 405-421 (2019) - [j25]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [c52]Matthias Bonne, Keren Censor-Hillel:
Distributed Detection of Cliques in Dynamic Networks. ICALP 2019: 132:1-132:15 - [c51]Keren Censor-Hillel, Mikaël Rabie:
Distributed Reconfiguration of Maximal Independent Sets. ICALP 2019: 135:1-135:14 - [c50]Keren Censor-Hillel:
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract). OPODIS 2019: 2:1-2:1 - [c49]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. PODC 2019: 74-83 - [c48]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. PODC 2019: 238-247 - [c47]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. DISC 2019: 10:1-10:17 - [e2]Keren Censor-Hillel, Michele Flammini:
Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings. Lecture Notes in Computer Science 11639, Springer 2019, ISBN 978-3-030-24921-2 [contents] - [i32]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz:
Smaller Cuts, Higher Lower Bounds. CoRR abs/1901.01630 (2019) - [i31]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. CoRR abs/1901.04008 (2019) - [i30]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. CoRR abs/1903.05956 (2019) - [i29]Matthias Bonne, Keren Censor-Hillel:
Distributed Detection of Cliques in Dynamic Networks. CoRR abs/1904.11440 (2019) - [i28]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. CoRR abs/1905.10284 (2019) - 2018
- [j24]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed construction of purely additive spanners. Distributed Comput. 31(3): 223-240 (2018) - [j23]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65(6): 38:1-38:2 (2018) - [j22]James Aspnes, Keren Censor-Hillel, Eitan Yaakobi:
Concurrent use of write-once memory. J. Parallel Distributed Comput. 113: 250-260 (2018) - [j21]Keren Censor-Hillel, Tariq Toukan:
On fast and robust information spreading in the Vertex-Congest model. Theor. Comput. Sci. 751: 74-90 (2018) - [c46]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Channel Noise. ITCS 2018: 50:1-50:20 - [c45]Keren Censor-Hillel, Dean Leitersdorf, Elia Turner:
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. OPODIS 2018: 4:1-4:17 - [c44]Keren Censor-Hillel, Ami Paz, Noam Ravid:
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. OPODIS 2018: 7:1-7:16 - [c43]Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. PODC 2018: 139-148 - [c42]Keren Censor-Hillel:
Barriers due to Congestion and Two Ways to Deal With Them. PODC 2018: 335 - [i27]Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. CoRR abs/1802.03160 (2018) - [i26]Keren Censor-Hillel, Dean Leitersdorf, Elia Turner:
Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication. CoRR abs/1802.04789 (2018) - [i25]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. CoRR abs/1805.04165 (2018) - [i24]Keren Censor-Hillel, Mikaël Rabie:
Distributed Reconfiguration of Maximal Independent Sets. CoRR abs/1810.02106 (2018) - [i23]Keren Censor-Hillel, Ami Paz, Noam Ravid:
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. CoRR abs/1811.01997 (2018) - 2017
- [j20]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): 23:1-23:11 (2017) - [j19]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Rumor Spreading with No Dependence on Conductance. SIAM J. Comput. 46(1): 58-79 (2017) - [j18]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13(2): 19:1-19:26 (2017) - [c41]Keren Censor-Hillel, Rina Levy, Hadas Shachnai:
Fast Distributed Approximation for Max-Cut. ALGOSENSORS 2017: 41-56 - [c40]Keren Censor-Hillel, Michal Dory:
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. OPODIS 2017: 21:1-21:20 - [c39]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. PODC 2017: 33-42 - [c38]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC 2017: 165-174 - [c37]Keren Censor-Hillel, Michal Dory:
Brief Announcement: Distributed Approximation for Tree Augmentation. PODC 2017: 199-201 - [c36]Keren Censor-Hillel, Ami Paz, Mor Perry:
Approximate Proof-Labeling Schemes. SIROCCO 2017: 71-89 - [c35]Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DISC 2017: 10:1-10:16 - [c34]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. DISC 2017: 11:1-11:16 - [i22]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Noise. CoRR abs/1702.07403 (2017) - [i21]Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. CoRR abs/1705.05646 (2017) - [i20]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. CoRR abs/1705.07369 (2017) - [i19]Keren Censor-Hillel, Rina Levy, Hadas Shachnai:
Fast Distributed Approximation for Max-Cut. CoRR abs/1707.08496 (2017) - [i18]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR abs/1708.00276 (2017) - [i17]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen:
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion. CoRR abs/1711.01623 (2017) - [i16]Keren Censor-Hillel, Michal Dory:
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. CoRR abs/1711.03359 (2017) - 2016
- [j17]Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, Muriel Médard:
The one-out-of-k retrieval problem and linear network coding. Adv. Math. Commun. 10(1): 95-112 (2016) - [j16]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? J. ACM 63(4): 31:1-31:20 (2016) - [j15]James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45(3): 734-762 (2016) - [c33]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. PODC 2016: 3-8 - [c32]Keren Censor-Hillel, Elad Haramaty, Zohar S. Karnin:
Optimal Dynamic Distributed MIS. PODC 2016: 217-226 - [c31]James Aspnes, Keren Censor-Hillel, Eitan Yaakobi:
Concurrent Use of Write-Once Memory. SIROCCO 2016: 127-142 - [c30]Amir Abboud, Keren Censor-Hillel, Seri Khoury:
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. DISC 2016: 29-42 - [c29]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. DISC 2016: 43-56 - [c28]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. DISC 2016: 129-142 - [i15]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds. CoRR abs/1602.03713 (2016) - [i14]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. CoRR abs/1602.03718 (2016) - [i13]Amir Abboud, Keren Censor-Hillel, Seri Khoury:
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. CoRR abs/1605.05109 (2016) - [i12]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. CoRR abs/1607.05597 (2016) - [i11]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. CoRR abs/1608.01689 (2016) - 2015
- [j14]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for the additive network model. Distributed Comput. 28(5): 297-308 (2015) - [j13]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62(1): 3:1-3:22 (2015) - [j12]Keren Censor-Hillel:
Distributed Algorithms as Combinatorial Structures. SIGACT News 46(1): 63-76 (2015) - [c27]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [c26]Keren Censor-Hillel, Erez Petrank, Shahar Timnat:
Help! PODC 2015: 241-250 - [c25]Keren Censor-Hillel, Tariq Toukan:
On Fast and Robust Information Spreading in the Vertex-Congest Model. SIROCCO 2015: 270-284 - [c24]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Vertex Sampling. SODA 2015: 2006-2018 - [c23]Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. DISC 2015: 405-419 - [i10]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - [i9]Keren Censor-Hillel, Tariq Toukan:
On Fast and Robust Information Spreading in the Vertex-Congest Model. CoRR abs/1507.01181 (2015) - [i8]Keren Censor-Hillel, Elad Haramaty, Zohar Shay Karnin:
Optimal Dynamic Distributed MIS. CoRR abs/1507.04330 (2015) - [i7]Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. CoRR abs/1508.03660 (2015) - 2014
- [j11]Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. Distributed Comput. 27(1): 1-19 (2014) - [j10]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui:
Tight Bounds for Asynchronous Renaming. J. ACM 61(3): 18:1-18:51 (2014) - [c22]Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, Muriel Médard:
The One-Out-of-k Retrieval Problem and Linear Network Coding. ICMCTA 2014: 61-75 - [c21]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Brief announcement: are lock-free concurrent algorithms practically wait-free? PODC 2014: 50-52 - [c20]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed connectivity decomposition. PODC 2014: 156-165 - [c19]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
A New Perspective on Vertex Connectivity. SODA 2014: 546-561 - [c18]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are lock-free concurrent algorithms practically wait-free? STOC 2014: 714-723 - 2013
- [j9]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. Distributed Comput. 26(2): 99-117 (2013) - [c17]James Aspnes, Keren Censor-Hillel:
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. DISC 2013: 254-268 - [e1]Keren Censor-Hillel, Valerie King:
Proceedings Ninth International Workshop on Foundations of Mobile Computing, FOMC 2013, Jerusalem, Israel, October 17-18, 2013. EPTCS 132, 2013 [contents] - [i6]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
A New Perspective on Vertex Connectivity. CoRR abs/1304.4553 (2013) - [i5]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? CoRR abs/1311.3200 (2013) - [i4]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed Connectivity Decomposition. CoRR abs/1311.5317 (2013) - 2012
- [j8]James Aspnes, Hagit Attiya, Keren Censor-Hillel:
Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1): 2:1-2:24 (2012) - [j7]Keren Censor-Hillel, Hadas Shachnai:
Fast Information Spreading in Graphs with Large Weak Conductance. SIAM J. Comput. 41(6): 1451-1465 (2012) - [c16]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Faster than optimal snapshots (for a while): preliminary version. PODC 2012: 375-384 - [c15]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler:
Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181 - [c14]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. STOC 2012: 961-970 - [c13]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for Wireless Networks in the High SNR Regime. DISC 2012: 91-105 - [i3]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for Wireless Networks in the High SNR Regime. CoRR abs/1208.6125 (2012) - 2011
- [c12]Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
Structuring unreliable radio networks. PODC 2011: 79-88 - [c11]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248 - [c10]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. PODC 2011: 363-372 - [c9]Keren Censor-Hillel, Hadas Shachnai:
Fast Information Spreading in Graphs with Large Weak Conductance. SODA 2011: 440-448 - [i2]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order Optimal Information Spreading Using Algebraic Gossip. CoRR abs/1101.4372 (2011) - [i1]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance. CoRR abs/1104.2944 (2011) - 2010
- [b1]Keren Censor-Hillel:
Probabilistic methods in distributed computing. Technion - Israel Institute of Technology, Israel, 2010 - [j6]James Aspnes, Hagit Attiya, Keren Censor:
Combining shared-coin algorithms. J. Parallel Distributed Comput. 70(3): 317-322 (2010) - [j5]Hagit Attiya, Keren Censor-Hillel:
Lower Bounds for Randomized Consensus under a Weak Adversary. SIAM J. Comput. 39(8): 3885-3904 (2010) - [j4]James Aspnes, Keren Censor:
Approximate shared-memory counting despite a strong adversary. ACM Trans. Algorithms 6(2): 25:1-25:23 (2010) - [c8]Keren Censor-Hillel, Hadas Shachnai:
Partial information spreading with application to distributed maximum coverage. PODC 2010: 161-170 - [c7]Keren Censor-Hillel:
Multi-sided shared coins and randomized set-agreement. SPAA 2010: 60-68
2000 – 2009
- 2009
- [j3]Keren Censor, Christoph Lenzen:
A review of PODC 2009. SIGACT News 40(4): 71-74 (2009) - [c6]James Aspnes, Hagit Attiya, Keren Censor:
Max registers, counters, and monotone circuits. PODC 2009: 36-45 - [c5]James Aspnes, Keren Censor:
Approximate shared-memory counting despite a strong adversary. SODA 2009: 441-450 - 2008
- [j2]Hagit Attiya, Keren Censor:
Tight bounds for asynchronous randomized consensus. J. ACM 55(5): 20:1-20:26 (2008) - [c4]Hagit Attiya, Keren Censor:
Lower bounds for randomized consensus under a weak adversary. PODC 2008: 315-324 - [c3]James Aspnes, Hagit Attiya, Keren Censor:
Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334 - 2007
- [c2]Hagit Attiya, Keren Censor:
Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164 - 2006
- [j1]Keren Censor, Tuvi Etzion:
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. IEEE Trans. Inf. Theory 52(11): 5128-5140 (2006) - [c1]Keren Censor, Tuvi Etzion:
The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels. ISIT 2006: 1467-1471
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
