Number of items: 6.
Gur, Tom and Lachish, Oded
(2021)
On the power of relaxed local decoding algorithms.
SIAM Journal on Computing, 50
(2).
pp. 788-813.
doi:10.1137/19M1307834
ISSN 0097-5397.
Gur, Tom and Lachish, Oded
(2020)
On the power of relaxed local decoding algorithms.
In: 31st ACM-SIAM Symposium on Discrete Algorithms (SODA20), Salt Lake City, Utah, U.S., 5-8 Jan 2020. Published in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms
pp. 1377-1394.
doi:10.5555/3381089.3381172
Demri, StΓ©phane P., Jurdzinski, Marcin, Lachish, Oded and Lazic, Ranko
(2013)
The covering and boundedness problems for branching vector addition systems.
Journal of Computer and System Sciences, 79
(1).
pp. 23-38.
doi:10.1016/j.jcss.2012.04.002
ISSN 0022-0000.
Lachish, Oded and Newman, Ilan
(2011)
Testing periodicity.
Algorithmica, Volume 60
(Number 2).
pp. 401-420.
doi:10.1007/s00453-009-9351-y
ISSN 0178-4617.
Aziz, Haris, Lachish, Oded, Paterson, Michael S. and Savani, Rahul
(2009)
Power indices in spanning connectivity games.
In: 5th International Conference on Algorithmic Aspects in Information and Management, San Francisco, CA, June 15-17, 2009. Published in: Lecture Notes in Computer Science, Vol.5564
pp. 55-67.
ISBN 978-3-642-02157-2.
doi:10.1007/978-3-642-02158-9_7
ISSN 0302-9743.
Lachish, Oded, Newman, Ilan and Shapira, Asaf
(2008)
Space complexity vs. query complexity.
In: 10th RANDOM Conference, Barcelona, Spain, 28-30 Aug, 2006. Published in: Computational Complexity, Vol.17
(No.1).
pp. 70-93.
doi:10.1007/s00037-008-0239-z
ISSN 1016-3328.
This list was generated on Wed Apr 24 01:21:17 2024 BST.