Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Oded Lachish

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ilan Newman

> Home > Persons > Oded Lachish

Publications

2012
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/FischerLMNY12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/FischerLMNY12
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)
2011
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/LachishN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/LachishN11
Oded Lachish, Ilan Newman:
Testing Periodicity. Algorithmica 60(2): 401-420 (2011)
2008
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/cc/LachishNS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/LachishNS08
Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity Vs. Query Complexity. Comput. Complex. 17(1): 70-93 (2008)
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/FischerLNMY08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/FischerLNMY08
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
2007
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/Ben-ZwiLN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Ben-ZwiLN07
Oren Ben-Zwi, Oded Lachish, Ilan Newman:
Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. 102(6): 219-225 (2007)
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/ChakrabortyFLMN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChakrabortyFLMN07
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman:
Testing st -Connectivity. APPROX-RANDOM 2007: 380-394
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/HalevyLNT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/HalevyLNT07
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Properties of Constraint-Graphs. CCC 2007: 264-277
[i6]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/HalevyLNT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/HalevyLNT07
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Properties of Constraint-Graphs. Electron. Colloquium Comput. Complex. TR07 (2007)
2006
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/LachishNS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/LachishNS06
Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity vs. Query Complexity. APPROX-RANDOM 2006: 426-437
[i4]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/LachishNS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/LachishNS06
Oded Lachish, Ilan Newman, Asaf Shapira:
Space Complexity vs. Query Complexity. Electron. Colloquium Comput. Complex. TR06 (2006)
2005
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/LachishN05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/LachishN05
Oded Lachish, Ilan Newman:
Testing Periodicity. APPROX-RANDOM 2005: 366-377
[i3]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR05-152
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR05-152
Oded Lachish, Ilan Newman:
Languages that are Recognized by Simple Counter Automata are not necessarily Testable. Electron. Colloquium Comput. Complex. TR05 (2005)
[i2]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR05-153
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR05-153
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur:
Testing Orientation Properties. Electron. Colloquium Comput. Complex. TR05 (2005)
2004
[i1]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR04-092
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR04-092
Oded Lachish, Ilan Newman:
Testing Periodicity. Electron. Colloquium Comput. Complex. TR04 (2004)

a service of

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.