Guy Even

3.7k total citations
92 papers, 1.9k citations indexed

About

Guy Even is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Guy Even has authored 92 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Computational Theory and Mathematics, 39 papers in Computer Networks and Communications and 39 papers in Electrical and Electronic Engineering. Recurrent topics in Guy Even's work include Complexity and Algorithms in Graphs (28 papers), Optimization and Search Problems (21 papers) and Low-power high-performance VLSI design (19 papers). Guy Even is often cited by papers focused on Complexity and Algorithms in Graphs (28 papers), Optimization and Search Problems (21 papers) and Low-power high-performance VLSI design (19 papers). Guy Even collaborates with scholars based in Israel, United States and Germany. Guy Even's co-authors include Joseph Naor, Baruch Schieber, P.-M. Seidel, Michael Margaliot, Dmitriy Laschov, Dana Ron, Madhu Sudan, Guy Kortsarz, Shakhar Smorodinsky and Zvi Lotker and has published in prestigious journals such as IEEE Transactions on Information Theory, Automatica and Journal of the ACM.

In The Last Decade

Guy Even

90 papers receiving 1.7k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Guy Even Israel	25	1.0k	632	551	235	228	92	1.9k
Martin Charles Golumbic Israel	29	1.9k 1.8×	834 1.3×	372 0.7×	117 0.5×	169 0.7×	100	2.6k
Piotr Berman United States	25	860 0.8×	1.2k 1.9×	470 0.9×	255 1.1×	188 0.8×	110	2.2k
Alberto Marchetti-Spaccamela Italy	24	693 0.7×	1.0k 1.6×	188 0.3×	254 1.1×	120 0.5×	112	2.3k
Fabrizio Luccio Italy	19	580 0.6×	559 0.9×	252 0.5×	110 0.5×	210 0.9×	102	1.7k
Marek Karpiński Germany	26	1.6k 1.5×	917 1.5×	349 0.6×	125 0.5×	230 1.0×	190	2.8k
Paweł Winter Denmark	14	455 0.4×	621 1.0×	753 1.4×	75 0.3×	204 0.9×	41	1.4k
Harry B. Hunt United States	21	1.0k 1.0×	693 1.1×	224 0.4×	213 0.9×	163 0.7×	97	1.8k
Burkhard Monien Germany	25	723 0.7×	926 1.5×	287 0.5×	85 0.4×	107 0.5×	118	1.9k
Robert Krauthgamer Israel	26	1.2k 1.1×	697 1.1×	187 0.3×	93 0.4×	304 1.3×	110	2.0k
Brenda S. Baker United States	22	821 0.8×	700 1.1×	257 0.5×	211 0.9×	500 2.2×	44	3.0k

Countries citing papers authored by Guy Even

Since Specialization

Citations

This map shows the geographic impact of Guy Even'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 Guy Even with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guy Even more than expected).

Fields of papers citing papers by Guy Even

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Guy Even. 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 Guy Even. The network helps show where Guy Even may publish in the future.

Co-authorship network of co-authors of Guy Even

This figure shows the co-authorship network connecting the top 25 collaborators of Guy Even. A scholar is included among the top collaborators of Guy Even 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 Guy Even. Guy Even 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

Even, Guy, et al.. (2018). Distributed set cover approximation: Primal-dual with optimal locality. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 121. 14. 1 indexed citations

Even, Guy, et al.. (2018). Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence.. arXiv (Cornell University). 4 indexed citations

Even, Guy, et al.. (2018). Best of two local models: Centralized local and distributed local algorithms. Information and Computation. 262. 69–89. 3 indexed citations

Basat, Ran Ben, et al.. (2018). A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log 2 logΔ) Rounds.. arXiv (Cornell University). 1 indexed citations

Even, Guy, et al.. (2018). Online Generalized Caching with Varying Weights and Costs. 205–212. 7 indexed citations

Even, Guy & Shakhar Smorodinsky. (2014). Hitting sets online and unique-max coloring. Discrete Applied Mathematics. 178. 71–82. 3 indexed citations

Even, Guy, et al.. (2013). Message-Passing Algorithms for Packing and Covering Linear Programs with Zero-One Matrices. arXiv (Cornell University). 1 indexed citations

Even, Guy, et al.. (2012). Competitive and deterministic embeddings of virtual networks. Theoretical Computer Science. 496. 184–194. 23 indexed citations

Chekuri, Chandra, Guy Even, Anupam Gupta, & Danny Segev. (2008). Set connectivity problems in undirected graphs and the directed Steiner network problem. Symposium on Discrete Algorithms. 532–541. 19 indexed citations

10.

Chekuri, Chandra, Guy Even, & Guy Kortsarz. (2005). A greedy approximation algorithm for the group Steiner problem. Discrete Applied Mathematics. 154(1). 15–34. 33 indexed citations

11.

Even, Guy, et al.. (2004). A parametric error analysis of Goldschmidt's division algorithm. Journal of Computer and System Sciences. 70(1). 118–139. 8 indexed citations

12.

Even, Guy, Zvi Lotker, Dana Ron, & Shakhar Smorodinsky. (2003). Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. 691–700. 18 indexed citations

13.

Even, Guy & P.-M. Seidel. (2003). A comparison of three rounding algorithms for IEEE floating-point multiplication. 225–232. 3 indexed citations

14.

Even, Guy & Guy Kortsarz. (2002). An approximation algorithm for the group Steiner problem. Symposium on Discrete Algorithms. 49–58. 6 indexed citations

15.

Seidel, P.-M. & Guy Even. (2002). How many logic levels does floating-point addition require?. 142–149. 14 indexed citations

16.

Even, Guy, Sudipto Guha, & Baruch Schieber. (2000). Improved approximations of crossings in graph drawings and VLSI layout areas. 296–305. 2 indexed citations

17.

Even, Guy, Joseph Naor, Satish Rao, & Baruch Schieber. (2000). Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM. 47(4). 585–616. 86 indexed citations

18.

Even, Guy & P.-M. Seidel. (2000). A comparison of three rounding algorithms for IEEE floating-point multiplication. IEEE Transactions on Computers. 49(7). 638–650. 66 indexed citations

19.

Stok, Leon, et al.. (1995). Improving initialization through reversed retiming. 150–154. 8 indexed citations

20.

Even, Guy, Joseph Naor, Satish Rao, & Baruch Schieber. (1995). Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).. 62–71. 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