Obserwuj
Oded Lachish
Oded Lachish
Birkbeck, University of London
Zweryfikowany adres z dcs.bbk.ac.uk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
O (log log rank) Competitive-Ratio for the Matroid Secretary Problem
O Lachish
Foundations of Computer Science (FOCS) 2014, 326 - 335, 2014
952014
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
922002
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
71*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
622001
Improved Competitive Ratio for the Matroid Secretary Problem
S Chakraborty, O Lachish
ACM-SIAM Symposium on Discrete Algorithms, 1702-1712, 2012
532012
Power indices in spanning connectivity games
H Aziz, O Lachish, M Paterson, R Savani
Algorithmic Aspects in Information and Management, 55-67, 2009
472009
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
252009
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
232015
Testing properties of constraint-graphs
S Halevy, O Lachish, I Newman, D Tsur
Computational Complexity, 2007. CCC'07. Twenty-Second Annual IEEE Conference …, 2007
232007
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
232000
Partial tests, universal tests and decomposability
E Fischer, Y Goldhirsh, O Lachish
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
222014
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
222009
Testing st-connectivity
S Chakraborty, E Fischer, O Lachish, A Matsliah, I Newman
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007
222007
Testing orientation properties
S Halevy, O Lachish, I Newman, D Tsur
Electronic Colloquium on Computational Complexity (ECCC) 153, 2005
212005
On the power of relaxed local decoding algorithms
T Gur, O Lachish
SIAM Journal on Computing 50 (2), 788-813, 2021
15*2021
Space Complexity vs. Query Complexity
O Lachish, I Newman, A Shapira
Computational Complexity 17 (1), 70-93, 2008
152008
Improving and extending the testing of distributions for shape-restricted properties
E Fisher, O Lachish, Y Vasudev
Leibniz International, 2017
92017
Min-Sum 2-Paths Problems
T Fenner, O Lachish, A Popa
Theory of Computing Systems 58 (1), 94-110, 2016
92016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20