2-factors in dense graphs. - Noga Alon; Eldar Fischer (Discret. Math., 1996)

PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability - Irit Dinur; Eldar Fischer; Guy Kindler; Ran Raz; Shmuel Safra (Electron. Colloquium Comput. Complex., 1998)

Refining the Graph Density Condition for the Existence of Almost K-factors. - Noga Alon; Eldar Fischer (Ars Comb., 1999)

Induced Complete h-partite Graphs in Dense Clique-less Graphs. - Eldar Fischer (Electron. J. Comb., 1999)

Cycle factors in dense graphs. - Eldar Fischer (Discret. Math., 1999)

Variants of the Hajnal-Szemerédi Theorem. - Eldar Fischer (J. Graph Theory, 1999)

Efficient Testing of Large Graphs. - Noga Alon; Eldar Fischer; Michael Krivelevich; Mario Szegedy (Comb., 2000)

Testing graphs for colorability properties - Eldar Fischer (Electron. Colloquium Comput. Complex., 2000)

Testing Random Variables for Independence and Identity. - Tugkan Batu; Lance Fortnow; Eldar Fischer; Ravi Kumar 001; Ronitt Rubinfeld; Patrick White (FOCS, 2001)

Testing graphs for colorable properties. - Eldar Fischer (SODA, 2001)

Testing of matrix properties. - Eldar Fischer; Ilan Newman (STOC, 2001)

The Art of Uninformed Decisions. - Eldar Fischer (Bull. EATCS, 2001)

On the strength of comparisons in property testing - Eldar Fischer (Electron. Colloquium Comput. Complex., 2001)

Parent-Identifying Codes. - Noga Alon; Eldar Fischer; Mario Szegedy (J. Comb. Theory A, 2001)

Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. - Eldar Fischer; Ilan Newman (CCC, 2002)

Monotonicity testing over general poset domains. - Eldar Fischer; Eric Lehman; Ilan Newman; Sofya Raskhodnikova; Ronitt Rubinfeld; Alex Samorodnitsky (STOC, 2002)

The Specker-Blatter Theorem Revisited. - Eldar Fischer; Johann A. Makowsky (COCOON, 2003)

The Specker-Blatter theorem does not hold for quaternary relations. - Eldar Fischer (J. Comb. Theory A, 2003)

Property and Equivalence Testing on Strings - Eldar Fischer; Frédéric Magniez; Michel de Rougemont (Electron. Colloquium Comput. Complex., 2004)

Tolerant Versus Intolerant Testing for Boolean Properties - Eldar Fischer; Lance Fortnow (Electron. Colloquium Comput. Complex., 2004)

Testing juntas. - Eldar Fischer; Guy Kindler; Dana Ron; Shmuel Safra; Alex Samorodnitsky (J. Comput. Syst. Sci., 2004)

On spectra of sentences of monadic second order logic with counting. - Eldar Fischer; Johann A. Makowsky (J. Symb. Log., 2004)

Functions that have read-twice constant width branching programs are not necessarily testable. - Eldar Fischer; Ilan Newman; Jirí Sgall (Random Struct. Algorithms, 2004)

The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. - Eldar Fischer (SIAM J. Comput., 2005)

Testing Convexity Properties of Tree Colorings. - Eldar Fischer; Orly Yahalom (Electron. Colloquium Comput. Complex., 2006)

Testing st -Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Arie Matsliah; Ilan Newman (APPROX-RANDOM, 2007)

Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. - Eldar Fischer; Eyal Rozenberg (APPROX-RANDOM, 2007)

Testing of matrix-poset properties. - Eldar Fischer; Ilan Newman (Comb., 2007)

Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. - Noga Alon; Eldar Fischer; Ilan Newman (SIAM J. Comput., 2007)

Testing versus Estimation of Graph Properties. - Eldar Fischer; Ilan Newman (SIAM J. Comput., 2007)

Linear Recurrence Relations for Graph Polynomials. - Eldar Fischer; Johann A. Makowsky (Pillars of Computer Science, 2008)

Counting truth assignments of formulas of bounded tree-width or clique-width. - Eldar Fischer; Johann A. Makowsky; Elena V. Ravve (Discret. Appl. Math., 2008)

Testing Graph Isomorphism. - Eldar Fischer; Arie Matsliah (SIAM J. Comput., 2008)

Application of logic to combinatorial sequences and their recurrence relations. - Eldar Fischer; Tomer Kotek; Johann A. Makowsky (AMS-ASL Joint Special Session, 2009)

Hardness and Algorithms for Rainbow Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Raphael Yuster (STACS, 2009)

A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. - Noga Alon; Eldar Fischer; Ilan Newman; Asaf Shapira (SIAM J. Comput., 2009)

New Results on Quantum Property Testing. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Ronald de Wolf (FSTTCS, 2010)

