- CSB - MetaPress - Google - Bing - Yahoo
 | 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) |
| 2012 | ||
| j5 | | Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom: On the query complexity of testing orientations for being Eulerian. ACM Transactions on Algorithms 8(2): 15 (2012) |
| c16 | | Sourav Chakraborty, Oded Lachish: Improved competitive ratio for the matroid secretary problem. SODA 2012: 1702-1712 |
| c15 | | |
| i10 | | Eldar Fischer, Yonatan Goldhirsh, Oded Lachish: Testing Formula Satisfaction. CoRR abs/1204.3413 (2012) |
| 2011 | ||
| j4 | | |
| c14 | | |
| 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) |
| 2009 | ||
| j3 | | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. TOCT 1(2) (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. Computational Complexity 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. IEEE Conference on Computational Complexity 2007: 264-277 |
| i6 | | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(054) (2007) |
| i5 | | Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish: Sound 3-query PCPPs are Long. Electronic Colloquium on Computational Complexity (ECCC) 14(127) (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. Electronic Colloquium on Computational Complexity (ECCC) 13(103) (2006) |
| 2005 | ||
| c3 | | |
| i3 | | Oded Lachish, Ilan Newman: Languages that are Recognized by Simple Counter Automata are not necessarily Testable. Electronic Colloquium on Computational Complexity (ECCC)(152) (2005) |
| i2 | | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Orientation Properties. Electronic Colloquium on Computational Complexity (ECCC)(153) (2005) |
| 2004 | ||
| i1 | | Oded Lachish, Ilan Newman: Testing Periodicity. Electronic Colloquium on Computational Complexity (ECCC)(092) (2004) |
| 2002 | ||
| c2 | | Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv: Hole analysis for functional coverage data. DAC 2002: 807-812 |
| 2001 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sat May 25 05:40:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page