Oded Lachish

Citado por

	Total	Desde 2019
Citas	806	253
Índice h	17	10
Índice i10	21	10

200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242 9 8 14 23 17 37 14 41 35 44 47 45 51 57 57 40 41 40 39 45 57 29

Acceso público

Ver todo

1 artículo

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Ilan NewmanProfessor of Computer Science, University of HaifaDirección de correo verificada de cs.haifa.ac.il
Arie MatsliahPrinceton UniversityDirección de correo verificada de princeton.edu
Ranko LazicDepartment of Computer Science, University of WarwickDirección de correo verificada de warwick.ac.uk
Mike PatersonEmeritus Professor of Computer Science, University of WarwickDirección de correo verificada de warwick.ac.uk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteDirección de correo verificada de liverpool.ac.uk
Haris AzizUNSW Sydney - Scientia Associate ProfessorDirección de correo verificada de unsw.edu.au
Tom GurUniversity of CambridgeDirección de correo verificada de cam.ac.uk
Sourav ChakrabortyIndian Statistical Institute, KolkataDirección de correo verificada de isical.ac.in
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceDirección de correo verificada de warwick.ac.uk
Yadu VasudevAssistant Professor, IIT MadrasDirección de correo verificada de cse.iitm.ac.in
Stéphane DemriCNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles (LMF)Dirección de correo verificada de lmf.cnrs.fr
Prahladh HarshaTata Institute of Fundamental Research, MumbaiDirección de correo verificada de tifr.res.in
Dekel TsurDepartment of Computer Science, Ben-Gurion University of the NegevDirección de correo verificada de cs.bgu.ac.il
Ran RazPrinceton UniversityDirección de correo verificada de princeton.edu
Asaf ShapiraTel Aviv UniversityDirección de correo verificada de tau.ac.il
Sven HelmerSenior Research Associate, University of ZurichDirección de correo verificada de ifi.uzh.ch
Alexandru PopaProfessor, University of BucharestDirección de correo verificada de fmi.unibuc.ro
Marcel Dall'AgnolLecturer, Princeton UniversityDirección de correo verificada de cs.princeton.edu
Qing ChenUniversity of ZurichDirección de correo verificada de ifi.uzh.ch
Michael BöhlenProfessor of Computer Science, University of ZurichDirección de correo verificada de ifi.uzh.ch

Seguir

Oded Lachish

Birkbeck, University of London

Dirección de correo verificada de dcs.bbk.ac.uk - Página principal

Theory of Computer Science


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
O (log log rank) Competitive-Ratio for the Matroid Secretary Problem O Lachish Foundations of Computer Science (FOCS) 2014, 326 - 335, 2014	108	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	95	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	59	2012
Power indices in spanning connectivity games H Aziz, O Lachish, M Paterson, R Savani Algorithmic Aspects in Information and Management, 55-67, 2009	50	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	26	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	12	2023
Min-Sum 2-Paths Problems T Fenner, O Lachish, A Popa Theory of Computing Systems 58 (1), 94-110, 2016	12	2016

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores