Browse by Person

Article

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 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.

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.

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.

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.

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.

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.

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.

Lachish, Oded and Newman, I. (2011) Testing periodicity. Algorithmica 60 (2), pp. 401-420. ISSN 0178-4617.

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.

Lachish, Oded and Newman, I. and Shapira, A. (2008) Space complexity Vs. query complexity. Computational Complexity 17 (1), pp. 70-93. ISSN 1016-3328.

Book Section

Fisher, E. and Lachish, Oded and Vasudev, Y. (2017) Improving and extending the testing of distributions for shape-restricted properties. In: Vollmer, H. and Vallée, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics 66. Leibniz International, 31:1-31:14. ISBN 9783959770286.

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.

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.

Chakraborty, S. and Lachish, Oded (2012) Improved competitive ratio for the matroid secretary problem. In: UNSPECIFIED (ed.) SODA 2012: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 1702-1712.

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.

Fearnley, J. and Lachish, Oded (2011) Parity games on graphs with medium tree-width. In: Murlak, F. and Sankowski, P. (eds.) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 6907. Berlin, Germany: Springer Verlag, pp. 303-314. ISBN 9783642229930.

Chakraborty, S. and Fischer, E. and Lachish, Oded and Yuster, R. (2010) Two-phase algorithms for the parametric shortest path problem. In: Jean-Yves, M. and Schwentick, T. (eds.) 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics. Dagstuhl, Germany: Schloss Dagstuhl, pp. 168-176. ISBN 9783939897163.

Hansen, K.A. and Lachish, Oded and Miltersen, P.B. (2009) Hilbert’s thirteenth problem and circuit complexity. In: Dong, Y.F. and Du, D.-Z. and Ibarra, O.H. (eds.) Algorithms and Computation. Lecture Notes in Computer Science 5878. Berlin, Germany: Springer Verlag, pp. 153-162. ISBN 9783642106316.

Aziz, H. and Lachish, Oded and Paterson, M. and Savani, R. (2009) Power indices in spanning connectivity games. In: Goldberg, A. and Zhou, Y. (eds.) Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science 5564. Berlin, Germany: Springer Verlag, pp. 55-67. ISBN 9783642021572.

Aziz, H. and Lachish, Oded and Paterson, M. and Savani, R. (2009) Wiretapping a hidden network. In: Leonardi, S. (ed.) Internet and Network Economics. Lecture Notes in Computer Science 5929. Berlin, Germany: Springer Verlag, pp. 438-446. ISBN 9783642108419.

Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2009) The covering and boundedness problems for branching vector addition systems. In: Kannan, R. and Kumar, K.N. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics 4. Dagstuhl, Germany: Schloss Dagstuhl, pp. 181-192. ISBN 9783939897132.

Fischer, E. and Lachish, Oded and Newman, I. and Matsliah, A. and Yahalom, O. (2008) On the query complexity of testing orientations for being Eulerian. In: Goel, A. and Jansen, K. and Rolim, J. and Rubinfeld, J. (eds.) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science 5171. Berlin, Germany: Springer Verlag, pp. 402-415. ISBN 9783540853633.

Ben-Sasson, E. and Harsha, P. and Lachish, Oded and Matsliah, A. (2008) Sound 3-query PCPPs are long. In: Aceto, L. and Damgård, I. and Goldberg, L.A. and Halldórsson, M.M. and Ingólfsdóttir, A. and Walukiewicz, I. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science 5125. Berlin, Germany: Springer Verlag, pp. 686-697. ISBN 9783540705758.

Halevy, S. and Lachish, Oded and Newman, I. and Tsur, D. (2007) Testing properties of constraint-graphs. In: UNSPECIFIED (ed.) Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07). IEEE Computer Society. ISBN 9780769527809.

Lachish, Oded and Newman, I. (2005) Testing periodicity. In: Chekuri, C. and Jansen, K. and Rolim, J.D.P. and Trevisan, L. (eds.) Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science. Springer, pp. 366-377. ISBN 9783540282396.

Lachish, Oded and Raz, R. (2001) Explicit lower bound of 4.5n - o(n) for boolena circuits. In: Vitter, J.S. and Spirakis, P. and Yannakakis, M. (eds.) STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing. Association for Computing Machinery, pp. 399-408. ISBN 9781581133493.

Conference or Workshop Item

Chen, Qing and Helmer, Sven and Lachish, Oded and Bohlen, Michael (2022) Dynamic Spanning Trees for connectivity queries on fully-dynamic undirected graphs. In: 48th International Conference on Very Large Databases, 5-9 Sep 2022, Sydney, Australia.

Dall'Agnol, M. and Gur, T. and Lachish, Oded (2020) A structural theorem for local algorithms with applications to coding, testing, and privacy. In: ACM-SIAM Symposium on Discrete Algorithms (SODA21), 10-13 January 2021, Online.

Lachish, Oded and Gur, Tom (2019) A Lower Bound for Relaxed Locally Decodable Codes. In: ACM-SIAM Symposium on Discrete Algorithms (SODA20), 5-8 Jan 2020, Salt Lake City, U.S.. (In Press)