Oded Lachish

From MaRDI portal
Person:260261

Available identifiers

zbMath Open lachish.odedMaRDI QIDQ260261

List of research outcomes





PublicationDate of PublicationType
When you come at the king you best not miss2024-09-12Paper
https://portal.mardi4nfdi.de/entity/Q61473552024-01-15Paper
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification2023-12-19Paper
When you come at the kings you best not miss2022-09-24Paper
On the Power of Relaxed Local Decoding Algorithms2021-05-27Paper
On the Power of Relaxed Local Decoding Algorithms2021-02-02Paper
Testing Read-Once Formula Satisfaction2019-12-06Paper
Improving and extending the testing of distributions for shape-restricted properties2019-08-20Paper
https://portal.mardi4nfdi.de/entity/Q57435112019-05-10Paper
A Lower Bound for Relaxed Locally Decodable Codes2019-04-17Paper
Longest paths in 2-edge-connected cubic graphs2019-03-06Paper
Improving and extending the testing of distributions for shape-restricted properties2018-04-19Paper
Partial tests, universal tests and decomposability2017-05-19Paper
Min-sum 2-paths problems2016-03-21Paper
Sound 3-Query PCPPs Are Long2015-09-24Paper
Explicit lower bound of 4.5n - o(n) for boolena circuits2015-02-27Paper
On the query complexity of testing orientations for being Eulerian2014-09-09Paper
Min-Sum 2-Paths Problems2014-09-02Paper
The covering and boundedness problems for branching vector addition systems2013-02-21Paper
The covering and boundedness problems for branching vector addition systems2012-10-24Paper
Testing Formula Satisfaction2012-08-14Paper
Two-phase algorithms for the parametric shortest path problem2012-01-23Paper
Parity Games on Graphs with Medium Tree-Width2011-08-17Paper
Testing periodicity2011-05-10Paper
Lower bounds for testing Euclidean minimum spanning trees2010-01-29Paper
Hilbert’s Thirteenth Problem and Circuit Complexity2009-12-17Paper
Power Indices in Spanning Connectivity Games2009-07-02Paper
Testing st-Connectivity2009-02-17Paper
On the Query Complexity of Testing Orientations for Being Eulerian2008-11-27Paper
Sound 3-Query PCPPs Are Long2008-08-28Paper
Space complexity vs. query complexity2008-08-20Paper
Space Complexity vs. Query Complexity2007-08-28Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper

Research outcomes over time

This page was built for person: Oded Lachish