default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOded Lachish
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Marcel Dall'Agnol
, Tom Gur, Oded Lachish:
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification. SIAM J. Comput. 52(6): 1413-1463 (2023)- 2022
- [j11]Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen:
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs. Proc. VLDB Endow. 15(11): 3263-3276 (2022) - [c26]Oded Lachish, Felix Reidl, Chhaya Trehan:
When You Come at the King You Best Not Miss. FSTTCS 2022: 25:1-25:12 - [i25]Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen:
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version). CoRR abs/2207.06887 (2022) - [i24]Oded Lachish, Felix Reidl, Chhaya Trehan:
When you come at the kings you best not miss. CoRR abs/2209.12082 (2022) - 2021
- [j10]Tom Gur, Oded Lachish:
On the Power of Relaxed Local Decoding Algorithms. SIAM J. Comput. 50(2): 788-813 (2021) - [c25]Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish:
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. SODA 2021: 1651-1665 - 2020
- [c24]Tom Gur, Oded Lachish:
On the Power of Relaxed Local Decoding Algorithms. SODA 2020: 1377-1394 - [i23]Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish:
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. CoRR abs/2010.04985 (2020) - [i22]Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish:
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j9]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica 81(9): 3765-3802 (2019) - [i21]Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl:
Longest paths in 2-edge-connected cubic graphs. CoRR abs/1903.02508 (2019) - [i20]Tom Gur, Oded Lachish:
A Lower Bound for Relaxed Locally Decodable Codes. CoRR abs/1904.08112 (2019) - [i19]Tom Gur, Oded Lachish:
A Lower Bound for Relaxed Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- [c23]Olivier Van Acker, Oded Lachish, Graeme Burnett:
Cellular automata simulation on FPGA for training neural networks with virtual world imagery. CIG 2017: 304-305 - [c22]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS 2017: 31:1-31:14 - [i18]Olivier Van Acker, Oded Lachish, Graeme Burnett:
Cellular Automata Simulation on FPGA for Training Neural Networks with Virtual World Imagery. CoRR abs/1711.07951 (2017) - 2016
- [j8]Trevor I. Fenner, Oded Lachish, Alexandru Popa:
Min-Sum 2-Paths Problems. Theory Comput. Syst. 58(1): 94-110 (2016) - [j7]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Read-Once Formula Satisfaction. ACM Trans. Comput. Theory 8(2): 5:1-5:26 (2016) - [i17]Oded Lachish, Igor Razgon:
Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs. CoRR abs/1604.01560 (2016) - [i16]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and extending the testing of distributions for shape-restricted properties. CoRR abs/1609.06736 (2016) - 2015
- [c21]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS 2015: 1163-1182 - [i15]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability. CoRR abs/1504.00695 (2015) - [i14]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c20]Oded Lachish:
O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. FOCS 2014: 326-335 - [c19]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Partial tests, universal tests and decomposability. ITCS 2014: 483-500 - [i13]Oded Lachish:
O(log log rank) Competitive-Ratio for the Matroid Secretary Problem. CoRR abs/1403.7343 (2014) - 2013
- [j6]Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic:
The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1): 23-38 (2013) - [c18]Thidawan Klaysri, Trevor I. Fenner, Oded Lachish, Mark Levene, Panagiotis Papapetrou:
Analysis of Cluster Structure in Large-Scale English Wikipedia Category Networks. IDA 2013: 261-272 - [c17]Trevor I. Fenner, Oded Lachish, Alexandru Popa:
Min-Sum 2-Paths Problems. WAOA 2013: 1-11 - [i12]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Some properties are not even partially testable. CoRR abs/1306.1360 (2013) - [i11]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Some properties are not even partially testable. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j5]Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom:
On the query complexity of testing orientations for being Eulerian. ACM Trans. Algorithms 8(2): 15:1-15:41 (2012) - [c16]Sourav Chakraborty, Oded Lachish:
Improved competitive ratio for the matroid secretary problem. SODA 2012: 1702-1712 - [c15]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Formula Satisfaction. SWAT 2012: 376-387 - [i10]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Formula Satisfaction. CoRR abs/1204.3413 (2012) - 2011
- [j4]Oded Lachish, Ilan Newman:
Testing Periodicity. Algorithmica 60(2): 401-420 (2011) - [c14]John Fearnley, Oded Lachish:
Parity Games on Graphs with Medium Tree-Width. MFCS 2011: 303-314 - 2010
- [c13]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase Algorithms for the Parametric Shortest Path Problem. STACS 2010: 167-178 - [i9]Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase algorithms for the parametric shortest path problem. CoRR abs/1001.3749 (2010)
2000 – 2009
- 2009
- [j3]Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah:
Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory 1(2): 7:1-7:49 (2009) - [c12]Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani:
Power Indices in Spanning Connectivity Games. AAIM 2009: 55-67 - [c11]Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic:
The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192 - [c10]Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen:
Hilbert's Thirteenth Problem and Circuit Complexity. ISAAC 2009: 153-162 - [c9]Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani:
Wiretapping a Hidden Network. WINE 2009: 438-446 - [i8]Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani:
Spanning connectivity games. CoRR abs/0906.3643 (2009) - [i7]Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani:
Wiretapping a hidden network. CoRR abs/0909.5293 (2009) - 2008
- [j2]Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity Vs. Query Complexity. Comput. Complex. 17(1): 70-93 (2008) - [c8]Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom:
On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM 2008: 402-415 - [c7]Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah:
Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697 - 2007
- [j1]Oren Ben-Zwi, Oded Lachish, Ilan Newman:
Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. 102(6): 219-225 (2007) - [c6]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman:
Testing st -Connectivity. APPROX-RANDOM 2007: 380-394 - [c5]Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Properties of Constraint-Graphs. CCC 2007: 264-277 - [i6]Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Properties of Constraint-Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - [i5]Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish:
Sound 3-query PCPPs are Long. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c4]Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity vs. Query Complexity. APPROX-RANDOM 2006: 426-437 - [i4]Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity vs. Query Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c3]Oded Lachish, Ilan Newman:
Testing Periodicity. APPROX-RANDOM 2005: 366-377 - [i3]Oded Lachish, Ilan Newman:
Languages that are Recognized by Simple Counter Automata are not necessarily Testable. Electron. Colloquium Comput. Complex. TR05 (2005) - [i2]Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Orientation Properties. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i1]Oded Lachish, Ilan Newman:
Testing Periodicity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [c2]Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv:
Hole analysis for functional coverage data. DAC 2002: 807-812 - 2001
- [c1]Oded Lachish, Ran Raz:
Explicit lower bound of 4.5n - o(n) for boolena circuits. STOC 2001: 399-408
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
