Arie Matsliah

	2012
28		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)
	2011
27		Sourav Chakraborty, David García-Soriano, Arie Matsliah: Efficient Sample Extractors for Juntas with Applications. ICALP (1) 2011: 545-556
26		Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin: Detecting and exploiting near-sortedness for efficient relational query evaluation. ICDT 2011: 256-267
25		Sourav Chakraborty, Eldar Fischer, Arie Matsliah: Query Complexity Lower Bounds for Reconstruction of Codes. ICS 2011: 264-274
24		Sourav Chakraborty, David García-Soriano, Arie Matsliah: Cycle Detection, Order Finding and Discrete Log with Jumps. ICS 2011: 284-297
23		Sourav Chakraborty, David García-Soriano, Arie Matsliah: Nearly Tight Bounds for Testing Function Isomorphism. SODA 2011: 1683-1702
22		Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011)
	2010
21		Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah: Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM 2010: 462-475
20		Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf: New Results on Quantum Property Testing. FSTTCS 2010: 145-156
19		Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf: New Results on Quantum Property Testing CoRR abs/1005.0523: (2010)
18		David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët: Monotonicity Testing and Shortest-Path Routing on the Cube. Electronic Colloquium on Computational Complexity (ECCC) 17: 48 (2010)
17		Sourav Chakraborty, Eldar Fischer, Arie Matsliah: Query Complexity Lower Bounds for Reconstruction of Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 67 (2010)
16		Sourav Chakraborty, David García-Soriano, Arie Matsliah: Nearly Tight Bounds for Testing Function Isomorphism. Electronic Colloquium on Computational Complexity (ECCC) 17: 93 (2010)
15		Arie Matsliah, Ofer Strichman: Underapproximation for model-checking based on universal circuits. Inf. Comput. 208(4): 315-326 (2010)
14		Harry Buhrman, David García-Soriano, Arie Matsliah: Learning parities in the mistake-bound model. Inf. Process. Lett. 111(1): 16-21 (2010)
13		Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. 39(7): 3155-3185 (2010)
	2009
12		Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254
11		Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity CoRR abs/0902.1255: (2009)
10		Harry Buhrman, David García-Soriano, Arie Matsliah: Learning parities in the mistake-bound model. Electronic Colloquium on Computational Complexity (ECCC) 16: 60 (2009)
9		Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. TOCT 1(2): (2009)
	2008
8		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
7		Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697
6		Eldar Fischer, Arie Matsliah: Testing Graph Isomorphism. SIAM J. Comput. 38(1): 207-225 (2008)
	2007
5		Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman: Testing st -Connectivity. APPROX-RANDOM 2007: 380-394
4		Arie Matsliah, Ofer Strichman: Underapproximation for Model-Checking Based on Random Cryptographic Constructions. CAV 2007: 339-351
3		Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589
2		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
1		Eldar Fischer, Arie Matsliah: Testing graph isomorphism. SODA 2006: 299-308

Coauthor Index

1	Sagi Ben-Moshe	[26]
2	Eli Ben-Sasson	[2] [7] [9]
3	Jop Briët	[18] [21]
4	Harry Buhrman	[10] [14]
5	Sourav Chakraborty	[5] [11] [12] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [27]
6	Eldar Fischer	[1] [3] [5] [6] [8] [11] [12] [13] [17] [19] [20] [22] [25] [26] [28]
7	Mani Fischer	[26]
8	David García-Soriano	[10] [14] [16] [18] [21] [23] [24] [27]
9	Prahladh Harsha	[2] [7] [9]
10	Yaron Kanza	[26]
11	Oded Lachish	[2] [5] [7] [8] [9] [28]
12	Ilan Newman	[5] [8] [28]
13	Asaf Shapira	[3] [13]
14	Carl Staelin	[26]
15	Ofer Strichman	[4] [15]
16	Ronald de Wolf	[19] [20]
17	Orly Yahalom	[8] [28]
18	Raphael Yuster	[11] [12] [22]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page