Oded Lachish Vis

*	2009
19	EE	Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Power Indices in Spanning Connectivity Games. AAIM 2009: 55-67
18	EE	Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Spanning connectivity games CoRR abs/0906.3643: (2009)
17	EE	Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Wiretapping a hidden network CoRR abs/0909.5293: (2009)
	2008
16	EE	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
15	EE	Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697
14	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity Vs. Query Complexity. Computational Complexity 17(1): 70-93 (2008)
	2007
13	EE	Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman: Testing st -Connectivity. APPROX-RANDOM 2007: 380-394
12	EE	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. IEEE Conference on Computational Complexity 2007: 264-277
11	EE	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(054): (2007)
10	EE	Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish: Sound 3-query PCPPs are Long. Electronic Colloquium on Computational Complexity (ECCC) 14(127): (2007)
9	EE	Oren Ben-Zwi, Oded Lachish, Ilan Newman: Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. 102(6): 219-225 (2007)
	2006
8	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity vs. Query Complexity. APPROX-RANDOM 2006: 426-437
7	EE	Oded Lachish, Ilan Newman, Asaf Shapira: Space Complexity vs. Query Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(103): (2006)
	2005
6	EE	Oded Lachish, Ilan Newman: Testing Periodicity. APPROX-RANDOM 2005: 366-377
5	EE	Oded Lachish, Ilan Newman: Languages that are Recognized by Simple Counter Automata are not necessarily Testable Electronic Colloquium on Computational Complexity (ECCC)(152): (2005)
4	EE	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Orientation Properties Electronic Colloquium on Computational Complexity (ECCC)(153): (2005)
	2004
3	EE	Oded Lachish, Ilan Newman: Testing Periodicity Electronic Colloquium on Computational Complexity (ECCC)(092): (2004)
	2002
2	EE	Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv: Hole analysis for functional coverage data. DAC 2002: 807-812
	2001
1	EE	Oded Lachish, Ran Raz: Explicit lower bound of 4.5n - o(n) for boolena circuits. STOC 2001: 399-408

Coauthor Index

1	Haris Aziz	[17] [18] [19]
2	Eli Ben-Sasson	[10] [15]
3	Oren Ben-Zwi	[9]
4	Sourav Chakraborty	[13]
5	Eldar Fischer	[13] [16]
6	Shirley Halevy	[4] [11] [12]
7	Prahladh Harsha	[10] [15]
8	Eitan Marcus	[2]
9	Arie Matsliah	[10] [13] [15] [16]
10	Ilan Newman	[3] [4] [5] [6] [7] [8] [9] [11] [12] [13] [14] [16]
11	Mike Paterson	[17] [18] [19]
12	Ran Raz	[1]
13	Rahul Savani	[17] [18] [19]
14	Asaf Shapira	[7] [8] [14]
15	Dekel Tsur	[4] [11] [12]
16	Shmuel Ur	[2]
17	Orly Yahalom	[16]
18	Avi Ziv	[2]

Colors in the list of coauthors