Oded Lachish
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Computer Networks and Communications
- Software top 10%
- Management Science and Operations Research
- Co-authors
- Ran RazAvi ZivShmuel UrIlan NewmanEldar FischerSourav ChakrabortyEli Ben‐SassonArie Matsliah
- Topics
- Complexity and Algorithms in Graphs (18 papers)Optimization and Search Problems (8 papers)Machine Learning and Algorithms (6 papers)
- Journals
- SIAM Journal on ComputingProceedings of the VLDB EndowmentJournal of Computer and System Sciences
- 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
- Artificial Intelligence 79
- Computer Networks and Communications 44
- Software 24
- Management Science and Operations Research 23
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-authorship network of co-authors of Oded Lachish
This figure shows the co-authorship network connecting the top 25 collaborators of Oded Lachish. A scholar is included among the top collaborators of Oded Lachish 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 Oded Lachish. Oded Lachish is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Delegation | 1 |
| 3 | 4 | |
| 4 | 1 | |
| 5 | 18 | |
| 6 | 2 | |
| 7 | Some properties are not even partially testable | 2 |
| 8 | 1 | |
| 9 | 7 | |
| 10 | 4 | |
| 11 | 2 | |
| 12 | Sound 3-query PCPPs are Long. | 3 |
| 13 | 1 | |
| 14 | 5 | |
| 15 | Languages that are Recognized by Simple Counter Automata are not necessarily Testable | 1 |
| 16 | Testing Orientation Properties | 4 |
| 17 | 33 | |
| 18 | 1 | |
| 19 | Explicit lower bound of 4.5n - o(n) for Boolean circuits | 17 |
| 20 | 21 |
About Oded Lachish
Oded Lachish is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Software, 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) and Machine Learning and Algorithms (6 papers). The work is most often cited by research in Computational Theory and Mathematics (112 citations), Software (24 citations) and Hardware and Architecture (19 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, Ilan Newman, Eldar Fischer, Sourav Chakraborty, Eli Ben‐Sasson, Arie Matsliah, Prahladh Harsha and Sven Helmer. Their work appears in journals such as SIAM Journal on Computing, Proceedings of the VLDB Endowment 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.