Two-phase Algorithms for the Parametric Shortest Path Problem. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Raphael Yuster (STACS, 2010)

Two-phase algorithms for the parametric shortest path problem - Eldar Fischer; Oded Lachish; Raphael Yuster (CoRR, 2010)

Testing monotonicity of distributions over general partial orders. - Arnab Bhattacharyya 001; Eldar Fischer; Ronitt Rubinfeld; Paul Valiant (Electron. Colloquium Comput. Complex., 2010)

Query Complexity Lower Bounds for Reconstruction of Codes. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah (Electron. Colloquium Comput. Complex., 2010)

Approximate Satisfiability and Equivalence. - Eldar Fischer; Frédéric Magniez; Michel de Rougemont (SIAM J. Comput., 2010)

Approximate Hypergraph Partitioning and Applications. - Eldar Fischer; Arie Matsliah; Asaf Shapira (SIAM J. Comput., 2010)

Inflatable Graph Properties and Natural Property Tests. - Eldar Fischer; Eyal Rozenberg (APPROX-RANDOM, 2011)

Detecting and exploiting near-sortedness for efficient relational query evaluation. - Sagi Ben-Moshe; Yaron Kanza; Eldar Fischer; Arie Matsliah; Mani Fischer; Carl Staelin (ICDT, 2011)

PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. - Irit Dinur; Eldar Fischer; Guy Kindler; Ran Raz; Shmuel Safra (Comput. Complex., 2011)

Hardness and algorithms for rainbow connection. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Raphael Yuster (J. Comb. Optim., 2011)

Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. - Sourav Chakraborty 001; Eldar Fischer; David García-Soriano; Arie Matsliah (CCC, 2012)

Testing Formula Satisfaction. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (SWAT, 2012)

Every locally characterized affine-invariant property is testable. - Arnab Bhattacharyya 001; Eldar Fischer; Hamed Hatami; Pooya Hatami; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Testing Low Complexity Affine-Invariant Properties. - Arnab Bhattacharyya 001; Eldar Fischer; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

On the query complexity of testing orientations for being Eulerian. - Eldar Fischer; Oded Lachish; Arie Matsliah; Ilan Newman; Orly Yahalom (ACM Trans. Algorithms, 2012)

Some properties are not even partially testable. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (Electron. Colloquium Comput. Complex., 2013)

Partial tests, universal tests and decomposability. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (ITCS, 2014)

Trading query complexity for sample-based testing and multi-testing scalability\

On the Power of Conditional Samples in Distribution Testing. - Sourav Chakraborty 001; Eldar Fischer; Yonatan Goldhirsh; Arie Matsliah (SIAM J. Comput., 2016)

Testing Read-Once Formula Satisfaction. - Eldar Fischer; Yonatan Goldhirsh; Oded Lachish (ACM Trans. Comput. Theory, 2016)

Testing hereditary properties of ordered graphs and matrices. - Noga Alon; Omri Ben-Eliezer; Eldar Fischer (Electron. Colloquium Comput. Complex., 2017)

Improved bounds for testing Dyck languages. - Eldar Fischer; Frédéric Magniez; Tatiana Starikovskaya (SODA, 2018)

Limits of Ordered Graphs and Images. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Yuichi Yoshida (CoRR, 2018)

Earthmover Resilience and Testing in Ordered Structures. - Omri Ben-Eliezer; Eldar Fischer (Electron. Colloquium Comput. Complex., 2018)

Improving and Extending the Testing of Distributions for Shape-Restricted Properties. - Eldar Fischer; Oded Lachish; Yadu Vasudev (Algorithmica, 2019)

Longest paths in 2-edge-connected cubic graphs. - Nikola K. Blanchard; Eldar Fischer; Oded Lachish; Felix Reidl (CoRR, 2019)

Fast distributed algorithms for testing graph properties. - Keren Censor-Hillel; Eldar Fischer; Gregory Schwartzman; Yadu Vasudev (Distributed Comput., 2019)

Hard Properties with (Very) Short PCPPs and Their Applications. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Ron D. Rothblum (ITCS, 2020)

Ordered Graph Limits and Their Applications. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Yuichi Yoshida (ITCS, 2021)

Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (APPROX/RANDOM, 2022)

Testing of Index-Invariant Properties in the Huge Object Model. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2022)

Refining the Adaptivity Notion in the Huge Object Model. - Tomer Adar; Eldar Fischer (APPROX/RANDOM, 2024)

Support Testing in the Huge Object Model. - Tomer Adar; Eldar Fischer; Amit Levi (APPROX/RANDOM, 2024)

Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries. - Tomer Adar; Eldar Fischer; Amit Levi (APPROX/RANDOM, 2024)

Extensions and Limits of the Specker-Blatter Theorem. - Eldar Fischer; Johann A. Makowsky (CSL, 2024)

A basic lower bound for property testing. - Eldar Fischer (CoRR, 2024)