Oded Lachish
Impact in
-
- Limits and Structures in Graph Theory
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Formal Methods in Verification
Papers in
-
- Complexity and Algorithms in Graphs 26
- Advanced Graph Theory Research 7
- semigroups and automata theory 5
- Computability, Logic, AI Algorithms 2
-
- Limits and Structures in Graph Theory 10
- Co-authors
- Ran Raz (2 shared papers)Sourav Chakraborty (4 shared papers)Ilan Newman (9 shared papers)Avi Ziv (4 shared papers)Eldar Fischer (9 shared papers)Shmuel Ur (3 shared papers)Haris Aziz (2 shared papers)Rahul Savani (2 shared papers)
- Journals
- ACM Transactions on Computation Theory (2 papers)Lecture notes in computer science (11 papers)Computational Complexity (1 paper)SIAM Journal on Computing (1 paper)Journal of Computer and System Sciences (1 paper)
- Partner nations
- United KingdomIsraelUnited States
In The Last Decade
Oded Lachish
42 papers receiving 416 citations
Peers
Comparison fields: 5 of 22
- Discrete Mathematics and Combinatorics 61
- Computational Theory and Mathematics 223
- Software 47
- Computer Networks and Communications 81
- Hardware and Architecture 24
Countries citing papers authored by Oded Lachish
This map shows the geographic impact of Oded Lachish'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 Oded Lachish with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oded Lachish more than expected).
Fields of papers citing papers by Oded Lachish
This network shows the impact of papers produced by Oded Lachish. 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 Oded Lachish. The network helps show where Oded Lachish may publish in the future.
Co-authors
The 25 scholars most cited alongside Oded Lachish, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 44 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 40 | |
| 2 | 2014 | 36 | |
| 3 | 2001 | 31 | |
| 4 | 2009 | 31 | |
| 5 | 2012 | 31 | |
| 6 | Explicit lower bound of 4.5n - o(n) for Boolean circuits | 2001 | 24 |
| 7 | Improved Competitive Ratio for the Matroid Secretary Problem | 2012 | 19 |
| 8 | 2002 | 16 | |
| 9 | 2012 | 16 | |
| 10 | 2009 | 14 | |
| 11 | 2009 | 13 | |
| 12 | 2014 | 12 | |
| 13 | 2007 | 11 | |
| 14 | 2015 | 11 | |
| 15 | 2007 | 10 | |
| 16 | 2022 | 10 | |
| 17 | Testing Orientation Properties | 2005 | 8 |
| 18 | 2008 | 8 | |
| 19 | 2008 | 7 | |
| 20 | 2010 | 7 |
About Oded Lachish
Oded Lachish is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Software and Computer Networks and Communications, having authored 44 papers that have together received 430 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (26 papers), Limits and Structures in Graph Theory (10 papers), Algorithms and Data Compression (8 papers), Advanced Graph Theory Research (7 papers), semigroups and automata theory (5 papers), Optimization and Search Problems (4 papers), Software Testing and Debugging Techniques (3 papers) and Computability, Logic, AI Algorithms (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (61 citations), Computational Theory and Mathematics (223 citations), Software (47 citations), Computer Networks and Communications (81 citations) and Hardware and Architecture (24 citations). Oded Lachish has collaborated with scholars based in United Kingdom, Israel and United States. Frequent co-authors include Ran Raz, Sourav Chakraborty, Ilan Newman, Avi Ziv, Eldar Fischer, Shmuel Ur, Haris Aziz, Rahul Savani, Mike Paterson and Arie Matsliah. Their work appears in journals such as ACM Transactions on Computation Theory, Lecture notes in computer science, Computational Complexity, SIAM Journal on Computing and Journal of Computer and System Sciences.
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.