The SCEAS System
| |||||||

## Search the dblp DataBase
Oded Lachish:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Oded Lachish, Ilan Newman
**Testing Periodicity.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:366-377 [Conf] - Oded Lachish, Ilan Newman, Asaf Shapira
**Space Complexity vs. Query Complexity.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:426-437 [Conf] - Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv
**Hole analysis for functional coverage data.**[Citation Graph (0, 0)][DBLP] DAC, 2002, pp:807-812 [Conf] - Oded Lachish, Ran Raz
**Explicit lower bound of**[Citation Graph (0, 0)][DBLP]*4.5n - o(n)*for boolena circuits. STOC, 2001, pp:399-408 [Conf] - Oded Lachish, Ilan Newman
**Testing Periodicity**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:092, pp:- [Journal] - Oded Lachish, Ilan Newman
**Languages that are Recognized by Simple Counter Automata are not necessarily Testable**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:152, pp:- [Journal] - Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
**Testing Orientation Properties**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:153, pp:- [Journal] - Oren Ben-Zwi, Oded Lachish, Ilan Newman
**Lower bounds for testing Euclidean Minimum Spanning Trees.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:219-225 [Journal] - Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
**Testing**[Citation Graph (0, 0)][DBLP]*st*-Connectivity. APPROX-RANDOM, 2007, pp:380-394 [Conf] - Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
**Testing Properties of Constraint-Graphs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:264-277 [Conf] **Power Indices in Spanning Connectivity Games.**[Citation Graph (, )][DBLP]**On the Query Complexity of Testing Orientations for Being Eulerian.**[Citation Graph (, )][DBLP]**The Covering and Boundedness Problems for Branching Vector Addition Systems.**[Citation Graph (, )][DBLP]**Sound 3-Query PCPPs Are Long.**[Citation Graph (, )][DBLP]**Hilbert's Thirteenth Problem and Circuit Complexity.**[Citation Graph (, )][DBLP]**Two-phase Algorithms for the Parametric Shortest Path Problem.**[Citation Graph (, )][DBLP]**Wiretapping a Hidden Network.**[Citation Graph (, )][DBLP]**Space Complexity Vs. Query Complexity.**[Citation Graph (, )][DBLP]**Spanning connectivity games**[Citation Graph (, )][DBLP]**Wiretapping a hidden network**[Citation Graph (, )][DBLP]**Two-phase algorithms for the parametric shortest path problem**[Citation Graph (, )][DBLP]**Testing Properties of Constraint-Graphs.**[Citation Graph (, )][DBLP]**Sound 3-query PCPPs are Long.**[Citation Graph (, )][DBLP]**Space Complexity vs. Query Complexity.**[Citation Graph (, )][DBLP]
Search in 0.041secs, Finished in 0.043secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |