- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c32 |      | Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah: On the power of conditional samples in distribution testing. ITCS 2013: 561-580 |
| c31 | | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. SODA 2013: 1337-1355 |
| 2012 | ||
| j28 | | 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) |
| c30 | | Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah: Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. IEEE Conference on Computational Complexity 2012: 148-158 |
| c29 | | |
| i18 | | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. CoRR abs/1201.0330 (2012) |
| i17 | | Eldar Fischer, Yonatan Goldhirsh, Oded Lachish: Testing Formula Satisfaction. CoRR abs/1204.3413 (2012) |
| i16 | | Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah: On the Power of Conditional Samples in Distribution Testing. CoRR abs/1210.8338 (2012) |
| i15 | | Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett: Every locally characterized affine-invariant property is testable. CoRR abs/1212.3849 (2012) |
| i14 | | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. Electronic Colloquium on Computational Complexity (ECCC) 19: 1 (2012) |
| i13 | | Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah: On the Power of Conditional Samples in Distribution Testing. Electronic Colloquium on Computational Complexity (ECCC) 19: 154 (2012) |
| i12 | | Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett: Every locally characterized affine-invariant property is testable. Electronic Colloquium on Computational Complexity (ECCC) 19: 184 (2012) |
| 2011 | ||
| j27 | | Eldar Fischer, Orly Yahalom: Testing Convexity Properties of Tree Colorings. Algorithmica 60(4): 766-805 (2011) |
| j26 | | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Computational Complexity 20(3): 413-504 (2011) |
| j25 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011) |
| c28 | | Eldar Fischer, Eyal Rozenberg: Inflatable Graph Properties and Natural Property Tests. APPROX-RANDOM 2011: 542-554 |
| c27 | | 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 |
| c26 | | Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant: Testing monotonicity of distributions over general partial orders. ICS 2011: 239-252 |
| c25 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah: Query Complexity Lower Bounds for Reconstruction of Codes. ICS 2011: 264-274 |
| 2010 | ||
| j24 | | Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Approximate Satisfiability and Equivalence. SIAM J. Comput. 39(6): 2251-2281 (2010) |
| j23 | | Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. 39(7): 3155-3185 (2010) |
| c24 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf: New Results on Quantum Property Testing. FSTTCS 2010: 145-156 |
| c23 | | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster: Two-phase Algorithms for the Parametric Shortest Path Problem. STACS 2010: 167-178 |
| i11 | | Eldar Fischer, Oded Lachish, Raphael Yuster: Two-phase algorithms for the parametric shortest path problem. CoRR abs/1001.3749 (2010) |
| i10 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf: New Results on Quantum Property Testing. CoRR abs/1005.0523 (2010) |
| i9 | | Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant: Testing monotonicity of distributions over general partial orders. Electronic Colloquium on Computational Complexity (ECCC) 17: 27 (2010) |
| i8 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah: Query Complexity Lower Bounds for Reconstruction of Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 67 (2010) |
| 2009 | ||
| j22 | | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. SIAM J. Comput. 39(1): 143-167 (2009) |
| c22 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254 |
| i7 | | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster: Hardness and Algorithms for Rainbow Connectivity. CoRR abs/0902.1255 (2009) |
| 2008 | ||
| j21 | | 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) |
| j20 | | |
| c21 | | 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 |
| c20 | | Eldar Fischer, Johann A. Makowsky: Linear Recurrence Relations for Graph Polynomials. Pillars of Computer Science 2008: 266-279 |
| 2007 | ||
| j19 | | |
| j18 | | Eldar Fischer, Ilan Newman: Testing versus Estimation of Graph Properties. SIAM J. Comput. 37(2): 482-501 (2007) |
| j17 | | Noga Alon, Eldar Fischer, Ilan Newman: Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM J. Comput. 37(3): 959-976 (2007) |
| c19 | | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman: Testing st -Connectivity. APPROX-RANDOM 2007: 380-394 |
| c18 | | Eldar Fischer, Eyal Rozenberg: Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. APPROX-RANDOM 2007: 464-478 |
| c17 | | Eldar Fischer, Arie Matsliah, Asaf Shapira: Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589 |
| c16 | | |
| 2006 | ||
| j16 | | Eldar Fischer, Lance Fortnow: Tolerant Versus Intolerant Testing for Boolean Properties. Theory of Computing 2(1): 173-183 (2006) |
| c15 | | Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Approximate Satisfiability and Equivalence. LICS 2006: 421-430 |
| c14 | | |
| c13 | | 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 |
| i6 | | Eldar Fischer, Orly Yahalom: Testing Convexity Properties of Tree Colorings. Electronic Colloquium on Computational Complexity (ECCC) 13(053) (2006) |
| 2005 | ||
| j15 | | Eldar Fischer: Testing graphs for colorability properties. Random Struct. Algorithms 26(3): 289-309 (2005) |
| j14 | | Eldar Fischer: The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. SIAM J. Comput. 34(5): 1147-1158 (2005) |
| c12 | | Eldar Fischer, Lance Fortnow: Tolerant Versus Intolerant Testing for Boolean Properties. IEEE Conference on Computational Complexity 2005: 135-140 |
| c11 | | |
| 2004 | ||
| j13 | | Eldar Fischer: On the strength of comparisons in property testing. Inf. Comput. 189(1): 107-116 (2004) |
| j12 | | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004) |
| j11 | | Eldar Fischer, Johann A. Makowsky: On spectra of sentences of monadic second order logic with counting. J. Symb. Log. 69(3): 617-640 (2004) |
| j10 | | 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) |
| c10 | | Eldar Fischer: The difficulty of testing for isomorphism against a graph that is given in advance. STOC 2004: 391-397 |
| i5 | | Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Property and Equivalence Testing on Strings. Electronic Colloquium on Computational Complexity (ECCC)(096) (2004) |
| i4 | | Eldar Fischer, Lance Fortnow: Tolerant Versus Intolerant Testing for Boolean Properties. Electronic Colloquium on Computational Complexity (ECCC)(105) (2004) |
| 2003 | ||
| j9 | | Eldar Fischer: The Specker-Blatter theorem does not hold for quaternary relations. J. Comb. Theory, Ser. A 103(1): 121-136 (2003) |
| c9 | | |
| 2002 | ||
| c8 | | 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 |
| c7 | | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing Juntas. FOCS 2002: 103-112 |
| c6 | | Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky: Monotonicity testing over general poset domains. STOC 2002: 474-483 |
| 2001 | ||
| j8 |  | |
| j7 | | Noga Alon, Eldar Fischer, Mario Szegedy: Parent-Identifying Codes. J. Comb. Theory, Ser. A 95(2): 349-359 (2001) |
| c5 | | Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White: Testing Random Variables for Independence and Identity. FOCS 2001: 442-451 |
| c4 | | |
| c3 | | |
| i3 | | Eldar Fischer: On the strength of comparisons in property testing. Electronic Colloquium on Computational Complexity (ECCC) 8(8) (2001) |
| 2000 | ||
| j6 | | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. Combinatorica 20(4): 451-476 (2000) |
| i2 | | Eldar Fischer: Testing graphs for colorability properties. Electronic Colloquium on Computational Complexity (ECCC) 7(83) (2000) |
| 1999 | ||
| j5 | | Noga Alon, Eldar Fischer: Refining the Graph Density Condition for the Existence of Almost K-factors. Ars Comb. 52 (1999) |
| j4 | | Eldar Fischer: Induced Complete h-partite Graphs in Dense Clique-less Graphs. Electr. J. Comb. 6 (1999) |
| j3 | | |
| j2 | | Eldar Fischer: Variants of the Hajnal-Szemerédi Theorem. Journal of Graph Theory 31(4): 275-282 (1999) |
| c2 | | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. FOCS 1999: 656-666 |
| c1 | | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40 |
| 1998 | ||
| i1 | | 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 | ||
| j1 | | |
Colors in the list of coauthors
Last update Fri May 24 01:18:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page