| 2026 | SODA | Optimal mass estimation in the conditional sampling model. | Tomer Adar, Eldar Fischer, Amit Levi |
| 2025 | STOC | Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. | Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen |
| 2024 | CSL | Extensions and Limits of the Specker-Blatter Theorem. | Eldar Fischer, Johann A. Makowsky |
| 2023 | COLT | Testing of Index-Invariant Properties in the Huge Object Model. | Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen |
| 2018 | SODA | Improved bounds for testing Dyck languages. | Eldar Fischer, Frdric Magniez, Tatiana Starikovskaya |
| 2017 | FOCS | Testing Hereditary Properties of Ordered Graphs and Matrices. | Noga Alon, Omri Ben-Eliezer, Eldar Fischer |
| 2017 | STACS | Improving and Extending the Testing of Distributions for Shape-Restricted Properties. | Eldar Fischer, Oded Lachish, Yadu Vasudev |
| 2015 | FOCS | Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. | Eldar Fischer, Oded Lachish, Yadu Vasudev |
| 2013 | SODA | Testing Low Complexity Affine-Invariant Properties. | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett |
| 2013 | STOC | Every locally characterized affine-invariant property is testable. | Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett |
| 2012 | ICPP | Fast Evaluation of Boolean Circuits Based on Two-Players Game and Optical Connectivity Circuits. | Yosi Ben-Asher, Eldar Fischer, Gadi Haber, Vladislav Tartakovsky |
| 2011 | ICDT | Detecting and exploiting near-sortedness for efficient relational query evaluation. | Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin |
| 2010 | STACS | Two-phase Algorithms for the Parametric Shortest Path Problem. | Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster |
| 2009 | STACS | Hardness and Algorithms for Rainbow Connectivity. | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
| 2007 | FOCS | Approximate Hypergraph Partitioning and Applications. | Eldar Fischer, Arie Matsliah, Asaf Shapira |
| 2007 | STACS | Testing Convexity Properties of Tree Colorings. | Eldar Fischer, Orly Yahalom |
| 2006 | LICS | Approximate Satisfiability and Equivalence. | Eldar Fischer, Frdric Magniez, Michel de Rougemont |
| 2006 | SODA | Testing graph isomorphism. | Eldar Fischer, Arie Matsliah |
| 2006 | STOC | A combinatorial characterization of the testable graph properties: it's all about regularity. | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
| 2005 | STOC | Testing versus estimation of graph properties. | Eldar Fischer, Ilan Newman |
| 2004 | STOC | The difficulty of testing for isomorphism against a graph that is given in advance. | Eldar Fischer |
| 2003 | COCOON | The Specker-Blatter Theorem Revisited. | Eldar Fischer, Johann A. Makowsky |
| 2002 | FOCS | Testing Juntas. | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky |
| 2002 | STOC | Monotonicity testing over general poset domains. | Eldar Fischer, Eric P. Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky |
| 2001 | FOCS | Testing Random Variables for Independence and Identity. | Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White |
| 2001 | SODA | Testing graphs for colorable properties. | Eldar Fischer |
| 2001 | STOC | Testing of matrix properties. | Eldar Fischer, Ilan Newman |
| 1999 | FOCS | Efficient Testing of Large Graphs. | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy |
| 1999 | STOC | PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |