Eldar Fischer

2009
47	EE	Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254
46	EE	Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity CoRR abs/0902.1255: (2009)
2008
45	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
44	EE	Eldar Fischer, Johann A. Makowsky: Linear Recurrence Relations for Graph Polynomials. Pillars of Computer Science 2008: 266-279
43	EE	Eldar Fischer, Johann A. Makowsky, Elena V. Ravve: Counting truth assignments of formulas of bounded tree-width or clique-width. Discrete Applied Mathematics 156(4): 511-529 (2008)
42	EE	Eldar Fischer, Arie Matsliah: Testing Graph Isomorphism. SIAM J. Comput. 38(1): 207-225 (2008)
2007
41	EE	Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman: Testing st -Connectivity. APPROX-RANDOM 2007: 380-394
40	EE	Eldar Fischer, Eyal Rozenberg: Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. APPROX-RANDOM 2007: 464-478
39	EE	Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589
38	EE	Eldar Fischer, Orly Yahalom: Testing Convexity Properties of Tree Colorings. STACS 2007: 109-120
37	EE	Eldar Fischer, Ilan Newman: Testing versus Estimation of Graph Properties. SIAM J. Comput. 37(2): 482-501 (2007)
36	EE	Noga Alon, Eldar Fischer, Ilan Newman: Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM J. Comput. 37(3): 959-976 (2007)
2006
35	EE	Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Approximate Satisfiability and Equivalence. LICS 2006: 421-430
34	EE	Eldar Fischer, Arie Matsliah: Testing graph isomorphism. SODA 2006: 299-308
33	EE	Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira: A combinatorial characterization of the testable graph properties: it's all about regularity. STOC 2006: 251-260
32	EE	Eldar Fischer, Orly Yahalom: Testing Convexity Properties of Tree Colorings. Electronic Colloquium on Computational Complexity (ECCC) 13(053): (2006)
31	EE	Eldar Fischer, Lance Fortnow: Tolerant Versus Intolerant Testing for Boolean Properties. Theory of Computing 2(1): 173-183 (2006)
2005
30	EE	Eldar Fischer, Lance Fortnow: Tolerant Versus Intolerant Testing for Boolean Properties. IEEE Conference on Computational Complexity 2005: 135-140
29	EE	Eldar Fischer, Ilan Newman: Testing versus estimation of graph properties. STOC 2005: 138-146
28	EE	Eldar Fischer: Testing graphs for colorability properties. Random Struct. Algorithms 26(3): 289-309 (2005)
27	EE	Eldar Fischer: The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. SIAM J. Comput. 34(5): 1147-1158 (2005)
2004
26	EE	Eldar Fischer: The difficulty of testing for isomorphism against a graph that is given in advance. STOC 2004: 391-397
25	EE	Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Property and Equivalence Testing on Strings Electronic Colloquium on Computational Complexity (ECCC)(096): (2004)
24	EE	Eldar Fischer, Lance Fortnow: Tolerant Versus Intolerant Testing for Boolean Properties Electronic Colloquium on Computational Complexity (ECCC)(105): (2004)
23	EE	Eldar Fischer: On the strength of comparisons in property testing. Inf. Comput. 189(1): 107-116 (2004)
22	EE	Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004)
21	EE	Eldar Fischer, Ilan Newman, Jiri Sgall: Functions that have read-twice constant width branching programs are not necessarily testable. Random Struct. Algorithms 24(2): 175-193 (2004)
2003
20	EE	Eldar Fischer, Johann A. Makowsky: The Specker-Blatter Theorem Revisited. COCOON 2003: 90-101
19	EE	Eldar Fischer: The Specker-Blatter theorem does not hold for quaternary relations. J. Comb. Theory, Ser. A 103(1): 121-136 (2003)
2002
18	EE	Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing Juntas. FOCS 2002: 103-112
17	EE	Eldar Fischer, Ilan Newman: Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. IEEE Conference on Computational Complexity 2002: 73-79
16	EE	Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky: Monotonicity testing over general poset domains. STOC 2002: 474-483
2001
15		Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White: Testing Random Variables for Independence and Identity. FOCS 2001: 442-451
14	EE	Eldar Fischer: Testing graphs for colorable properties. SODA 2001: 873-882
13	EE	Eldar Fischer, Ilan Newman: Testing of matrix properties. STOC 2001: 286-295
12		Eldar Fischer: The Art of Uninformed Decisions. Bulletin of the EATCS 75: 97 (2001)
11	EE	Eldar Fischer: On the strength of comparisons in property testing Electronic Colloquium on Computational Complexity (ECCC) 8(8): (2001)
10	EE	Noga Alon, Eldar Fischer, Mario Szegedy: Parent-Identifying Codes. J. Comb. Theory, Ser. A 95(2): 349-359 (2001)
2000
9	EE	Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. Combinatorica 20(4): 451-476 (2000)
8	EE	Eldar Fischer: Testing graphs for colorability properties Electronic Colloquium on Computational Complexity (ECCC) 7(83): (2000)
1999
7	EE	Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. FOCS 1999: 656-666
6	EE	Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40
5		Noga Alon, Eldar Fischer: Refining the Graph Density Condition for the Existence of Almost K-factors. Ars Comb. 52: (1999)
4	EE	Eldar Fischer: Cycle factors in dense graphs. Discrete Mathematics 197-198: 309-323 (1999)
3	EE	Eldar Fischer: Induced Complete h-partite Graphs in Dense Clique-less Graphs. Electr. J. Comb. 6: (1999)
1998
2	EE	Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability Electronic Colloquium on Computational Complexity (ECCC) 5(66): (1998)
1996
1	EE	Noga Alon, Eldar Fischer: 2-factors in dense graphs. Discrete Mathematics 152(1-3): 13-23 (1996)

Coauthor Index

1	Noga Alon	[1] [5] [7] [9] [10] [33] [36]
2	Tugkan Batu	[15]
3	Sourav Chakraborty	[41] [46] [47]
4	Irit Dinur	[2] [6]
5	Lance Fortnow	[15] [24] [30] [31]
6	Guy Kindler	[2] [6] [18] [22]
7	Michael Krivelevich	[7] [9]
8	Ravi Kumar (S. Ravi Kumar)	[15]
9	Oded Lachish	[41] [45]
10	Eric Lehman	[16]
11	Frédéric Magniez	[25] [35]
12	Johann A. Makowsky (Janos Makowsky)	[20] [43] [44]
13	Arie Matsliah	[34] [39] [41] [42] [45] [46] [47]
14	Ilan Newman	[13] [16] [17] [21] [29] [33] [36] [37] [41] [45]
15	Sofya Raskhodnikova	[16]
16	Elena V. Ravve	[43]
17	Ran Raz	[2] [6]
18	Dana Ron	[18] [22]
19	Michel de Rougemont	[25] [35]
20	Eyal Rozenberg	[40]
21	Ronitt Rubinfeld	[15] [16]
22	Shmuel Safra	[2] [6] [18] [22]
23	Alex Samorodnitsky	[16] [18] [22]
24	Jiri Sgall	[21]
25	Asaf Shapira	[33] [39]
26	Mario Szegedy	[7] [9] [10]
27	Patrick White	[15]
28	Orly Yahalom	[32] [38] [45]
29	Raphael Yuster	[46] [47]

Colors in the list of coauthors