The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Oded Lachish: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oded Lachish, Ilan Newman
    Testing Periodicity. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:366-377 [Conf]
  2. Oded Lachish, Ilan Newman, Asaf Shapira
    Space Complexity vs. Query Complexity. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:426-437 [Conf]
  3. 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]
  4. Oded Lachish, Ran Raz
    Explicit lower bound of 4.5n - o(n) for boolena circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:399-408 [Conf]
  5. Oded Lachish, Ilan Newman
    Testing Periodicity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:092, pp:- [Journal]
  6. 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]
  7. 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]
  8. 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]
  9. Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
    Testing st -Connectivity. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:380-394 [Conf]
  10. 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]

  11. Power Indices in Spanning Connectivity Games. [Citation Graph (, )][DBLP]


  12. On the Query Complexity of Testing Orientations for Being Eulerian. [Citation Graph (, )][DBLP]


  13. The Covering and Boundedness Problems for Branching Vector Addition Systems. [Citation Graph (, )][DBLP]


  14. Sound 3-Query PCPPs Are Long. [Citation Graph (, )][DBLP]


  15. Hilbert's Thirteenth Problem and Circuit Complexity. [Citation Graph (, )][DBLP]


  16. Two-phase Algorithms for the Parametric Shortest Path Problem. [Citation Graph (, )][DBLP]


  17. Wiretapping a Hidden Network. [Citation Graph (, )][DBLP]


  18. Space Complexity Vs. Query Complexity. [Citation Graph (, )][DBLP]


  19. Spanning connectivity games [Citation Graph (, )][DBLP]


  20. Wiretapping a hidden network [Citation Graph (, )][DBLP]


  21. Two-phase algorithms for the parametric shortest path problem [Citation Graph (, )][DBLP]


  22. Testing Properties of Constraint-Graphs. [Citation Graph (, )][DBLP]


  23. Sound 3-query PCPPs are Long. [Citation Graph (, )][DBLP]


  24. Space Complexity vs. Query Complexity. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002