Publications (16)
Hardness and Algorithms for Rainbow Connectivity
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
New Results on Quantum Property Testing
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
Some properties are not even partially testable
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Every locally characterized affine-invariant property is testable
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami +2
Testing Formula Satisfaction
Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Longest paths in 2-edge-connected cubic graphs
Nikola K. Blanchard, Eldar Fischer, Oded Lachish +1
Trading query complexity for sample-based testing and multi-testing scalability
Eldar Fischer, Oded Lachish, Yadu Vasudev
Testing Low Complexity Affine-Invariant Properties
Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
Improving and extending the testing of distributions for shape-restricted properties
Eldar Fischer, Oded Lachish, Yadu Vasudev
Fast Distributed Algorithms for Testing Graph Properties
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman +1
Earthmover Resilience and Testing in Ordered Structures
Omri Ben-Eliezer, Eldar Fischer
On the Power of Conditional Samples in Distribution Testing
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh +1
Testing hereditary properties of ordered graphs and matrices
Noga Alon, Omri Ben-Eliezer, Eldar Fischer
Two-phase algorithms for the parametric shortest path problem
Eldar Fischer, Oded Lachish, Raphael Yuster
Hardness and Algorithms for Rainbow Connection
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
Improved bounds for testing Dyck languages
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya