Eldar Fischer - RankMe

129 papers A* 21A 20B 2Misc 1Journal 77Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Optimal mass estimation in the conditional sampling model. SODA Tomer Adar, Eldar Fischer, Amit Levi
2025	J	`jnl`	Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. IEEE Trans. Inf. Theory Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
2025	J	`jnl`	Optimal mass estimation in the conditional sampling model. CoRR Tomer Adar, Eldar Fischer, Amit Levi
2025	A*	`conf`	Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. STOC Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen
2024	J	`jnl`	A basic lower bound for property testing. CoRR Eldar Fischer
2024	B	`conf`	Extensions and Limits of the Specker-Blatter Theorem. CSL Eldar Fischer, Johann A. Makowsky
2024	J	`jnl`	Extensions and Limits of the Specker-Blatter Theorem. J. Symb. Log. Eldar Fischer, Johann A. Makowsky
2024	A	`conf`	Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries. APPROX/RANDOM Tomer Adar, Eldar Fischer, Amit Levi
2024	J	`jnl`	Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries. CoRR Tomer Adar, Eldar Fischer, Amit Levi
2024	A	`conf`	Refining the Adaptivity Notion in the Huge Object Model. APPROX/RANDOM Tomer Adar, Eldar Fischer
2024	A	`conf`	Support Testing in the Huge Object Model. APPROX/RANDOM Tomer Adar, Eldar Fischer, Amit Levi
2024	J	`jnl`	Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. CoRR Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen
2024	J	`jnl`	Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen
2023	J	`jnl`	Refining the Adaptivity Notion in the Huge Object Model. CoRR Tomer Adar, Eldar Fischer
2023	J	`jnl`	Support Testing in the Huge Object Model. CoRR Tomer Adar, Eldar Fischer, Amit Levi
2023	A*	`conf`	Testing of Index-Invariant Properties in the Huge Object Model. COLT Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
2022	A	`conf`	Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. APPROX/RANDOM Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
2022	J	`jnl`	Testing of Index-Invariant Properties in the Huge Object Model. CoRR Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
2022	J	`jnl`	Testing of Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
2021	J	`jnl`	Exploring the Gap between Tolerant and Non-tolerant Distribution Testing. CoRR Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
2021	A	`conf`	Ordered Graph Limits and Their Applications. ITCS Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida
2020	A	`conf`	Hard Properties with (Very) Short PCPPs and Their Applications. ITCS Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum
2019	J	`jnl`	Fast distributed algorithms for testing graph properties. Distributed Comput. Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
2019	J	`jnl`	Hard properties with (very) short PCPPs and their applications. CoRR Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum
2019	J	`jnl`	Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica Eldar Fischer, Oded Lachish, Yadu Vasudev
2019	J	`jnl`	Longest paths in 2-edge-connected cubic graphs. CoRR Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl
2018	A	`conf`	Earthmover Resilience and Testing in Ordered Structures. CCC Omri Ben-Eliezer, Eldar Fischer
2018	J	`jnl`	Earthmover Resilience and Testing in Ordered Structures. CoRR Omri Ben-Eliezer, Eldar Fischer
2018	J	`jnl`	Earthmover Resilience and Testing in Ordered Structures. Electron. Colloquium Comput. Complex. Omri Ben-Eliezer, Eldar Fischer
2018	A*	`conf`	Improved bounds for testing Dyck languages. SODA Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
2018	J	`jnl`	Limits of Ordered Graphs and Images. CoRR Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida
2017	J	`jnl`	Improved bounds for testing Dyck languages. CoRR Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
2017	A	`conf`	Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS Eldar Fischer, Oded Lachish, Yadu Vasudev
2017	A*	`conf`	Testing Hereditary Properties of Ordered Graphs and Matrices. FOCS Noga Alon, Omri Ben-Eliezer, Eldar Fischer
2017	J	`jnl`	Testing hereditary properties of ordered graphs and matrices. CoRR Noga Alon, Omri Ben-Eliezer, Eldar Fischer
2017	J	`jnl`	Testing hereditary properties of ordered graphs and matrices. Electron. Colloquium Comput. Complex. Noga Alon, Omri Ben-Eliezer, Eldar Fischer
2016	A	`conf`	Fast Distributed Algorithms for Testing Graph Properties. DISC Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
2016	J	`jnl`	Fast Distributed Algorithms for Testing Graph Properties. CoRR Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
2016	J	`jnl`	Improving and extending the testing of distributions for shape-restricted properties. CoRR Eldar Fischer, Oded Lachish, Yadu Vasudev
2016	J	`jnl`	On the Power of Conditional Samples in Distribution Testing. SIAM J. Comput. Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
2016	J	`jnl`	Testing Read-Once Formula Satisfaction. ACM Trans. Comput. Theory Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2015	A*	`conf`	Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	Trading query complexity for sample-based testing and multi-testing scalability. CoRR Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. Eldar Fischer, Oded Lachish, Yadu Vasudev
2014	A	`conf`	Partial tests, universal tests and decomposability. ITCS Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2014	J	`jnl`	Query Complexity Lower Bounds for Reconstruction of Codes. Theory Comput. Sourav Chakraborty, Eldar Fischer, Arie Matsliah
2013	A*	`conf`	Every locally characterized affine-invariant property is testable. STOC Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2013	A	`conf`	On the power of conditional samples in distribution testing. ITCS Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
2013	J	`jnl`	Some properties are not even partially testable. CoRR Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2013	J	`jnl`	Some properties are not even partially testable. Electron. Colloquium Comput. Complex. Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2013	A*	`conf`	Testing Low Complexity Affine-Invariant Properties. SODA Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
2012	J	`jnl`	Every locally characterized affine-invariant property is testable CoRR Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2012	J	`jnl`	Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2012	B	`conf`	Fast Evaluation of Boolean Circuits Based on Two-Players Game and Optical Connectivity Circuits. ICPP Yosi Ben-Asher, Eldar Fischer, Gadi Haber, Vladislav Tartakovsky
2012	A	`conf`	Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. CCC Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah
2012	J	`jnl`	On the Power of Conditional Samples in Distribution Testing CoRR Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
2012	J	`jnl`	On the Power of Conditional Samples in Distribution Testing. Electron. Colloquium Comput. Complex. Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
2012	J	`jnl`	On the query complexity of testing orientations for being Eulerian. ACM Trans. Algorithms Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom
2012	J	`jnl`	Testing Formula Satisfaction CoRR Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2012	—	`conf`	Testing Formula Satisfaction. SWAT Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
2012	J	`jnl`	Testing Low Complexity Affine-Invariant Properties CoRR Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
2012	J	`jnl`	Testing Low Complexity Affine-Invariant Properties. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
2011	A	`conf`	Detecting and exploiting near-sortedness for efficient relational query evaluation. ICDT Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin
2011	J	`jnl`	Hardness and algorithms for rainbow connection. J. Comb. Optim. Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
2011	—	`conf`	Inflatable Graph Properties and Natural Property Tests. APPROX-RANDOM Eldar Fischer, Eyal Rozenberg
2011	J	`jnl`	PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Comput. Complex. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
2011	A	`conf`	Query Complexity Lower Bounds for Reconstruction of Codes. ICS Sourav Chakraborty, Eldar Fischer, Arie Matsliah
2011	J	`jnl`	Testing Convexity Properties of Tree Colorings. Algorithmica Eldar Fischer, Orly Yahalom
2011	A	`conf`	Testing monotonicity of distributions over general partial orders. ICS Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant
2010	J	`jnl`	Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. Eldar Fischer, Arie Matsliah, Asaf Shapira
2010	J	`jnl`	Approximate Satisfiability and Equivalence. SIAM J. Comput. Eldar Fischer, Frédéric Magniez, Michel de Rougemont
2010	J	`jnl`	New Results on Quantum Property Testing CoRR Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
2010	—	`conf`	New Results on Quantum Property Testing. FSTTCS Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
2010	J	`jnl`	Query Complexity Lower Bounds for Reconstruction of Codes. Electron. Colloquium Comput. Complex. Sourav Chakraborty, Eldar Fischer, Arie Matsliah
2010	J	`jnl`	Testing monotonicity of distributions over general partial orders. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant
2010	A	`conf`	Two-phase Algorithms for the Parametric Shortest Path Problem. STACS Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster
2010	J	`jnl`	Two-phase algorithms for the parametric shortest path problem CoRR Eldar Fischer, Oded Lachish, Raphael Yuster
2009	J	`jnl`	A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. SIAM J. Comput. Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
2009	—	`conf`	Application of logic to combinatorial sequences and their recurrence relations. AMS-ASL Joint Special Session Eldar Fischer, Tomer Kotek, Johann A. Makowsky
2009	J	`jnl`	Hardness and Algorithms for Rainbow Connectivity CoRR Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
2009	A	`conf`	Hardness and Algorithms for Rainbow Connectivity. STACS Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
2008	J	`jnl`	Counting truth assignments of formulas of bounded tree-width or clique-width. Discret. Appl. Math. Eldar Fischer, Johann A. Makowsky, Elena V. Ravve
2008	—	`conf`	Linear Recurrence Relations for Graph Polynomials. Pillars of Computer Science Eldar Fischer, Johann A. Makowsky
2008	—	`conf`	On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom
2008	J	`jnl`	Testing Graph Isomorphism. SIAM J. Comput. Eldar Fischer, Arie Matsliah
2007	A*	`conf`	Approximate Hypergraph Partitioning and Applications. FOCS Eldar Fischer, Arie Matsliah, Asaf Shapira
2007	J	`jnl`	Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM J. Comput. Noga Alon, Eldar Fischer, Ilan Newman
2007	—	`conf`	Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. APPROX-RANDOM Eldar Fischer, Eyal Rozenberg
2007	—	`conf`	Testing APPROX-RANDOM Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman
2007	A	`conf`	Testing Convexity Properties of Tree Colorings. STACS Eldar Fischer, Orly Yahalom
2007	J	`jnl`	Testing of matrix-poset properties. Comb. Eldar Fischer, Ilan Newman
2007	J	`jnl`	Testing versus Estimation of Graph Properties. SIAM J. Comput. Eldar Fischer, Ilan Newman
2006	A*	`conf`	A combinatorial characterization of the testable graph properties: it's all about regularity. STOC Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
2006	A*	`conf`	Approximate Satisfiability and Equivalence. LICS Eldar Fischer, Frédéric Magniez, Michel de Rougemont
2006	J	`jnl`	Testing Convexity Properties of Tree Colorings. Electron. Colloquium Comput. Complex. Eldar Fischer, Orly Yahalom
2006	A*	`conf`	Testing graph isomorphism. SODA Eldar Fischer, Arie Matsliah
2006	J	`jnl`	Tolerant Versus Intolerant Testing for Boolean Properties. Theory Comput. Eldar Fischer, Lance Fortnow
2005	J	`jnl`	Testing graphs for colorability properties. Random Struct. Algorithms Eldar Fischer
2005	A*	`conf`	Testing versus estimation of graph properties. STOC Eldar Fischer, Ilan Newman
2005	J	`jnl`	The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. SIAM J. Comput. Eldar Fischer
2005	A	`conf`	Tolerant Versus Intolerant Testing for Boolean Properties. CCC Eldar Fischer, Lance Fortnow
2004	J	`jnl`	Functions that have read-twice constant width branching programs are not necessarily testable. Random Struct. Algorithms Eldar Fischer, Ilan Newman, Jirí Sgall
2004	J	`jnl`	On spectra of sentences of monadic second order logic with counting. J. Symb. Log. Eldar Fischer, Johann A. Makowsky
2004	J	`jnl`	On the strength of comparisons in property testing. Inf. Comput. Eldar Fischer
2004	J	`jnl`	Property and Equivalence Testing on Strings Electron. Colloquium Comput. Complex. Eldar Fischer, Frédéric Magniez, Michel de Rougemont
2004	J	`jnl`	Testing juntas. J. Comput. Syst. Sci. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
2004	A*	`conf`	The difficulty of testing for isomorphism against a graph that is given in advance. STOC Eldar Fischer
2004	J	`jnl`	Tolerant Versus Intolerant Testing for Boolean Properties Electron. Colloquium Comput. Complex. Eldar Fischer, Lance Fortnow
2003	Misc	`conf`	The Specker-Blatter Theorem Revisited. COCOON Eldar Fischer, Johann A. Makowsky
2003	J	`jnl`	The Specker-Blatter theorem does not hold for quaternary relations. J. Comb. Theory A Eldar Fischer
2002	A	`conf`	Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. CCC Eldar Fischer, Ilan Newman
2002	A*	`conf`	Monotonicity testing over general poset domains. STOC Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
2002	A*	`conf`	Testing Juntas. FOCS Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
2001	J	`jnl`	On the strength of comparisons in property testing Electron. Colloquium Comput. Complex. Eldar Fischer
2001	J	`jnl`	Parent-Identifying Codes. J. Comb. Theory A Noga Alon, Eldar Fischer, Mario Szegedy
2001	A*	`conf`	Testing Random Variables for Independence and Identity. FOCS Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
2001	A*	`conf`	Testing graphs for colorable properties. SODA Eldar Fischer
2001	A*	`conf`	Testing of matrix properties. STOC Eldar Fischer, Ilan Newman
2001	J	`jnl`	The Art of Uninformed Decisions. Bull. EATCS Eldar Fischer
2000	J	`jnl`	Efficient Testing of Large Graphs. Comb. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
2000	J	`jnl`	Testing graphs for colorability properties Electron. Colloquium Comput. Complex. Eldar Fischer
1999	J	`jnl`	Cycle factors in dense graphs. Discret. Math. Eldar Fischer
1999	A*	`conf`	Efficient Testing of Large Graphs. FOCS Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
1999	J	`jnl`	Induced Complete h-partite Graphs in Dense Clique-less Graphs. Electron. J. Comb. Eldar Fischer
1999	A*	`conf`	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
1999	J	`jnl`	Refining the Graph Density Condition for the Existence of Almost K-factors. Ars Comb. Noga Alon, Eldar Fischer
1999	J	`jnl`	Variants of the Hajnal-Szemerédi Theorem. J. Graph Theory Eldar Fischer
1998	J	`jnl`	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability Electron. Colloquium Comput. Complex. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
1996	J	`jnl`	2-factors in dense graphs. Discret. Math. Noga Alon, Eldar Fischer