Eldar Fischer

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Testing vs Estimation for Index-Invariant Properties in the Huge Object Model 2024 Sourav Chakraborty
Eldar Fischer
Arijit Ghosh
Amit Levi
Gopinath Mishra
Sayantan Sen
+ PDF Chat Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries 2024 Tomer Adar
Eldar Fischer
Amit Levi
+ Counting finite topologies 2024 Eldar Fischer
Johann A. Makowsky
+ PDF Chat EXTENSIONS AND LIMITS OF THE SPECKER–BLATTER THEOREM 2024 Eldar Fischer
Johann A. Makowsky
+ PDF Chat A basic lower bound for property testing 2024 Eldar Fischer
+ Pixelating Relations and Functions Without Adding Substructures 2024 Eldar Fischer
+ MC-finiteness of restricted set partition functions 2023 Eldar Fischer
Johann A. Makowsky
Vsevolod Rakita
+ Counting Finite Topologies 2023 Eldar Fischer
Johann A. Makowsky
+ Refining the Adaptivity Notion in the Huge Object Model 2023 Tomer Adar
Eldar Fischer
+ Support Testing in the Huge Object Model 2023 Tomer Adar
Eldar Fischer
Amit Levi
+ Extensions and Limits of the Specker-Blatter Theorem 2022 Eldar Fischer
Johann A. Makowsky
+ Testing of Index-Invariant Properties in the Huge Object Model 2022 Sourav Chakraborty
Eldar Fischer
Arijit Ghosh
Gopinath Mishra
Sayantan Sen
+ Ordered Graph Limits and Their Applications. 2021 Omri Ben‐Eliezer
Eldar Fischer
Amit Levi
Yuichi Yoshida
+ Exploring the Gap between Tolerant and Non-tolerant Distribution Testing 2021 Sourav Chakraborty
Eldar Fischer
Arijit Ghosh
Gopinath Mishra
Sayantan Sen
+ Hard properties with (very) short PCPPs and their applications 2019 Omri Ben‐Eliezer
Eldar Fischer
Amit Levi
Ron D. Rothblum
+ Longest paths in 2-edge-connected cubic graphs 2019 Nikola K. Blanchard
Eldar Fischer
Oded Lachish
Felix Reidl
+ Hard properties with (very) short PCPPs and their applications 2019 Omri Ben‐Eliezer
Eldar Fischer
Amit Levi
Ron D. Rothblum
+ Longest paths in 2-edge-connected cubic graphs 2019 Nikola K. Blanchard
Eldar Fischer
Oded Lachish
Felix Reidl
+ Limits of Ordered Graphs and Images. 2018 Omri Ben‐Eliezer
Eldar Fischer
Amit Levi
Yoshida Yuichi
+ Limits of Ordered Graphs and their Applications 2018 Omri Ben‐Eliezer
Eldar Fischer
Amit Levi
Yuichi Yoshida
+ Earthmover resilience and testing in ordered structures 2018 Omri Ben‐Eliezer
Eldar Fischer
+ PDF Chat Fast distributed algorithms for testing graph properties 2018 Keren Censor-Hillel
Eldar Fischer
Gregory Schwartzman
Yadu Vasudev
+ Earthmover Resilience and Testing in Ordered Structures 2018 Omri Ben‐Eliezer
Eldar Fischer
+ PDF Chat Improved bounds for testing Dyck languages 2018 Eldar Fischer
Frédéric Magniez
Tatiana Starikovskaya
+ Ordered Graph Limits and Their Applications 2018 Omri Ben‐Eliezer
Eldar Fischer
Amit Levi
Yuichi Yoshida
+ PDF Chat Testing Hereditary Properties of Ordered Graphs and Matrices 2017 Noga Alon
Omri Ben‐Eliezer
Eldar Fischer
+ Testing hereditary properties of ordered graphs and matrices 2017 Noga Alon
Omri Ben‐Eliezer
Eldar Fischer
+ Testing hereditary properties of ordered graphs and matrices. 2017 Noga Alon
Omri Ben‐Eliezer
Eldar Fischer
+ Testing hereditary properties of ordered graphs and matrices 2017 Noga Alon
Omri Ben‐Eliezer
Eldar Fischer
+ Improved bounds for testing Dyck languages 2017 Eldar Fischer
Frédéric Magniez
Tatiana Starikovskaya
+ Improving and extending the testing of distributions for shape-restricted properties 2016 Eldar Fischer
Oded Lachish
Yadu Vasudev
+ Fast Distributed Algorithms for Testing Graph Properties 2016 Keren Censor-Hillel
Eldar Fischer
Gregory Schwartzman
Yadu Vasudev
+ PDF Chat Fast Distributed Algorithms for Testing Graph Properties 2016 Keren Censor-Hillel
Eldar Fischer
Gregory Schwartzman
Yadu Vasudev
+ PDF Chat On the Power of Conditional Samples in Distribution Testing 2016 Sourav Chakraborty
Eldar Fischer
Yonatan Goldhirsh
Arie Matsliah
+ Fast Distributed Algorithms for Testing Graph Properties 2016 Keren Censor-Hillel
Eldar Fischer
Gregory Schwartzman
Yadu Vasudev
+ Improving and extending the testing of distributions for shape-restricted properties 2016 Eldar Fischer
Oded Lachish
Yadu Vasudev
+ PDF Chat Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability 2015 Eldar Fischer
Oded Lachish
Yadu Vasudev
+ Trading query complexity for sample-based testing and multi-testing scalability 2015 Eldar Fischer
Oded Lachish
Yadu Vasudev
+ Trading query complexity for sample-based testing and multi-testing scalability 2015 Eldar Fischer
Oded Lachish
Yadu Vasudev
+ PDF Chat Every locally characterized affine-invariant property is testable 2013 Arnab Bhattacharyya
Eldar Fischer
Hamed Hatami
Pooya Hatami
Shachar Lovett
+ PDF Chat Testing Low Complexity Affine-Invariant Properties 2013 Arnab Bhattacharyya
Eldar Fischer
Shachar Lovett
+ PDF Chat On the power of conditional samples in distribution testing 2013 Sourav Chakraborty
Eldar Fischer
Yonatan Goldhirsh
Arie Matsliah
+ Some properties are not even partially testable 2013 Eldar Fischer
Yonatan Goldhirsh
Oded Lachish
+ On the Power of Conditional Samples in Distribution Testing 2012 Sourav Chakraborty
Eldar Fischer
Yonatan Goldhirsh
Arie Matsliah
+ Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching 2012 Sourav Chakraborty
Eldar Fischer
David GacaSoriano
Arie Matsliah
+ Testing Formula Satisfaction 2012 Eldar Fischer
Yonatan Goldhirsh
Oded Lachish
+ PDF Chat Testing Formula Satisfaction 2012 Eldar Fischer
Yonatan Goldhirsh
Oded Lachish
+ Every locally characterized affine-invariant property is testable 2012 Arnab Bhattacharyya
Eldar Fischer
Hamed Hatami
Pooya Hatami
Shachar Lovett
+ Testing Formula Satisfaction 2012 Eldar Fischer
Yonatan Goldhirsh
Oded Lachish
+ On the Power of Conditional Samples in Distribution Testing 2012 Sourav Chakraborty
Eldar Fischer
Yonatan Goldhirsh
Arie Matsliah
+ Testing Low Complexity Affine-Invariant Properties 2012 Arnab Bhattacharyya
Eldar Fischer
Shachar Lovett
+ Testing monotonicity of distributions over general partial orders. 2011 Arnab Bhattacharyya
Eldar Fischer
Ronitt Rubinfeld
Paul Valiant
+ PDF Chat Application of logic to combinatorial sequences and their recurrence relations 2011 Eldar Fischer
Tomer Kotek
Johann A. Makowsky
+ New Results on Quantum Property Testing 2010 Sourav Chakraborty
Eldar Fischer
Arie Matsliah
Ronald de Wolf
+ Testing monotonicity of distributions over general partial orders. 2010 Arnab Bhattacharyya
Eldar Fischer
Ronitt Rubinfeld
Paul Valiant
+ PDF Chat Approximate Hypergraph Partitioning and Applications 2010 Eldar Fischer
Arie Matsliah
A. Shapira
+ New Results on Quantum Property Testing 2010 Sourav Chakraborty
Eldar Fischer
Arie Matsliah
Ronald de Wolf
+ PDF Chat Hardness and algorithms for rainbow connection 2009 Sourav Chakraborty
Eldar Fischer
Arie Matsliah
Raphael Yuster
+ Hardness and Algorithms for Rainbow Connectivity 2009 Sourav Chakraborty
Eldar Fischer
Arie Matsliah
Raphael Yuster
+ Linear Recurrence Relations for Graph Polynomials 2008 Eldar Fischer
Johann A. Makowsky
+ Hardness and Algorithms for Rainbow Connection 2008 Sourav Chakraborty
Eldar Fischer
Arie Matsliah
Raphael Yuster
+ PDF Chat Approximate Hypergraph Partitioning and Applications 2007 Eldar Fischer
Arie Matsliah
A. Shapira
+ PDF Chat Approximate Hypergraph Partitioning and Applications 2007 Eldar Fischer
Arie Matsliah
A. Shapira
+ PDF Chat Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs 2007 Ilan Alon
Eldar Fischer
Ilan Newman
+ A combinatorial characterization of the testable graph properties 2006 Noga Alon
Eldar Fischer
Ilan Newman
A. Shapira
+ The Specker–Blatter theorem does not hold for quaternary relations 2003 Eldar Fischer
+ Parent-Identifying Codes 2001 Noga Alon
Eldar Fischer
Márió Szegedy
+ Testing graphs for colorable properties 2001 Eldar Fischer
+ Efficient Testing of Large Graphs 2000 Noga Alon
Eldar Fischer
Michael Krivelevich
Márió Szegedy
+ testing of large graphs 2000 Noga Alon
Eldar Fischer
Michael Krivelevich
Márió Szegedy
+ PDF Chat Induced Complete $h$-partite Graphs in Dense Clique-less Graphs 1999 Eldar Fischer
+ Variants of the Hajnal-Szemerédi Theorem 1999 Eldar Fischer
+ Variants of the Hajnal-Szemer�di Theorem 1999 Eldar Fischer
+ Variants of the Hajnal‐Szemerédi Theorem 1999 Eldar Fischer
+ Cycle factors in dense graphs 1999 Eldar Fischer
+ Refining the Graph Density Condition for the Existence of Almost K-factors. 1999 Noga Alon
Eldar Fischer
+ 2-factors in dense graphs 1996 Noga Alon
Eldar Fischer
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ REGULAR PARTITIONS OF GRAPHS 1975 Endre Szemerédi
15
+ PDF Chat The Algorithmic Aspects of the Regularity Lemma 1994 Noga Alon
Richard A. Duke
Hanno Lefmann
V. Rödl
Raphael Yuster
12
+ Lower bounds of tower type for Szemerédi's uniformity lemma 1997 W. T. Gowers
8
+ Szemeredi''s Regularity Lemma and its applications in graph theory 1995 János Komlós
Miklós Simonovits
8
+ PDF Chat Testing that distributions are close 2002 Tuğkan Batu
Lance Fortnow
Ronitt Rubinfeld
Warren D. Smith
Patrick White
6
+ A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data 2008 Liam Paninski
5
+ Extremal Graph Theory 1978 Béla Bollobás
5
+ Quick Approximation to Matrices and Applications 1999 Alan Frieze
Ravi Kannan
5
+ Efficient Testing of Large Graphs 2000 Noga Alon
Eldar Fischer
Michael Krivelevich
Márió Szegedy
5
+ PDF Chat Graph limits and parameter testing 2006 Christian Borgs
Jennifer Chayes
László Lovász
Vera T. Sós
Balázs Szegedy
K. Vesztergombi
5
+ On Testing Expansion in Bounded-Degree Graphs 2000 Oded Goldreich
Dana Ron
4
+ PDF Chat Testing properties of graphs and functions 2010 László Lovász
Balázs Szegedy
4
+ 2-factors in dense graphs 1996 Noga Alon
Eldar Fischer
4
+ PDF Chat AlmostH-factors in dense graphs 1992 Noga Alon
Raphael Yuster
4
+ Application of Logic and Combinatorics to Enumeration Problems 1990 E Specker
4
+ H-Factors in Dense Graphs 1996 Noga Alon
Raphael Yuster
4
+ PDF Chat Distributedly Testing Cycle-Freeness 2014 Heger Arfaoui
Pierre Fraigniaud
David Ilcinkas
Fabien Mathieu
3
+ Efficient testing of large graphs 2003 Noga Alon
Michael Krivelevich
E. Fischer
Márió Szegedy
3
+ PDF Chat The strong perfect graph theorem 2006 Maria Chudnovsky
Neil Robertson
Paul Seymour
Robin Thomas
3
+ PDF Chat The counting lemma for regular <i>k</i>‐uniform hypergraphs 2006 Brendan Nagle
Vojtěch Rödl
Mathias Schacht
3
+ A new proof of the graph removal lemma 2010 Jacob Fox
3
+ A variant of the hypergraph removal lemma 2006 Terence Tao
3
+ PDF Chat Algebraic methods in the congested clique 2016 Keren Censor-Hillel
Petteri Kaski
Janne H. Korhonen
Christoph Lenzen
Ami Paz
Jukka Suomela
3
+ Large Cuts with Local Algorithms on Triangle-Free Graphs 2014 Juho Hirvonen
Joel Rybicki
Stefan Schmid
Jukka Suomela
3
+ Graph Theory and Probability 2009 P. Erdős
3
+ Regularity Lemma for k‐uniform hypergraphs 2004 Vojtěch Rödl
Jozef Skokan
3
+ PDF Chat Szemerédi’s Lemma for the Analyst 2007 László Lovász
Balázs Szegedy
3
+ On graphs with small subgraphs of large chromatic number 1985 V. Rödl
Richard A. Duke
3
+ PDF Chat On Testing Expansion in Bounded-Degree Graphs 2011 Oded Goldreich
Dana Ron
3
+ PDF Chat “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting 2012 Danny Dolev
Christoph Lenzen
Shir Peled
2
+ PDF Chat Distributed Verification and Hardness of Distributed Approximation 2012 Atish Das Sarma
Stephan Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
2
+ Testing probability distributions using conditional samples 2012 Clément L. Canonne
Dana Ron
Rocco A. Servedio
2
+ PDF Chat Limits of dense graph sequences 2006 László Lovász
Balázs Szegedy
2
+ The counting lemma for regular k-uniform hypergraphs 2006 Brendan Nagle
Vojtěch Rödl
Mathias Schacht
2
+ An Algorithmic Regularity Lemma for Hypergraphs 2000 Andrzej Czygrinow
Vojtěch Rödl
2
+ Counting Graph Homomorphisms 2007 Christian Borgs
Jennifer Chayes
László Lovász
Vera T. Sós
K. Vesztergombi
2
+ Combinatorial Species and Tree-like Structures 1997 François Bergeron
Gilbert Labelle
Pierre Leroux
2
+ A combinatorial characterization of the testable graph properties 2006 Noga Alon
Eldar Fischer
Ilan Newman
A. Shapira
2
+ Correlation testing for affine invariant properties on F <sub>p</sub> <sup>n</sup> in the high error regime 2011 Hamed Hatami
Shachar Lovett
2
+ PDF Chat Higher-Order Fourier Analysis Of $${\mathbb{F}_{p}^n}$$ And The Complexity Of Systems Of Linear Forms 2011 Hamed Hatami
Shachar Lovett
2
+ A measure-theoretic approach to the theory of dense hypergraphs 2012 Gábor Elek
Balázs Szegedy
2
+ PDF Chat Distributed Random Walks 2013 Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
Prasad Tetali
2
+ Hypergraphs, Quasi-randomness, and Conditions for Regularity 2002 Yoshiharu Kohayakawa
Vojtěch Rödl
Jozef Skokan
2
+ PDF Chat A removal lemma for systems of linear equations over finite fields 2011 Daniel Kráľ
Oriol Serra
Lluís Vena
2
+ PDF Chat On sets of integers containing k elements in arithmetic progression 1975 Endre Szemerédi
2
+ The Specker–Blatter theorem does not hold for quaternary relations 2003 Eldar Fischer
2
+ PDF Chat A Unified Framework for Testing Linear-Invariant Properties 2010 Arnab Bhattacharyya
Elena Grigorescu
A. Shapira
2
+ PDF Chat Property Testing of Massively Parametrized Problems – A Survey 2010 Ilan Newman
2
+ The Enumeration of Locally Restricted Graphs (I) 1959 Ronald C. Read
2
+ PDF Chat Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs 2007 Ilan Alon
Eldar Fischer
Ilan Newman
2