Oded Lachish

Cited by

	All	Since 2019
Citations	819	265
h-index	17	10
i10-index	21	10

20032004200520062007200820092010201120122013201420152016201720182019202020212022202320249 8 14 23 17 37 14 41 35 43 47 45 51 57 57 41 40 40 39 44 58 42

Public access

View all

1 article

0 articles

available

not available

Based on funding mandates

Co-authors

Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Arie MatsliahPrinceton UniversityVerified email at princeton.edu
Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteVerified email at liverpool.ac.uk
Haris AzizUNSW SydneyVerified email at unsw.edu.au
Tom GurUniversity of CambridgeVerified email at cam.ac.uk
Sourav ChakrabortyIndian Statistical Institute, KolkataVerified email at isical.ac.in
Yadu VasudevAssistant Professor, IIT MadrasVerified email at cse.iitm.ac.in
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Stéphane DemriCNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles (LMF)Verified email at lmf.cnrs.fr
Prahladh HarshaTata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
Dekel TsurDepartment of Computer Science, Ben-Gurion University of the NegevVerified email at cs.bgu.ac.il
Ran RazPrinceton UniversityVerified email at princeton.edu
Asaf ShapiraTel Aviv UniversityVerified email at tau.ac.il
Sven HelmerSenior Research Associate, University of ZurichVerified email at ifi.uzh.ch
Qing ChenUniversity of ZurichVerified email at ifi.uzh.ch
Michael BöhlenProfessor of Computer Science, University of ZurichVerified email at ifi.uzh.ch
Marcel Dall'AgnolLecturer, Princeton UniversityVerified email at cs.princeton.edu
Alexandru PopaProfessor, University of BucharestVerified email at fmi.unibuc.ro

Oded Lachish

Birkbeck, University of London

Verified email at dcs.bbk.ac.uk - Homepage

Theory of Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
O (log log rank) Competitive-Ratio for the Matroid Secretary Problem O Lachish Foundations of Computer Science (FOCS) 2014, 326 - 335, 2014	111	2014
Hole analysis for functional coverage data O Lachish, E Marcus, S Ur, A Ziv Proceedings of the 39th annual Design Automation Conference, 807-812, 2002	97	2002
The covering and boundedness problems for branching vector addition systems S Demri, M Jurdziński, O Lachish, R Lazić Journal of Computer and System Sciences 79 (1), 23-38, 2013	75*	2013
Explicit lower bound of 4.5n - o(n) for boolena circuits O Lachish, R Raz Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	67	2001
Improved Competitive Ratio for the Matroid Secretary Problem S Chakraborty, O Lachish ACM-SIAM Symposium on Discrete Algorithms, 1702-1712, 2012	60	2012
Power indices in spanning connectivity games H Aziz, O Lachish, M Paterson, R Savani Algorithmic Aspects in Information and Management, 55-67, 2009	51	2009
Trading query complexity for sample-based testing and multi-testing scalability E Fischer, O Lachish, Y Vasudev 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1163-1182, 2015	28	2015
Sound 3-query PCPPs are long E Ben-Sasson, P Harsha, O Lachish, A Matsliah ACM Transactions on Computation Theory 1 (2), 1-49, 2009	26	2009
Partial tests, universal tests and decomposability E Fischer, Y Goldhirsh, O Lachish Proceedings of the 5th conference on Innovations in theoretical computer …, 2014	25	2014
Testing properties of constraint-graphs S Halevy, O Lachish, I Newman, D Tsur Computational Complexity, 2007. CCC'07. Twenty-Second Annual IEEE Conference …, 2007	23	2007
Testing st-connectivity S Chakraborty, E Fischer, O Lachish, A Matsliah, I Newman Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007	23	2007
Convolutional interleaving/de-interleaving method using pointer incrementing across predetermined distances and apparatus for data transmission O Lachish, R Eliyahu, M Neustadter US Patent 6,014,761, 2000	23	2000
On the power of relaxed local decoding algorithms T Gur, O Lachish SIAM Journal on Computing 50 (2), 788-813, 2021	22*	2021
On the query complexity of testing orientations for being Eulerian E Fischer, O Lachish, A Matsliah, I Newman, O Yahalom ACM Transactions on Algorithms (TALG) 8 (2), 15, 2012	22*	2012
Testing periodicity O Lachish, I Newman Algorithmica 60 (2), 401-420, 2011	22*	2011
Wiretapping a hidden network H Aziz, O Lachish, M Paterson, R Savani International Workshop on Internet and Network Economics, 438-446, 2009	21	2009
Testing orientation properties S Halevy, O Lachish, I Newman, D Tsur Electronic Colloquium on Computational Complexity (ECCC) 153, 2005	21	2005
Space Complexity vs. Query Complexity O Lachish, I Newman, A Shapira Computational Complexity 17 (1), 70-93, 2008	15	2008
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification M Dall’Agnol, T Gur, O Lachish SIAM Journal on Computing 52 (6), 1413-1463, 2023	13	2023
Improving and extending the testing of distributions for shape-restricted properties E Fisher, O Lachish, Y Vasudev Leibniz International, 2017	12	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors