Explicit lower bound of 4.5n - o(n) for boolena circuits. - Oded Lachish; Ran Raz (STOC, 2001)

Hole analysis for functional coverage data. - Oded Lachish; Eitan Marcus; Shmuel Ur; Avi Ziv (DAC, 2002)

Testing Periodicity - Oded Lachish; Ilan Newman (Electron. Colloquium Comput. Complex., 2004)

Languages that are Recognized by Simple Counter Automata are not necessarily Testable - Oded Lachish; Ilan Newman (Electron. Colloquium Comput. Complex., 2005)

Testing Orientation Properties - Shirley Halevy; Oded Lachish; Ilan Newman; Dekel Tsur (Electron. Colloquium Comput. Complex., 2005)

Testing st -Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Arie Matsliah; Ilan Newman (APPROX-RANDOM, 2007)

Testing Properties of Constraint-Graphs. - Shirley Halevy; Oded Lachish; Ilan Newman; Dekel Tsur (Electron. Colloquium Comput. Complex., 2007)

Sound 3-query PCPPs are Long. - Arie Matsliah; Eli Ben-Sasson; Prahladh Harsha; Oded Lachish (Electron. Colloquium Comput. Complex., 2007)

Lower bounds for testing Euclidean Minimum Spanning Trees. - Oren Ben-Zwi; Oded Lachish; Ilan Newman (Inf. Process. Lett., 2007)

Space Complexity Vs. Query Complexity. - Oded Lachish; Ilan Newman; Asaf Shapira (Comput. Complex., 2008)

Power Indices in Spanning Connectivity Games. - Haris Aziz 001; Oded Lachish; Mike Paterson; Rahul Savani (AAIM, 2009)

Hilbert's Thirteenth Problem and Circuit Complexity. - Kristoffer Arnsfelt Hansen; Oded Lachish; Peter Bro Miltersen (ISAAC, 2009)

Wiretapping a Hidden Network. - Haris Aziz 001; Oded Lachish; Mike Paterson; Rahul Savani (WINE, 2009)

Spanning connectivity games - Haris Aziz 001; Oded Lachish; Mike Paterson; Rahul Savani (CoRR, 2009)

Two-phase Algorithms for the Parametric Shortest Path Problem. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Raphael Yuster (STACS, 2010)

Two-phase algorithms for the parametric shortest path problem - Eldar Fischer; Oded Lachish; Raphael Yuster (CoRR, 2010)

Parity Games on Graphs with Medium Tree-Width. - John Fearnley; Oded Lachish (MFCS, 2011)

Improved competitive ratio for the matroid secretary problem. - Sourav Chakraborty 001; Oded Lachish (SODA, 2012)

Testing Formula Satisfaction. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (SWAT, 2012)

On the query complexity of testing orientations for being Eulerian. - Eldar Fischer; Oded Lachish; Arie Matsliah; Ilan Newman; Orly Yahalom (ACM Trans. Algorithms, 2012)

Analysis of Cluster Structure in Large-Scale English Wikipedia Category Networks. - Thidawan Klaysri; Trevor I. Fenner; Oded Lachish; Mark Levene; Panagiotis Papapetrou (IDA, 2013)

Some properties are not even partially testable. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (Electron. Colloquium Comput. Complex., 2013)

The covering and boundedness problems for branching vector addition systems. - Stéphane Demri; Marcin Jurdzinski; Oded Lachish; Ranko Lazic 001 (J. Comput. Syst. Sci., 2013)

O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. - Oded Lachish (FOCS, 2014)

Partial tests, universal tests and decomposability. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (ITCS, 2014)

Trading query complexity for sample-based testing and multi-testing scalability\

Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs. - Oded Lachish; Igor Razgon (CoRR, 2016)

Min-Sum 2-Paths Problems. - Trevor I. Fenner; Oded Lachish; Alexandru Popa 001 (Theory Comput. Syst., 2016)

Testing Read-Once Formula Satisfaction. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (ACM Trans. Comput. Theory, 2016)

Cellular automata simulation on FPGA for training neural networks with virtual world imagery. - Olivier Van Acker; Oded Lachish; Graeme Burnett (CIG, 2017)

Improving and Extending the Testing of Distributions for Shape-Restricted Properties. - Eldar Fischer; Oded Lachish; Yadu Vasudev (Algorithmica, 2019)

Longest paths in 2-edge-connected cubic graphs. - Nikola K. Blanchard; Eldar Fischer; Oded Lachish; Felix Reidl (CoRR, 2019)

A Lower Bound for Relaxed Locally Decodable Codes. - Tom Gur; Oded Lachish (Electron. Colloquium Comput. Complex., 2019)

A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. - Marcel de Sena Dall'Agnol; Tom Gur; Oded Lachish (Electron. Colloquium Comput. Complex., 2020)

On the Power of Relaxed Local Decoding Algorithms. - Tom Gur; Oded Lachish (SIAM J. Comput., 2021)

When You Come at the King You Best Not Miss. - Oded Lachish; Felix Reidl; Chhaya Trehan (FSTTCS, 2022)

Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version). - Qing Chen 002; Oded Lachish; Sven Helmer; Michael H. Böhlen (CoRR, 2022)

When you come at the kings you best not miss. - Oded Lachish; Felix Reidl; Chhaya Trehan (CoRR, 2022)

Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs. - Qing Chen 002; Oded Lachish; Sven Helmer; Michael H. Böhlen (Proc. VLDB Endow., 2022)

A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification. - Marcel Dall'Agnol; Tom Gur; Oded Lachish (SIAM J. Comput., 2023)

Shortest Undirected Paths in de Bruijn Graphs. - Wiktor Zuba; Oded Lachish; Solon P. Pissis (CPM, 2025)

Testing C_k-Freeness in Bounded Admissibility Graphs. - Christine Awofeso; Patrick Greaves; Oded Lachish; Amit Levi; Felix Reidl (ICALP, 2025)

Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. - Christine Awofeso; Patrick Greaves; Oded Lachish; Felix Reidl (STACS, 2025)

A Practical Algorithm for 2-Admissibility. - Christine Awofeso; Patrick Greaves; Oded Lachish; Felix Reidl (SEA, 2025)

Minimizers in Semi-Dynamic Strings. - Wiktor Zuba; Oded Lachish; Solon P. Pissis (CoRR, 2025)

Testing Quasiperiodicity. - Christine Awofeso; Ben Bals; Oded Lachish; Solon P. Pissis (CoRR, 2025)