Browse by Person
 | Up a level |
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
Lachish, Oded and Reidl, Felix and Trehan, Chhaya (2022) When you come at the King you best not miss. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022) 250 , 25:1-25:12. ISSN 1868-8969.
ACM Transactions on Algorithms
Fischer, E. and Lachish, Oded and Matsliah, A. and Newman, I. and Yahalom, O. (2012) On the query complexity of testing orientations for being Eulerian. ACM Transactions on Algorithms 8 (2), pp. 1-41. ISSN 1549-6325.
ACM Transactions on Computation Theory
Ben-Sasson, E. and Harsha, P. and Lachish, Oded and Matsliah, A. (2009) Sound 3-query PCPPs are long. ACM Transactions on Computation Theory 1 (2), pp. 1-49. ISSN 1942-3454.
Algorithm Theory – SWAT 2012
Fischer, E. and Goldhirsh, Y. and Lachish, Oded (2012) Testing formula satisfaction. In: Fomin, F.V. and Kaski, P. (eds.) Algorithm Theory – SWAT 2012. Lecture Notes in Computer Science 7357. Berlin, Germany: Springer, pp. 376-387. ISBN 9783642311550.
Algorithmica
Lachish, Oded and Fischer, E. and Vasudev, Y. (2019) Improving and extending the testing of distributions for shape-restricted properties. Algorithmica 81 (9), pp. 3765-3802. ISSN 0178-4617.
Lachish, Oded and Newman, I. (2011) Testing periodicity. Algorithmica 60 (2), pp. 401-420. ISSN 0178-4617.
Computational Complexity
Lachish, Oded and Newman, I. and Shapira, A. (2008) Space complexity Vs. query complexity. Computational Complexity 17 (1), pp. 70-93. ISSN 1016-3328.
Innovations in Theoretical Computer Science Conference
Fischer, E. and Goldhirsh, Y. and Lachish, Oded (2014) Partial tests, universal tests and decomposability. In: UNSPECIFIED (ed.) ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science. New York, U.S.: ACM, pp. 483-500. ISBN 9781450326988.
Journal of Computer and System Sciences
Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2013) The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences 79 (1), pp. 23-38. ISSN 0022-0000.
SIAM Journal on Computing
Dall'Agnol, M. and Gur, T. and Lachish, Oded (2023) A structural theorem for local algorithms with applications to coding, testing, and privacy. SIAM Journal on Computing 52 (6), pp. 1413-1463. ISSN 0097-5397.
Lachish, Oded and Gur, T. (2021) On the power of relaxed Local Decoding Algorithms. SIAM Journal on Computing 50 (2), pp. 788-813. ISSN 0097-5397.
Symposium on Foundations of Computer Science
Fischer, E. and Lachish, Oded and Vasudev, Y. (2015) Trading query complexity for sample-based testing and multi-testing scalability. Symposium on Foundations of Computer Science , pp. 1163-1182. ISSN 0272-5428.
Symposium on Foundations of Computer Science (FOCS)
Lachish, Oded (2014) O(log log Rank) competitive ratio for the Matroid Secretary Problem. In: UNSPECIFIED (ed.) 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) (2014). Piscataway, U.S.: IEEE, pp. 326-225. ISBN 9781479965175.
Theory of Computing Systems
Fenner, Trevor and Lachish, Oded and Popa, A. (2016) Min-sum 2-paths problems. Theory of Computing Systems 58 (1), pp. 94-110. ISSN 1432-4350.