Moritz Müller

Cited by

	All	Since 2019
Citations	448	216
h-index	14	8
i10-index	17	5

2008200920102011201220132014201520162017201820192020202120222023202412 5 5 27 22 29 24 20 25 36 15 42 36 37 29 35 37

Public access

View all

24 articles

1 article

available

not available

Based on funding mandates

Co-authors

Yijia ChenShanghai Jiao Tong UniversityVerified email at cs.sjtu.edu.cn
Albert AtseriasUniversitat Politècnica de Catalunya, BarcelonaVerified email at cs.upc.edu
Sam BussProfessor of Mathematics and Computer ScienceVerified email at ucsd.edu
Todd WarehamProfessor of Computer Science, Memorial University of NewfoundlandVerified email at mun.ca
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaVerified email at lau.edu.lb
Arnold BeckmannProfessor of Computer Science, Swansea UniversityVerified email at swansea.ac.uk
Ján PichUniversity of OxfordVerified email at cs.ox.ac.uk
Neil ThapenResearcher, Institute of Mathematics, Czech Academy of SciencesVerified email at math.cas.cz
Keita YOKOYAMATohoku UniversityVerified email at tohoku.ac.jp
Jan MalyAssistant Professor, Vienna University of Economics and BusinessVerified email at dbai.tuwien.ac.at
Juan Andres MontoyaMatematicas, universidad nacional sede BogotaVerified email at unal.edu.co
Matthew HamiltonAssistant Professor of Computer Science, Memorial UniversityVerified email at mun.ca
András PongráczResearch fellow, Alfréd Rényi Institute of MathematicsVerified email at renyi.hu
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Michael ElberfeldTHM GießenVerified email at mni.thm.de
Jason GedgeVerified email at gedge.ca

Moritz Müller

Unknown affiliation

Verified email at uni-passau.de

Mathematical Logic Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Automating Resolution is NP-hard. A Atserias, M Müller Journal of the ACM 67 (5), Article No.: 31, 2020	53	2020
Lower Bounds for Kernelizations and Other Preprocessing Procedures Y Chen, J Flum, M Müller CiE’09: Proceedings of the 5th Conference, 118-128, 2009	49	2009
Feasibly constructive proofs of succinct weak circuit lower bounds M Müller, J Pich Annals of Pure and Applied Logic 171 (2), 102735, 2020	36	2020
The fine classification of conjunctive queries and parameterized logarithmic space H Chen, M Müller ACM Transactions on Computation Theory (TOCT) 7 (2), 1-27, 2015	21	2015
Parameterized random complexity JA Montoya, M Müller Theory of Computing Systems 52, 221-270, 2013	21	2013
Parameterized derandomization M Müller Parameterized and Exact Computation: Third International Workshop, IWPEC …, 2008	18	2008
Randomized approximations of parameterized counting problems M Müller Parameterized and Exact Computation: Second International Workshop, IWPEC …, 2006	18	2006
Topological dynamics of unordered Ramsey structures M Müller, A Pongrácz Fundamenta Mathematicae 230 (1), 77-98, 2015	17	2015
Approximating solution structure I van Rooij, M Hamilton, M Müller, T Wareham Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2007	17	2007
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries H Chen, M Müller ACM Transactions on Computational Logic (TOCL) 18 (4), 1-37, 2017	16	2017
Lower bounds for DNF-refutations of a relativized weak pigeonhole principle A Atserias, M Müller, S Oliva The Journal of Symbolic Logic 80 (2), 450-476, 2015	16	2015
Partially definable forcing and bounded arithmetic A Atserias, M Müller Archive for Mathematical Logic 54 (1-2), 1-33, 2015	16	2015
Similarity as tractable transformation M Mueller, T Wareham, I Van Rooij Proceedings of the Annual Meeting of the Cognitive Science Society 31 (31), 2009	16	2009
Strong isomorphism reductions in complexity theory S Buss, Y Chen, J Flum, SD Friedman, M Müller The Journal of Symbolic Logic 76 (4), 1381-1402, 2011	15	2011
Hard instances of algorithms and proof systems Y Chen, J Flum, M Müller ACM Transactions on Computation Theory (TOCT) 6 (2), 1-25, 2014	11	2014
W-hierarchies defined by symmetric gates M Fellows, J Flum, D Hermelin, M Müller, F Rosamond Theory of Computing Systems 46 (2), 311-339, 2010	11	2010
Valiant-Vazirani lemmata for various logics M Müller Electronic Colloquium on Computational Complexity (ECCC) 15 (063), 2008	11	2008
Polynomial time ultrapowers and the consistency of circuit lower bounds J Bydžovský, M Müller Archive for Mathematical Logic 59 (1), 127-147, 2020	9	2020
The fine classification of conjunctive queries and parameterized logarithmic space complexity H Chen, M Müller Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2013	9	2013
Lower bounds for kernelizations Y Chen, J Flum, M Müller Centre de Recerca Matemàtica, 2008	9	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors