Tim Seppelt

IT University of Copenhagen — Denmark

Computer Science · Physical Sciences

4h-index92citations27works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(10), Complexity and Algorithms in Graphs(8), Tensor decomposition and applications(5), Logic, Reasoning, and Knowledge(4), Computability, Logic, AI Algorithms(4)

Publications27 total

Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
ArXiv.org·2026Open Access
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
arXiv (Cornell University)·2026Open Access
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
Quantum·2026Open Access
Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
ArXiv.org·2026Open Access
Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
arXiv (Cornell University)·2026Open Access
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2025Open Access
The Complexity of Homomorphism Reconstructibility
ACM Transactions on Computation Theory·2025Open Access
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
arXiv (Cornell University)·2025Open Access
Homomorphism Tensors and Linear Equations
Advances in Combinatorics·2025Open Access
Symmetric Algebraic Circuits and Homomorphism Polynomials
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2025Open Access
Logical equivalences, homomorphism indistinguishability, and forbidden minors
Information and Computation·2024· 1 citedOpen Access
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
TheoretiCS·2024· 2 citedOpen Access
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
arXiv (Cornell University)·2024· 1 citedOpen Access
The Complexity of Homomorphism Reconstructibility
arXiv (Cornell University)·2023· 1 citedOpen Access
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth
arXiv (Cornell University)·2023Open Access
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability
arXiv (Cornell University)·2023Open Access
Building blocks of polycentric governance
Policy Studies Journal·2023· 63 citedOpen Access
Weisfeiler-Leman and Graph Spectra
Society for Industrial and Applied Mathematics eBooks·2023· 4 cited
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
arXiv (Cornell University)·2023· 1 citedOpen Access
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
arXiv (Cornell University)·2023· 1 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Gaurav Rattan(6), Benedikt Pago(4), Martin Grohe(3), David E. Roberson(3), Mario Angst(2), Jan Böker(2), Louis Härtel(2), Nina Runde(2), Prateek Dwivedi(2), Eva Fluck(2), Gian Luca Spitzer(2), Cornelius Brand(2), Radu Curticapean(2), Petteri Kaski(2), Baitian Li(2), Ian Orzel(2), Jiaheng Wang(2), Tiffany H. Morrison(1), Örjan Bodin(1), Graeme S. Cumming(1)