| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett |
Testing Low Complexity Affine-Invariant Properties.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom |
On the query complexity of testing orientations for being Eulerian. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett |
Testing Low Complexity Affine-Invariant Properties |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Yonatan Goldhirsh, Oded Lachish |
Testing Formula Satisfaction |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and algorithms for rainbow connection. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Orly Yahalom |
Testing Convexity Properties of Tree Colorings. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Eyal Rozenberg |
Inflatable Graph Properties and Natural Property Tests. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant |
Testing monotonicity of distributions over general partial orders. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah |
Query Complexity Lower Bounds for Reconstruction of Codes. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant |
Testing monotonicity of distributions over general partial orders. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah |
Query Complexity Lower Bounds for Reconstruction of Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Raphael Yuster |
Two-phase algorithms for the parametric shortest path problem |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah, Asaf Shapira |
Approximate Hypergraph Partitioning and Applications. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Frédéric Magniez, Michel de Rougemont |
Approximate Satisfiability and Equivalence. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster |
Two-phase Algorithms for the Parametric Shortest Path Problem. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky, Elena V. Ravve |
Counting truth assignments of formulas of bounded tree-width or clique-width. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah |
Testing Graph Isomorphism. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky |
Linear Recurrence Relations for Graph Polynomials. |
Pillars of Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom |
On the Query Complexity of Testing Orientations for Being Eulerian. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Ilan Newman |
Testing of matrix-poset properties. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Ilan Newman |
Testing versus Estimation of Graph Properties. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Ilan Newman |
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Orly Yahalom |
Testing Convexity Properties of Tree Colorings. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Eyal Rozenberg |
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman |
Testing st -Connectivity. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah, Asaf Shapira |
Approximate Hypergraph Partitioning and Applications. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Orly Yahalom |
Testing Convexity Properties of Tree Colorings. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Lance Fortnow |
Tolerant Versus Intolerant Testing for Boolean Properties. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Arie Matsliah |
Testing graph isomorphism. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Frédéric Magniez, Michel de Rougemont |
Approximate Satisfiability and Equivalence. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
A combinatorial characterization of the testable graph properties: it's all about regularity. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
characterization, property testing, regularity lemma |
| 1 | Eldar Fischer |
Testing graphs for colorability properties. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer |
The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Lance Fortnow |
Tolerant Versus Intolerant Testing for Boolean Properties. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Ilan Newman |
Testing versus estimation of graph properties. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
property testing, regularity lemma, graph properties, distance approximation |
| 1 | Eldar Fischer, Frédéric Magniez, Michel de Rougemont |
Property and Equivalence Testing on Strings |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Lance Fortnow |
Tolerant Versus Intolerant Testing for Boolean Properties |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer |
On the strength of comparisons in property testing. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky |
On spectra of sentences of monadic second order logic with counting. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Ilan Newman, Jiri Sgall |
Functions that have read-twice constant width branching programs are not necessarily testable. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
Testing juntas. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer |
The difficulty of testing for isomorphism against a graph that is given in advance. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
graph isomorphism, property testing, regularity lemma |
| 1 | Eldar Fischer |
The Specker-Blatter theorem does not hold for quaternary relations. |
J. Comb. Theory, Ser. A |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky |
The Specker-Blatter Theorem Revisited. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
Testing Juntas. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Ilan Newman |
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky |
Monotonicity testing over general poset domains. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
algorithms, property testing, monotone functions |
| 1 | Noga Alon, Eldar Fischer, Mario Szegedy |
Parent-Identifying Codes. |
J. Comb. Theory, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer |
On the strength of comparisons in property testing |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer |
The Art of Uninformed Decisions. |
Bulletin of the EATCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer |
Testing graphs for colorable properties. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White |
Testing Random Variables for Independence and Identity. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Ilan Newman |
Testing of matrix properties. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
matrix properties, property testing |
| 1 | Eldar Fischer |
Testing graphs for colorability properties |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy |
Efficient Testing of Large Graphs. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68R10, 05C35, 05C85 |
| 1 | Eldar Fischer |
Cycle factors in dense graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer |
Induced Complete h-partite Graphs in Dense Clique-less Graphs. |
Electr. J. Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer |
Refining the Graph Density Condition for the Existence of Almost K-factors. |
Ars Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy |
Efficient Testing of Large Graphs. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Eldar Fischer |
2-factors in dense graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")