Oded Lachish
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Formal Methods in Verification
- Software top 10%
Papers in
-
- Complexity and Algorithms in Graphs 29
- Advanced Graph Theory Research 10
- semigroups and automata theory 5
-
- Machine Learning and Algorithms 10
- Cryptography and Data Security 5
- Algorithms and Data Compression 3
- Coding theory and cryptography 3
- Co-authors
- Ran Raz (2 shared papers)Ilan Newman (10 shared papers)Eldar Fischer (10 shared papers)Avi Ziv (3 shared papers)Shmuel Ur (2 shared papers)Arie Matsliah (6 shared papers)Sourav Chakraborty (3 shared papers)Rahul Savani (2 shared papers)
- Journals
- Lecture notes in computer science (11 papers)Algorithmica (1 paper)Theory of Computing Systems (1 paper)Proceedings of the VLDB Endowment (1 paper)Computational Complexity (1 paper)
- Partner nations
- United KingdomIsraelUnited States
In The Last Decade
Oded Lachish
39 papers receiving 328 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 231
- Software 32
- Management Science and Operations Research 72
- Artificial Intelligence 162
- Computer Networks and Communications 102
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 41 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 42 | |
| 2 | 2001 | 31 | |
| 3 | 2009 | 29 | |
| 4 | 2014 | 29 | |
| 5 | Explicit lower bound of 4.5n - o(n) for Boolean circuits | 2001 | 24 |
| 6 | 2012 | 14 | |
| 7 | 2009 | 12 | |
| 8 | 2007 | 11 | |
| 9 | 2009 | 10 | |
| 10 | 2007 | 10 | |
| 11 | 2014 | 10 | |
| 12 | 2022 | 9 | |
| 13 | Testing Orientation Properties | 2005 | 9 |
| 14 | 2008 | 9 | |
| 15 | 2015 | 8 | |
| 16 | 2008 | 7 | |
| 17 | 2011 | 7 | |
| 18 | 2008 | 6 | |
| 19 | 2010 | 6 | |
| 20 | 2021 | 6 |
About Oded Lachish
Oded Lachish is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Management Science and Operations Research and Computer Graphics and Computer-Aided Design, having authored 41 papers that have together received 343 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (29 papers), Optimization and Search Problems (12 papers), Machine Learning and Algorithms (10 papers), Advanced Graph Theory Research (10 papers), Cryptography and Data Security (5 papers), semigroups and automata theory (5 papers), Algorithms and Data Compression (3 papers) and Coding theory and cryptography (3 papers). The work is most often cited by research in Computational Theory and Mathematics (231 citations), Software (32 citations), Management Science and Operations Research (72 citations), Artificial Intelligence (162 citations) and Computer Networks and Communications (102 citations). Oded Lachish has collaborated with scholars based in United Kingdom, Israel and United States. Frequent co-authors include Ran Raz, Ilan Newman, Eldar Fischer, Avi Ziv, Shmuel Ur, Arie Matsliah, Sourav Chakraborty, Rahul Savani, Haris Aziz and Mike Paterson. Their work appears in journals such as Lecture notes in computer science, Algorithmica, Theory of Computing Systems, Proceedings of the VLDB Endowment and Computational Complexity.
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.