Oded Lachish

Cited by

	All	Since 2018
Citations	731	220
h-index	16	9
i10-index	18	9

20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232 8 8 13 24 17 36 13 41 37 43 48 43 52 52 60 40 42 41 44 52 1

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
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Rahul SavaniProfessor of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Haris AzizUNSW Sydney - Scientia Associate ProfessorVerified email at unsw.edu.au
Sourav ChakrabortyIndian Statistical Institute, KolkataVerified email at isical.ac.in
Yadu VasudevAssistant Professor, IIT MadrasVerified email at cse.iitm.ac.in
Tom GurAssociate Professor at University of WarwickVerified email at warwick.ac.uk
Prahladh HarshaTata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
Eli Ben-SassonCo-founder & President, StarkWareVerified email at starkware.co
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
Alexandru PopaProfessor, University of BucharestVerified email at fmi.unibuc.ro
John FearnleyUniversity of LiverpoolVerified email at liverpool.ac.uk
Raphael YusterUniversity of HaifaVerified email at math.haifa.ac.il
Oren Ben-ZwiUniversity of HaifaVerified email at cs.haifa.ac.il

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	93	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	92	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	70*	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	61	2001
Improved Competitive Ratio for the Matroid Secretary Problem S Chakraborty, O Lachish ACM-SIAM Symposium on Discrete Algorithms, 1702-1712, 2012	51	2012
Power indices in spanning connectivity games H Aziz, O Lachish, M Paterson, R Savani Algorithmic Aspects in Information and Management, 55-67, 2009	47	2009
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	25	2009
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
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
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	22	2015
Partial tests, universal tests and decomposability E Fischer, Y Goldhirsh, O Lachish Proceedings of the 5th conference on Innovations in theoretical computer …, 2014	22	2014
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 WINE 9, 438-446, 2009	22	2009
Testing st-connectivity S Chakraborty, E Fischer, O Lachish, A Matsliah, I Newman Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007	22	2007
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
On the power of relaxed local decoding algorithms T Gur, O Lachish SIAM Journal on Computing 50 (2), 788-813, 2021	13*	2021
Min-Sum 2-Paths Problems T Fenner, O Lachish, A Popa Theory of Computing Systems 58 (1), 94-110, 2016	9	2016
Improving and extending the testing of distributions for shape-restricted properties E Fisher, O Lachish, Y Vasudev Leibniz International, 2017	8	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