Eldar Fischer

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 33

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

ITCS

FOCS

Publications

Eldar Fischer
A basic lower bound for property testing. CoRR (2024)
Eldar Fischer, Johann A. Makowsky
Extensions and Limits of the Specker-Blatter Theorem. CSL (2024)
Tomer Adar, Eldar Fischer
Refining the Adaptivity Notion in the Huge Object Model. CoRR (2023)
Tomer Adar, Eldar Fischer, Amit Levi
Support Testing in the Huge Object Model. CoRR (2023)
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
Testing of Index-Invariant Properties in the Huge Object Model. COLT (2023)
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
Testing of Index-Invariant Properties in the Huge Object Model. CoRR (2022)
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
Testing of Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. (2022)
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. APPROX/RANDOM (2022)
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
Exploring the Gap between Tolerant and Non-tolerant Distribution Testing. CoRR (2021)
Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida
Ordered Graph Limits and Their Applications. ITCS (2021)
Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum
Hard Properties with (Very) Short PCPPs and Their Applications. ITCS (2020)
Eldar Fischer, Oded Lachish, Yadu Vasudev
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica 81 (9) (2019)
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast distributed algorithms for testing graph properties. Distributed Comput. 32 (1) (2019)
Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum
Hard properties with (very) short PCPPs and their applications. CoRR (2019)
Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl
Longest paths in 2-edge-connected cubic graphs. CoRR (2019)
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
Improved bounds for testing Dyck languages. SODA (2018)
Omri Ben-Eliezer, Eldar Fischer
Earthmover Resilience and Testing in Ordered Structures. Computational Complexity Conference (2018)
Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida
Limits of Ordered Graphs and Images. CoRR (2018)
Omri Ben-Eliezer, Eldar Fischer
Earthmover Resilience and Testing in Ordered Structures. CoRR (2018)
Omri Ben-Eliezer, Eldar Fischer
Earthmover Resilience and Testing in Ordered Structures. Electron. Colloquium Comput. Complex. 25 (2018)
Noga Alon, Omri Ben-Eliezer, Eldar Fischer
Testing Hereditary Properties of Ordered Graphs and Matrices. FOCS (2017)
Noga Alon, Omri Ben-Eliezer, Eldar Fischer
Testing hereditary properties of ordered graphs and matrices. CoRR (2017)
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
Improved bounds for testing Dyck languages. CoRR (2017)
Noga Alon, Omri Ben-Eliezer, Eldar Fischer
Testing hereditary properties of ordered graphs and matrices. Electron. Colloquium Comput. Complex. 24 (2017)
Eldar Fischer, Oded Lachish, Yadu Vasudev
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS (2017)
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast Distributed Algorithms for Testing Graph Properties. CoRR (2016)
Eldar Fischer, Oded Lachish, Yadu Vasudev
Improving and extending the testing of distributions for shape-restricted properties. CoRR (2016)
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
On the Power of Conditional Samples in Distribution Testing. SIAM J. Comput. 45 (4) (2016)
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Testing Read-Once Formula Satisfaction. ACM Trans. Comput. Theory 8 (2) (2016)
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast Distributed Algorithms for Testing Graph Properties. DISC (2016)
Eldar Fischer, Oded Lachish, Yadu Vasudev
Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. 22 (2015)
Eldar Fischer, Oded Lachish, Yadu Vasudev
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS (2015)
Eldar Fischer, Oded Lachish, Yadu Vasudev
Trading query complexity for sample-based testing and multi-testing scalability. CoRR (2015)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
Query Complexity Lower Bounds for Reconstruction of Codes. Theory Comput. 10 (2014)
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Partial tests, universal tests and decomposability. ITCS (2014)
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
On the power of conditional samples in distribution testing. ITCS (2013)
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Some properties are not even partially testable. CoRR (2013)
Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
Testing Low Complexity Affine-Invariant Properties. SODA (2013)
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Some properties are not even partially testable. Electron. Colloquium Comput. Complex. 20 (2013)
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
Every locally characterized affine-invariant property is testable. STOC (2013)
Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom
On the query complexity of testing orientations for being Eulerian. ACM Trans. Algorithms 8 (2) (2012)
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Testing Formula Satisfaction. SWAT (2012)
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
On the Power of Conditional Samples in Distribution Testing. Electron. Colloquium Comput. Complex. 19 (2012)
Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. Computational Complexity Conference (2012)
Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
Testing Low Complexity Affine-Invariant Properties. Electron. Colloquium Comput. Complex. 19 (2012)
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
On the Power of Conditional Samples in Distribution Testing CoRR (2012)
Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
Testing Low Complexity Affine-Invariant Properties CoRR (2012)
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. 19 (2012)
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Testing Formula Satisfaction CoRR (2012)
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
Every locally characterized affine-invariant property is testable CoRR (2012)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
Hardness and algorithms for rainbow connection. J. Comb. Optim. 21 (3) (2011)
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant
Testing monotonicity of distributions over general partial orders. ICS (2011)
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)
Eldar Fischer, Orly Yahalom
Testing Convexity Properties of Tree Colorings. Algorithmica 60 (4) (2011)
Eldar Fischer, Eyal Rozenberg
Inflatable Graph Properties and Natural Property Tests. APPROX-RANDOM (2011)
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Comput. Complex. 20 (3) (2011)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
Query Complexity Lower Bounds for Reconstruction of Codes. ICS (2011)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
New Results on Quantum Property Testing. FSTTCS (2010)
Eldar Fischer, Oded Lachish, Raphael Yuster
Two-phase algorithms for the parametric shortest path problem CoRR (2010)
Eldar Fischer, Arie Matsliah, Asaf Shapira
Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. 39 (7) (2010)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
New Results on Quantum Property Testing CoRR (2010)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
Query Complexity Lower Bounds for Reconstruction of Codes. Electron. Colloquium Comput. Complex. 17 (2010)
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant
Testing monotonicity of distributions over general partial orders. Electron. Colloquium Comput. Complex. 17 (2010)
Eldar Fischer, Frédéric Magniez, Michel de Rougemont
Approximate Satisfiability and Equivalence. SIAM J. Comput. 39 (6) (2010)
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster
Two-phase Algorithms for the Parametric Shortest Path Problem. STACS (2010)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
Hardness and Algorithms for Rainbow Connectivity. STACS (2009)
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
Hardness and Algorithms for Rainbow Connectivity CoRR (2009)
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) (2009)
Eldar Fischer, Tomer Kotek, Johann A. Makowsky
Application of logic to combinatorial sequences and their recurrence relations. AMS-ASL Joint Special Session (2009)
Eldar Fischer, Arie Matsliah
Testing Graph Isomorphism. SIAM J. Comput. 38 (1) (2008)
Eldar Fischer, Johann A. Makowsky
Linear Recurrence Relations for Graph Polynomials. Pillars of Computer Science (2008)
Eldar Fischer, Johann A. Makowsky, Elena V. Ravve
Counting truth assignments of formulas of bounded tree-width or clique-width. Discret. Appl. Math. 156 (4) (2008)
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom
On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM (2008)
Eldar Fischer, Orly Yahalom
Testing Convexity Properties of Tree Colorings. STACS (2007)
Eldar Fischer, Arie Matsliah, Asaf Shapira
Approximate Hypergraph Partitioning and Applications. FOCS (2007)
Noga Alon, Eldar Fischer, Ilan Newman
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM J. Comput. 37 (3) (2007)
Eldar Fischer, Eyal Rozenberg
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. APPROX-RANDOM (2007)
Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
-Connectivity. APPROX-RANDOM (2007)
Eldar Fischer, Ilan Newman
Testing versus Estimation of Graph Properties. SIAM J. Comput. 37 (2) (2007)
Eldar Fischer, Ilan Newman
Testing of matrix-poset properties. Comb. 27 (3) (2007)
Eldar Fischer, Lance Fortnow
Tolerant Versus Intolerant Testing for Boolean Properties. Theory Comput. 2 (9) (2006)
Eldar Fischer, Frédéric Magniez, Michel de Rougemont
Approximate Satisfiability and Equivalence. LICS (2006)
Eldar Fischer, Orly Yahalom
Testing Convexity Properties of Tree Colorings. Electron. Colloquium Comput. Complex. 13 (053) (2006)
Eldar Fischer, Arie Matsliah
Testing graph isomorphism. SODA (2006)
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
A combinatorial characterization of the testable graph properties: it's all about regularity. STOC (2006)
Eldar Fischer, Lance Fortnow
Tolerant Versus Intolerant Testing for Boolean Properties. Computational Complexity Conference (2005)
Eldar Fischer
Testing graphs for colorability properties. Random Struct. Algorithms 26 (3) (2005)
Eldar Fischer
The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. SIAM J. Comput. 34 (5) (2005)
Eldar Fischer, Ilan Newman
Testing versus estimation of graph properties. STOC (2005)
Eldar Fischer, Ilan Newman, Jirí Sgall
Functions that have read-twice constant width branching programs are not necessarily testable. Random Struct. Algorithms 24 (2) (2004)
Eldar Fischer, Frédéric Magniez, Michel de Rougemont
Property and Equivalence Testing on Strings Electron. Colloquium Comput. Complex. (096) (2004)
Eldar Fischer, Johann A. Makowsky
On spectra of sentences of monadic second order logic with counting. J. Symb. Log. 69 (3) (2004)
Eldar Fischer
The difficulty of testing for isomorphism against a graph that is given in advance. STOC (2004)
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
Testing juntas. J. Comput. Syst. Sci. 68 (4) (2004)
Eldar Fischer, Lance Fortnow
Tolerant Versus Intolerant Testing for Boolean Properties Electron. Colloquium Comput. Complex. (105) (2004)
Eldar Fischer
On the strength of comparisons in property testing. Inf. Comput. 189 (1) (2004)
Eldar Fischer, Johann A. Makowsky
The Specker-Blatter Theorem Revisited. COCOON (2003)
Eldar Fischer
The Specker-Blatter theorem does not hold for quaternary relations. J. Comb. Theory, Ser. A 103 (1) (2003)
Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
Monotonicity testing over general poset domains. STOC (2002)
Eldar Fischer, Ilan Newman
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. Computational Complexity Conference (2002)

Eldar Fischer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eldar Fischer