Eldar Fischer
According to our database1,
Eldar Fischer
authored at least 72 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024
2023
2022
Electron. Colloquium Comput. Complex., 2022
Proceedings of the Approximation, 2022
2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
2019
Improving and Extending the Testing of Distributions for Shape-Restricted Properties.
Algorithmica, 2019
2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
Electron. Colloquium Comput. Complex., 2017
2016
2015
Electron. Colloquium Comput. Complex., 2015
2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
2013
Electron. Colloquium Comput. Complex., 2013
2012
ACM Trans. Algorithms, 2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the 27th Conference on Computational Complexity, 2012
2011
Comput. Complex., 2011
Proceedings of the Database Theory, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
2009
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity.
SIAM J. Comput., 2009
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
Application of logic to combinatorial sequences and their recurrence relations.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009
2008
Discret. Appl. Math., 2008
Proceedings of the Pillars of Computer Science, 2008
2007
SIAM J. Comput., 2007
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects.
Proceedings of the Approximation, 2007
2006
Electron. Colloquium Comput. Complex., 2006
2005
SIAM J. Comput., 2005
2004
Functions that have read-twice constant width branching programs are not necessarily testable.
Random Struct. Algorithms, 2004
J. Symb. Log., 2004
Electron. Colloquium Comput. Complex., 2004
Electron. Colloquium Comput. Complex., 2004
2003
J. Comb. Theory A, 2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002
2001
Electron. Colloquium Comput. Complex., 2001
The Art of Uninformed Decisions.
Bull. EATCS, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
2000
Electron. Colloquium Comput. Complex., 2000
1999
Electron. J. Comb., 1999
Refining the Graph Density Condition for the Existence of Almost K-factors.
Ars Comb., 1999
1998
Electron. Colloquium Comput. Complex., 1998
1996