Moritz Müller

According to our database1, Moritz Müller
  • authored at least 43 papers between 2006 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
The Parameterized Space Complexity of Embedding Along a Path.
Theory Comput. Syst., 2017

The treewidth of proofs.
Inf. Comput., 2017

The parameterized space complexity of model-checking bounded variable first-order logic.
CoRR, 2017

Domain names abuse and TLDs: From monetization towards mitigation.
Proceedings of the 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM), 2017

2016
The parameterized space complexity of embedding along a path.
CoRR, 2016

Cobham recursive set functions.
Ann. Pure Appl. Logic, 2016

ENTRADA: A high-performance network traffic data streaming warehouse.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

nDEWS: A new domains early warning system for TLDs.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Anycast vs. DDoS: Evaluating the November 2015 Root DNS Event.
Proceedings of the 2016 ACM on Internet Measurement Conference, 2016

ENTRADA: enabling DNS big data applications.
Proceedings of the 2016 APWG Symposium on Electronic Crime Research, 2016

2015
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space.
TOCT, 2015

Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle.
J. Symb. Log., 2015

Partially definable forcing and bounded arithmetic.
Arch. Math. Log., 2015

2014
Hard Instances of Algorithms and Proof Systems.
TOCT, 2014

Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Parameterized Random Complexity.
Theory Comput. Syst., 2013

Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle.
Electronic Colloquium on Computational Complexity (ECCC), 2013

One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries.
CoRR, 2013

The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity.
CoRR, 2013

Consistency, optimality, and incompleteness.
Ann. Pure Appl. Logic, 2013

Saving Energy in Production Using Mobile Services.
Proceedings of the Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

The fine classification of conjunctive queries and parameterized logarithmic space complexity.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle.
Proceedings of the 28th Conference on Computational Complexity, 2013

2012
Some definitorial suggestions for parameterized proof complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2012

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
Logical Methods in Computer Science, 2012

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Some Definitorial Suggestions for Parameterized Proof Complexity.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Hard Instances of Algorithms and Proof Systems.
Proceedings of the How the World Computes, 2012

2011
Lower Bounds for Kernelizations and Other Preprocessing Procedures.
Theory Comput. Syst., 2011

Strong isomorphism reductions in complexity theory.
J. Symb. Log., 2011

Hard instances of algorithms and proof systems.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Consistency and Optimality.
Proceedings of the Models of Computation in Context, 2011

2010
W-Hierarchies Defined by Symmetric Gates.
Theory Comput. Syst., 2010

2009
Lower Bounds for Kernelizations and Other Preprocessing Procedures.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Valiant-Vazirani Lemmata for Various Logics.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Parameterized Derandomization.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

A Purely Democratic Characterization of W[1].
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

2007
Lower Bounds for Kernelizations.
Electronic Colloquium on Computational Complexity (ECCC), 2007

Approximating Solution Structure.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

2006
Randomized Approximations of Parameterized Counting Problems.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006


  Loading...