default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoritz Müller
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Tobias Zeulner
, Gerhard Hagerer, Moritz Müller, Ignacio Vazquez, Peter A. Gloor:
Predicting Individual Well-Being in Teamwork Contexts Based on Speech Features. Inf. 15(4): 217 (2024)- [c34]Santo V. Salinas, Tan Li, Fernando Santos, Soo Chin Liew, Moritz Müller, Wee Cheah:
A Multi-Site Photometric Analysis of Biomass Burning Activity in South-East Asia During October 2023. IGARSS 2024: 5620-5623 - [c33]Raffaele Sommese, Gautam Akiwate, Antonia Affinito, Moritz Müller, Mattijs Jonker, kc claffy:
DarkDNS: Revisiting the Value of Rapid Zone Update. IMC 2024: 454-461 - [c32]Ebrima Jaw, Moritz Müller, Cristian Hesselman, Lambert J. M. Nieuwenhuis:
Serial BGP Hijackers: A Reproducibility Study and Assessment of Current Dynamics. TMA 2024: 1-10 - [i20]John Kristoff, Moritz Müller, Arturo Filastò, Max Resing, Chris Kanich, Niels ten Oever:
Internet Sanctions on Russian Media: Actions and Effects. CoRR abs/2403.05638 (2024) - [i19]Raffaele Sommese, Gautam Akiwate, Antonia Affinito, Moritz Müller, Mattijs Jonker, kc claffy:
DarkDNS: Revisiting the Value of Rapid Zone Update. CoRR abs/2405.12010 (2024) - 2023
- [j30]Moritz Müller:
Jan Krajìček, Proof Complexity, Encyclopedia of Mathematics and Its Applications, no. 170, Cambridge University Press, Cambridge, UK, 2019, xvi + 516 pp. Bull. Symb. Log. 29(2): 296-297 (2023) - [c31]Jonathan Magnusson, Moritz Müller, Anna Brunström, Tobias Pulls:
A Second Look at DNS QNAME Minimization. PAM 2023: 496-521 - [c30]Albert Atserias, Sam Buss, Moritz Müller:
On the Consistency of Circuit Lower Bounds for Non-deterministic Time. STOC 2023: 1257-1270 - [i18]Albert Atserias, Sam Buss, Moritz Müller:
On the Consistency of Circuit Lower Bounds for Non-Deterministic Time. CoRR abs/2303.01016 (2023) - [i17]Moritz Müller, Joost J. Joosten:
Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561. CoRR abs/2307.05658 (2023) - [i16]Stefano Bianchini, Moritz Müller, Pierre Pelletier:
Integrating New Technologies into Science: The case of AI. CoRR abs/2312.09843 (2023) - 2022
- [j29]Olivier van der Toorn, Moritz Müller, Sara Dickinson, Cristian Hesselman, Anna Sperotto, Roland van Rijswijk-Deij:
Addressing the challenges of modern DNS a comprehensive tutorial. Comput. Sci. Rev. 45: 100469 (2022) - [j28]Yijia Chen, Jörg Flum, Moritz Müller:
A Surprising Relationship Between Descriptive Complexity and Proof Complexity. Bull. EATCS 138 (2022) - [j27]Moritz Müller:
Spreading the word? European Union agencies and social media attention. Gov. Inf. Q. 39(2): 101682 (2022) - [j26]Neil Barton, Moritz Müller, Mihai Prunescu:
On Representations of Intended Structures in Foundational Theories. J. Philos. Log. 51(2): 283-296 (2022) - [c29]Hyeonmin Lee, Md. Ishtiaq Ashiq, Moritz Müller, Roland van Rijswijk-Deij, Ted Taekyoung Kwon, Taejoong Chung:
Under the Hood of DANE Mismanagement in SMTP. USENIX Security Symposium 2022: 1-16 - [i15]Yijia Chen, Moritz Müller, Keita Yokoyama:
A parameterized halting problem, Δ0 truth and the MRDP theorem. CoRR abs/2211.06121 (2022) - 2021
- [j25]Moritz Müller:
Typical forcings, NP search problems and an extension of a theorem of Riis. Ann. Pure Appl. Log. 172(4): 102930 (2021) - [j24]Nagur Cherukuru, Patrick Martin, Nivedita Sanwlani, Aazani Mujahid, Moritz Müller:
A Semi-Analytical Optical Remote Sensing Model to Estimate Suspended Sediment and Dissolved Organic Carbon in Tropical Coastal Waters Influenced by Peatland-Draining River Discharges off Sarawak, Borneo. Remote. Sens. 13(1): 99 (2021) - [c28]Giovane C. M. Moura, Moritz Müller, Marco Davids, Maarten Wullink, Cristian Hesselman:
Fragmentation, Truncation, and Timeouts: Are Large DNS Messages Falling to Bits? PAM 2021: 460-477 - 2020
- [j23]Jan Bydzovsky, Moritz Müller:
Polynomial time ultrapowers and the consistency of circuit lower bounds. Arch. Math. Log. 59(1-2): 127-147 (2020) - [j22]Moritz Müller, Ján Pich:
Feasibly constructive proofs of succinct weak circuit lower bounds. Ann. Pure Appl. Log. 171(2) (2020) - [j21]Moritz Müller, Jins de Jong, Maran van Heesch, Benno J. Overeinder, Roland van Rijswijk-Deij:
Retrofitting post-quantum cryptography in internet protocols: a case study of DNSSEC. Comput. Commun. Rev. 50(4): 49-57 (2020) - [j20]Albert Atserias, Moritz Müller:
Automating Resolution is NP-Hard. J. ACM 67(5): 31:1-31:17 (2020) - [j19]Sim ChunHock, Nagur Cherukuru, Aazani Mujahid, Patrick Martin, Nivedita Sanwlani, Thorsten Warneke, Tim Rixen, Justus Notholt, Moritz Müller:
A New Remote Sensing Method to Estimate River to Ocean DOC Flux in Peatland Dominated Sarawak Coastal Regions, Borneo. Remote. Sens. 12(20): 3380 (2020) - [c27]Moritz Müller, Willem Toorop, Taejoong Chung, Jelte Jansen, Roland van Rijswijk-Deij:
The Reality of Algorithm Agility: Studying the DNSSEC Algorithm Life-Cycle. Internet Measurement Conference 2020: 295-308 - [i14]Stefano Bianchini, Moritz Müller, Pierre Pelletier:
Deep Learning in Science. CoRR abs/2009.01575 (2020)
2010 – 2019
- 2019
- [j18]Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Feasible set functions have small circuits. Comput. 8(1): 67-98 (2019) - [j17]Yijia Chen, Michael Elberfeld, Moritz Müller:
The parameterized space complexity of model-checking bounded variable first-order logic. Log. Methods Comput. Sci. 15(3) (2019) - [j16]Moritz Müller, Taejoong Chung, Alan Mislove, Roland van Rijswijk-Deij:
Rolling With Confidence: Managing the Complexity of DNSSEC Operations. IEEE Trans. Netw. Serv. Manag. 16(3): 1199-1211 (2019) - [c26]Albert Atserias, Moritz Müller:
Automating Resolution is NP-Hard. FOCS 2019: 498-509 - [c25]Moritz Müller, Matthew Thomas, Duane Wessels, Wes Hardaker, Taejoong Chung, Willem Toorop, Roland van Rijswijk-Deij:
Roll, Roll, Roll your Root: A Comprehensive Analysis of the First Ever DNSSEC Root KSK Rollover. Internet Measurement Conference 2019: 1-14 - [c24]Wouter B. de Vries, Quirin Scheitle, Moritz Müller, Willem Toorop, Ralph Dolmans, Roland van Rijswijk-Deij:
A First Look at QNAME Minimization in the Domain Name System. PAM 2019: 147-160 - [i13]Albert Atserias, Moritz Müller:
Automating Resolution is NP-Hard. CoRR abs/1904.02991 (2019) - 2018
- [j15]Jan Maly, Moritz Müller:
A remark on pseudo proof systems and hard instances of the satisfiability problem. Math. Log. Q. 64(6): 418-428 (2018) - [c23]Moritz Müller, Roland van Rijswijk-Deij:
Towards an Independent and Resilient DNS. AIMS 2018: 60-64 - [c22]Giovane C. M. Moura, John S. Heidemann, Moritz Müller, Ricardo de Oliveira Schmidt, Marco Davids:
When the Dike Breaks: Dissecting DNS Defenses During DDoS. Internet Measurement Conference 2018: 8-21 - [c21]Yijia Chen, Moritz Müller, Keita Yokoyama:
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem. LICS 2018: 235-244 - 2017
- [j14]Moritz Müller, Stefan Szeider:
The treewidth of proofs. Inf. Comput. 255: 147-164 (2017) - [j13]Hubie Chen, Moritz Müller:
The Parameterized Space Complexity of Embedding Along a Path. Theory Comput. Syst. 61(3): 851-870 (2017) - [j12]Hubie Chen, Moritz Müller:
One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. ACM Trans. Comput. Log. 18(4): 29:1-29:37 (2017) - [c20]Giovane C. M. Moura, Moritz Müller, Marco Davids, Maarten Wullink, Cristian Hesselman:
Domain names abuse and TLDs: From monetization towards mitigation. IM 2017: 1077-1082 - [c19]Moritz Müller, Giovane C. M. Moura, Ricardo de Oliveira Schmidt, John S. Heidemann:
Recursives in the wild: engineering authoritative DNS servers. Internet Measurement Conference 2017: 489-495 - [i12]Yijia Chen, Michael Elberfeld, Moritz Müller:
The parameterized space complexity of model-checking bounded variable first-order logic. CoRR abs/1703.01860 (2017) - [i11]Moritz Müller, Ján Pich:
Feasibly constructive proofs of succinct weak circuit lower bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j11]Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Cobham recursive set functions. Ann. Pure Appl. Log. 167(3): 335-369 (2016) - [c18]Maarten Wullink, Moritz Müller, Marco Davids, Giovane C. M. Moura, Cristian Hesselman:
ENTRADA: enabling DNS big data applications. eCrime 2016: 14-24 - [c17]Giovane C. M. Moura, Ricardo de Oliveira Schmidt, John S. Heidemann, Wouter B. de Vries, Moritz Müller, Lan Wei, Cristian Hesselman:
Anycast vs. DDoS: Evaluating the November 2015 Root DNS Event. Internet Measurement Conference 2016: 255-270 - [c16]Maarten Wullink, Giovane C. M. Moura, Moritz Müller, Cristian Hesselman:
ENTRADA: A high-performance network traffic data streaming warehouse. NOMS 2016: 913-918 - [c15]Giovane C. M. Moura, Moritz Müller, Maarten Wullink, Cristian Hesselman:
nDEWS: A new domains early warning system for TLDs. NOMS 2016: 1061-1066 - [i10]Hubie Chen, Moritz Müller:
The parameterized space complexity of embedding along a path. CoRR abs/1602.09022 (2016) - 2015
- [j10]Albert Atserias, Moritz Müller:
Partially definable forcing and bounded arithmetic. Arch. Math. Log. 54(1-2): 1-33 (2015) - [j9]Albert Atserias, Moritz Müller, Sergi Oliva:
Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle. J. Symb. Log. 80(2): 450-476 (2015) - [j8]Hubie Chen, Moritz Müller:
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. ACM Trans. Comput. Theory 7(2): 7:1-7:27 (2015) - 2014
- [j7]Yijia Chen, Jörg Flum, Moritz Müller:
Hard Instances of Algorithms and Proof Systems. ACM Trans. Comput. Theory 6(2): 7:1-7:25 (2014) - [c14]Hubie Chen, Moritz Müller:
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. CSL-LICS 2014: 32:1-32:10 - [c13]Yijia Chen, Moritz Müller:
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem. MFCS (1) 2014: 183-195 - 2013
- [j6]Yijia Chen, Jörg Flum, Moritz Müller:
Consistency, optimality, and incompleteness. Ann. Pure Appl. Log. 164(12): 1224-1235 (2013) - [j5]Juan Andrés Montoya, Moritz Müller:
Parameterized Random Complexity. Theory Comput. Syst. 52(2): 221-270 (2013) - [c12]Albert Atserias, Moritz Müller, Sergi Oliva:
Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle. CCC 2013: 109-120 - [c11]Moritz Müller, Stefan Szeider:
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. MFCS 2013: 704-716 - [c10]Hubie Chen, Moritz Müller:
The fine classification of conjunctive queries and parameterized logarithmic space complexity. PODS 2013: 309-320 - [c9]Christopher Ruff, Uwe Laufs, Moritz Müller, Jan Zibuschka:
Saving Energy in Production Using Mobile Services. Software Engineering (Workshops) 2013: 355-361 - [i9]Hubie Chen, Moritz Müller:
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity. CoRR abs/1306.5424 (2013) - [i8]Hubie Chen, Moritz Müller:
One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. CoRR abs/1307.1353 (2013) - [i7]Albert Atserias, Moritz Müller, Sergi Oliva:
Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle. Electron. Colloquium Comput. Complex. TR13 (2013) - [i6]Moritz Müller, Stefan Szeider:
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j4]Hubie Chen, Moritz Müller:
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. Log. Methods Comput. Sci. 9(1) (2012) - [c8]Yijia Chen, Jörg Flum, Moritz Müller:
Hard Instances of Algorithms and Proof Systems. CiE 2012: 118-128 - [c7]Jörg Flum, Moritz Müller:
Some Definitorial Suggestions for Parameterized Proof Complexity. IPEC 2012: 73-84 - [c6]Hubie Chen, Moritz Müller:
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. LICS 2012: 215-224 - [i5]Jörg Flum, Moritz Müller:
Some definitorial suggestions for parameterized proof complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j3]Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller:
Strong isomorphism reductions in complexity theory. J. Symb. Log. 76(4): 1381-1402 (2011) - [j2]Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. 48(4): 803-839 (2011) - [c5]Yijia Chen, Jörg Flum, Moritz Müller:
Consistency and Optimality. CiE 2011: 61-70 - [i4]Yijia Chen, Jörg Flum, Moritz Müller:
Hard instances of algorithms and proof systems. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j1]Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010)
2000 – 2009
- 2009
- [c4]Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. CiE 2009: 118-128 - 2008
- [c3]Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114 - [c2]Moritz Müller:
Parameterized Derandomization. IWPEC 2008: 148-159 - [i3]Moritz Müller:
Valiant-Vazirani Lemmata for Various Logics. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i2]Iris van Rooij, Matthew Hamilton, Moritz Müller, Todd Wareham:
Approximating Solution Structure. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - [i1]Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c1]Moritz Müller:
Randomized Approximations of Parameterized Counting Problems. IWPEC 2006: 50-59
Coauthor Index
aka: Giovane C. M. Moura
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
