Moritz Müller

Cited by

	All	Since 2017
Citations	351	183
h-index	12	7
i10-index	17	6

20072008200920102011201220132014201520162017201820192020202120222 11 6 3 23 19 29 23 18 24 34 16 37 39 42 11

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
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Sam BussProfessor of Mathematics and Computer ScienceVerified email at ucsd.edu
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Arnold BeckmannProfessor of Computer Science, Swansea UniversityVerified email at swansea.ac.uk
Todd WarehamProfessor of Computer Science, Memorial University of NewfoundlandVerified email at mun.ca
Neil ThapenResearcher, Institute of Mathematics, Czech Academy of SciencesVerified email at math.cas.cz
Ján PichUniversity of OxfordVerified email at cs.ox.ac.uk
Jan MalyPostdoc, ILLC, University of AmsterdamVerified 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áczAssociate professor, University of DebrecenVerified email at science.unideb.hu
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Keita YOKOYAMATohoku UniversityVerified email at tohoku.ac.jp
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
Lower bounds for kernelizations and other preprocessing procedures Y Chen, J Flum, M Müller Theory of Computing Systems 48 (4), 803-839, 2011	34	2011
Automating Resolution is NP-hard. A Atserias, M Müller Journal of the ACM 67 (5), Article No.: 31, 2020	27	2020
Feasibly constructive proofs of succinct weak circuit lower bounds M Müller, J Pich Annals of Pure and Applied Logic 171 (2), 102735, 2020	23	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	18	2015
Parameterized random complexity JA Montoya, M Müller Theory of Computing Systems 52 (2), 221-270, 2013	18	2013
Parameterized derandomization M Müller International Workshop on Parameterized and Exact Computation, 148-159, 2008	18	2008
Topological dynamics of unordered Ramsey structures M Müller, A Pongrácz Fundamenta Mathematicae 230 (1), 77-98, 2015	17	2015
Approximating solution structure M Hamilton, M Müller, I Van Rooij, T Wareham Internat. Begegnungs-und Forschungszentrum für Informatik, 2007	17	2007
Randomized approximations of parameterized counting problems M Müller International Workshop on Parameterized and Exact Computation, 50-59, 2006	17	2006
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	15	2017
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	14	2011
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	14	2009
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	12	2015
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	12	2014
Valiant-Vazirani lemmata for various logics M Müller Electronic Colloquium on Computational Complexity (ECCC) 15 (063), 2008	11	2008
Partially definable forcing and bounded arithmetic A Atserias, M Müller Archive for mathematical logic 54 (1-2), 1-33, 2015	10	2015
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	10	2010
Lower bounds for kernelizations Y Chen, J Flum, M Müller Centre de Recerca Matemàtica, 2008	9	2008
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	8	2013
A purely democratic characterization of W [1] M Fellows, D Hermelin, M Müller, F Rosamond International Workshop on Parameterized and Exact Computation, 103-114, 2008	7	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 this author

Cited by

Co-authors