Keren Censor-Hillel

1.1k total citations
47 papers, 327 citations indexed

About

Keren Censor-Hillel is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Keren Censor-Hillel has authored 47 papers receiving a total of 327 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computer Networks and Communications, 26 papers in Computational Theory and Mathematics and 13 papers in Artificial Intelligence. Recurrent topics in Keren Censor-Hillel's work include Complexity and Algorithms in Graphs (24 papers), Optimization and Search Problems (20 papers) and Distributed systems and fault tolerance (20 papers). Keren Censor-Hillel is often cited by papers focused on Complexity and Algorithms in Graphs (24 papers), Optimization and Search Problems (20 papers) and Distributed systems and fault tolerance (20 papers). Keren Censor-Hillel collaborates with scholars based in Israel, United States and Switzerland. Keren Censor-Hillel's co-authors include Hagit Attiya, James Aspnes, Ami Paz, Hadas Shachnai, Mohsen Ghaffari, Bernhard Haeupler, Fabian Kühn, Jukka Suomela, Janne H. Korhonen and Petteri Kaski and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Keren Censor-Hillel

42 papers receiving 312 citations

Peers

Keren Censor-Hillel

CNC

CTM

AI

HA

SNP

Philipp Woelfel Canada

Luděk Kučera Czechia

Tsvi Kopelowitz United States

Virginia Vassilevska United States

Thatchaphol Saranurak United States

Stefan Schamberger Germany

Hillel Gazit United States

Yong Kiam Tan Sweden

Yang P. Liu United States

Jan L. A. Snepscheut Netherlands

Philipp Woelfel Canada

Keren Censor-Hillel

239 ×0.9

CNC

98 ×0.7

CTM

143 ×1.6

AI

98 ×2.5

HA

11 ×0.5

SNP

Citations per year, relative to Keren Censor-Hillel Keren Censor-Hillel (= 1×) peers Philipp Woelfel

Countries citing papers authored by Keren Censor-Hillel

Since Specialization

Citations

This map shows the geographic impact of Keren Censor-Hillel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Keren Censor-Hillel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Keren Censor-Hillel more than expected).

Fields of papers citing papers by Keren Censor-Hillel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Keren Censor-Hillel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Keren Censor-Hillel. The network helps show where Keren Censor-Hillel may publish in the future.

Co-authorship network of co-authors of Keren Censor-Hillel

This figure shows the co-authorship network connecting the top 25 collaborators of Keren Censor-Hillel. A scholar is included among the top collaborators of Keren Censor-Hillel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Keren Censor-Hillel. Keren Censor-Hillel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Censor-Hillel, Keren, et al.. (2021). Locally Checkable Labelings with Small Messages. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

2.

Censor-Hillel, Keren, et al.. (2021). Distance Computations in the Hybrid Network Model via Oracle Simulations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

3.

Censor-Hillel, Keren, et al.. (2021). Fast Deterministic Algorithms for Highly-Dynamic Networks. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16.

4.

Censor-Hillel, Keren, et al.. (2019). Sparse matrix multiplication and triangle listing in the Congested Clique model. Theoretical Computer Science. 809. 45–60. 3 indexed citations

5.

Censor-Hillel, Keren, et al.. (2018). Sparse Matrix Multiplication with Bandwidth Restricted All-to-All Communication.. arXiv (Cornell University). 2 indexed citations

6.

Censor-Hillel, Keren, et al.. (2018). Approximate proof-labeling schemes. Theoretical Computer Science. 811. 112–124. 6 indexed citations

7.

Censor-Hillel, Keren, Ran Gelles, & Bernhard Haeupler. (2018). Making asynchronous distributed computations robust to noise. Distributed Computing. 32(5). 405–421. 6 indexed citations

8.

Censor-Hillel, Keren, et al.. (2017). Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

9.

Censor-Hillel, Keren, et al.. (2017). On fast and robust information spreading in the Vertex-Congest model. Theoretical Computer Science. 751. 74–90.

10.

Censor-Hillel, Keren, Telikepalli Kavitha, Ami Paz, & Amir Yehudayoff. (2017). Distributed construction of purely additive spanners. Distributed Computing. 31(3). 223–240. 2 indexed citations

11.

Censor-Hillel, Keren, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, & Fabian Kühn. (2017). Tight Bounds on Vertex Connectivity Under Sampling. ACM Transactions on Algorithms. 13(2). 1–26. 1 indexed citations

12.

Bar-Yehuda, Reuven, et al.. (2017). Distributed Approximation of Maximum Independent Set and Maximum Matching. 165–174. 14 indexed citations

13.

Alistarh, Dan, Keren Censor-Hillel, & Nir Shavit. (2016). Are Lock-Free Concurrent Algorithms Practically Wait-Free?. Journal of the ACM. 63(4). 1–20. 3 indexed citations

14.

Censor-Hillel, Keren, et al.. (2016). Optimal Dynamic Distributed MIS. 217–226. 7 indexed citations

15.

Censor-Hillel, Keren, Petteri Kaski, Janne H. Korhonen, et al.. (2015). Algebraic Methods in the Congested Clique. 143–152. 29 indexed citations

16.

Alistarh, Dan, Keren Censor-Hillel, & Nir Shavit. (2014). Are lock-free concurrent algorithms practically wait-free?. 714–723. 7 indexed citations

17.

Avin, Chen, Michael Borokhovich, Keren Censor-Hillel, & Zvi Lotker. (2013). Order optimal information spreading using algebraic gossip. Distributed Computing. 26(2). 99–117. 5 indexed citations

18.

Aspnes, James, Hagit Attiya, & Keren Censor-Hillel. (2012). Polylogarithmic concurrent data structures from monotone circuits. Journal of the ACM. 59(1). 1–24. 22 indexed citations

19.

Censor-Hillel, Keren & Hadas Shachnai. (2012). Fast Information Spreading in Graphs with Large Weak Conductance. SIAM Journal on Computing. 41(6). 1451–1465. 9 indexed citations

20.

Censor-Hillel, Keren & Hadas Shachnai. (2011). Fast Information Spreading in Graphs with Large Weak Conductance. 440–448. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact