Oded Lachish
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Formal Methods in Verification
- Software top 10%
- Software Testing and Debugging Techniques
Papers in
-
- Complexity and Algorithms in Graphs 18
- Advanced Graph Theory Research 6
- semigroups and automata theory 5
-
- Machine Learning and Algorithms 6
- Coding theory and cryptography 2
- Co-authors
- Ran Raz (2 shared papers)Avi Ziv (2 shared papers)Shmuel Ur (2 shared papers)Eldar Fischer (5 shared papers)Ilan Newman (7 shared papers)Sourav Chakraborty (2 shared papers)Eli Ben‐Sasson (2 shared papers)Prahladh Harsha (2 shared papers)
- Journals
- Theory of Computing Systems (1 paper)Algorithmica (1 paper)Journal of Computer and System Sciences (1 paper)Computational Complexity (1 paper)ACM Transactions on Algorithms (1 paper)
- Partner nations
- United KingdomIsraelUnited States
In The Last Decade
Oded Lachish
26 papers receiving 154 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 112
- Software 24
- Hardware and Architecture 19
- Artificial Intelligence 79
- Computer Graphics and Computer-Aided Design 7
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 24 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 26 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 33 | |
| 2 | 2001 | 21 | |
| 3 | 2014 | 18 | |
| 4 | Explicit lower bound of 4.5n - o(n) for Boolean circuits | 2001 | 17 |
| 5 | 2022 | 7 | |
| 6 | 2012 | 7 | |
| 7 | 2009 | 7 | |
| 8 | 2014 | 7 | |
| 9 | 2015 | 6 | |
| 10 | 2007 | 5 | |
| 11 | Testing Orientation Properties | 2005 | 4 |
| 12 | 2021 | 4 | |
| 13 | 2010 | 4 | |
| 14 | 2009 | 4 | |
| 15 | Sound 3-query PCPPs are Long. | 2007 | 3 |
| 16 | 2012 | 3 | |
| 17 | Some properties are not even partially testable | 2013 | 2 |
| 18 | 2014 | 2 | |
| 19 | 2008 | 2 | |
| 20 | 2016 | 2 |
About Oded Lachish
Oded Lachish is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Computer Graphics and Computer-Aided Design and Computer Vision and Pattern Recognition, having authored 26 papers that have together received 164 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (18 papers), Optimization and Search Problems (8 papers), Machine Learning and Algorithms (6 papers), Advanced Graph Theory Research (6 papers), semigroups and automata theory (5 papers), Computational Geometry and Mesh Generation (3 papers), Coding theory and cryptography (2 papers) and graph theory and CDMA systems (2 papers). The work is most often cited by research in Computational Theory and Mathematics (112 citations), Software (24 citations), Hardware and Architecture (19 citations), Artificial Intelligence (79 citations) and Computer Graphics and Computer-Aided Design (7 citations). Oded Lachish has collaborated with scholars based in United Kingdom, Israel and United States. Frequent co-authors include Ran Raz, Avi Ziv, Shmuel Ur, Eldar Fischer, Ilan Newman, Sourav Chakraborty, Eli Ben‐Sasson, Prahladh Harsha, Arie Matsliah and Qing Chen. Their work appears in journals such as Theory of Computing Systems, Algorithmica, Journal of Computer and System Sciences, Computational Complexity and ACM Transactions on Algorithms.
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.