Moritz Müller

Bull. Symb. Log., June, 2023

Integrating New Technologies into Science: The case of AI.

[BibT_eX]

[DOI]

Stefano Bianchini

Pierre Pelletier

CoRR, 2023

Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561.

[BibT_eX]

[DOI]

Joost J. Joosten

CoRR, 2023

On the Consistency of Circuit Lower Bounds for Non-deterministic Time.

[BibT_eX]

[DOI]

Sam Buss

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A Second Look at DNS QNAME Minimization.

[BibT_eX]

[DOI]

Proceedings of the Passive and Active Measurement - 24th International Conference, 2023

2022

On Representations of Intended Structures in Foundational Theories.

[BibT_eX]

[DOI]

Neil Barton

Mihai Prunescu

J. Philos. Log., 2022

Spreading the word? European Union agencies and social media attention.

[BibT_eX]

[DOI]

Gov. Inf. Q., 2022

A Surprising Relationship Between Descriptive Complexity and Proof Complexity.

[BibT_eX]

[DOI]

Jörg Flum

Bull. EATCS, 2022

Addressing the challenges of modern DNS a comprehensive tutorial.

[BibT_eX]

[DOI]

Olivier van der Toorn

Comput. Sci. Rev., 2022

A parameterized halting problem, Δ<sub>0</sub> truth and the MRDP theorem.

[BibT_eX]

[DOI]

Keita Yokoyama

CoRR, 2022

Under the Hood of DANE Mismanagement in SMTP.

[BibT_eX]

[DOI]

Hyeonmin Lee

Md. Ishtiaq Ashiq

Ted Taekyoung Kwon

Taejoong Chung

Proceedings of the 31st USENIX Security Symposium, 2022

2021

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.

[BibT_eX]

[DOI]

Remote. Sens., 2021

Typical forcings, NP search problems and an extension of a theorem of Riis.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2021

Fragmentation, Truncation, and Timeouts: Are Large DNS Messages Falling to Bits?

[BibT_eX]

[DOI]

Proceedings of the Passive and Active Measurement - 22nd International Conference, 2021

2020

A New Remote Sensing Method to Estimate River to Ocean DOC Flux in Peatland Dominated Sarawak Coastal Regions, Borneo.

[BibT_eX]

[DOI]

Remote. Sens., 2020

Automating Resolution is NP-Hard.

[BibT_eX]

[DOI]

J. ACM, 2020

Deep Learning in Science.

[BibT_eX]

[DOI]

Stefano Bianchini

Pierre Pelletier

CoRR, 2020

Retrofitting post-quantum cryptography in internet protocols: a case study of DNSSEC.

[BibT_eX]

[DOI]

Comput. Commun. Rev., 2020

Polynomial time ultrapowers and the consistency of circuit lower bounds.

[BibT_eX]

[DOI]

Jan Bydzovsky

Arch. Math. Log., 2020

The Reality of Algorithm Agility: Studying the DNSSEC Algorithm Life-Cycle.

[BibT_eX]

[DOI]

Proceedings of the IMC '20: ACM Internet Measurement Conference, 2020

2019

Rolling With Confidence: Managing the Complexity of DNSSEC Operations.

[BibT_eX]

[DOI]

Taejoong Chung

Alan Mislove

IEEE Trans. Netw. Serv. Manag., 2019

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

[BibT_eX]

[DOI]

Michael Elberfeld

Log. Methods Comput. Sci., 2019

Feasible set functions have small circuits.

[BibT_eX]

[DOI]

Comput., 2019

A First Look at QNAME Minimization in the Domain Name System.

[BibT_eX]

[DOI]

Proceedings of the Passive and Active Measurement - 20th International Conference, 2019

Roll, Roll, Roll your Root: A Comprehensive Analysis of the First Ever DNSSEC Root KSK Rollover.

[BibT_eX]

[DOI]

Proceedings of the Internet Measurement Conference, 2019

2018

A remark on pseudo proof systems and hard instances of the satisfiability problem.

[BibT_eX]

[DOI]

Jan Maly

Math. Log. Q., 2018

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem.

[BibT_eX]

[DOI]

Keita Yokoyama

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

When the Dike Breaks: Dissecting DNS Defenses During DDoS.

[BibT_eX]

[DOI]

Giovane C. M. Moura

John S. Heidemann

Ricardo de Oliveira Schmidt

Marco Davids

Proceedings of the Internet Measurement Conference 2018, 2018

Towards an Independent and Resilient DNS.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Autonomous Infrastructure, 2018

2017

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

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

The Parameterized Space Complexity of Embedding Along a Path.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

The treewidth of proofs.

[BibT_eX]

[DOI]

Stefan Szeider

Inf. Comput., 2017

Feasibly constructive proofs of succinct weak circuit lower bounds.

[BibT_eX]

[DOI]

Ján Pich

Electron. Colloquium Comput. Complex., 2017

Recursives in the wild: engineering authoritative DNS servers.

[BibT_eX]

[DOI]

Ricardo de Oliveira Schmidt

Giovane C. M. Moura

John S. Heidemann

Proceedings of the 2017 Internet Measurement Conference, 2017

Domain names abuse and TLDs: From monetization towards mitigation.

[BibT_eX]

[DOI]

Proceedings of the 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM), 2017

2016

Cobham recursive set functions.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

ENTRADA: A high-performance network traffic data streaming warehouse.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

nDEWS: A new domains early warning system for TLDs.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Anycast vs. DDoS: Evaluating the November 2015 Root DNS Event.

[BibT_eX]

[DOI]

Giovane C. M. Moura

Ricardo de Oliveira Schmidt

Proceedings of the 2016 ACM on Internet Measurement Conference, 2016

ENTRADA: enabling DNS big data applications.

[BibT_eX]

[DOI]

Proceedings of the 2016 APWG Symposium on Electronic Crime Research, 2016

2015

The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2015

Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle.

[BibT_eX]

[DOI]

Sergi Oliva

J. Symb. Log., 2015

Partially definable forcing and bounded arithmetic.

[BibT_eX]

[DOI]

Arch. Math. Log., 2015

2014

Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Parameterized Random Complexity.

[BibT_eX]

[DOI]

Juan Andrés Montoya

Theory Comput. Syst., 2013

Revisiting Space in Proof Complexity: Treewidth and Pathwidth.

[BibT_eX]

[DOI]

Stefan Szeider

Electron. Colloquium Comput. Complex., 2013

Consistency, optimality, and incompleteness.

[BibT_eX]

[DOI]

Jörg Flum

Ann. Pure Appl. Log., 2013

Saving Energy in Production Using Mobile Services.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

2012

Some definitorial suggestions for parameterized proof complexity.

[BibT_eX]

[DOI]

Jörg Flum