Tim Seppelt

32 papers A* 4A 3B 4Journal 21
YearRankTypeTitle / Venue / Authors
2026 J jnl
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
CoRR
Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026 J jnl
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
Electron. Colloquium Comput. Complex.
Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026 J jnl
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs.
CoRR
Daniel Neuen, Tim Seppelt
2026 A conf
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing.
STACS
Marek Cerný, Tim Seppelt
2026 J jnl
Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials.
CoRR
Prateek Dwivedi, Benedikt Pago, Tim Seppelt
2026 J jnl
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.
Quantum
Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman
2026 A conf
Symmetric Algebraic Circuits and Homomorphism Polynomials.
ITCS
Anuj Dawar, Benedikt Pago, Tim Seppelt
2026 J jnl
The Complexity of Homomorphism Reconstructibility.
ACM Trans. Comput. Theory
Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke
2025 J jnl
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth.
CoRR
Isolde Adler, Eva Fluck, Tim Seppelt, Gian Luca Spitzer
2025 J jnl
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing.
CoRR
Marek Cerný, Tim Seppelt
2025 A* conf
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.
ICALP
Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman
2025 J jnl
Symmetric Algebraic Circuits and Homomorphism Polynomials.
CoRR
Anuj Dawar, Benedikt Pago, Tim Seppelt
2024 B conf
An Algorithmic Meta Theorem for Homomorphism Indistinguishability.
MFCS
Tim Seppelt
2024 J jnl
An Algorithmic Meta Theorem for Homomorphism Indistinguishability.
CoRR
Tim Seppelt
2024 B conf
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth.
CSL
Eva Fluck, Tim Seppelt, Gian Luca Spitzer
2024 J jnl
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.
TheoretiCS
David E. Roberson, Tim Seppelt
2024 B conf
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.
CSL
Moritz Lichter, Benedikt Pago, Tim Seppelt
2024 J jnl
Logical equivalences, homomorphism indistinguishability, and forbidden minors.
Inf. Comput.
Tim Seppelt
2024 J jnl
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.
CoRR
Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman
2024 A conf
The Complexity of Homomorphism Reconstructibility.
STACS
Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke
2023 J jnl
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth.
CoRR
Eva Fluck, Tim Seppelt, Gian Luca Spitzer
2023 A* conf
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.
ICALP
David E. Roberson, Tim Seppelt
2023 J jnl
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.
CoRR
David E. Roberson, Tim Seppelt
2023 J jnl
Limitations of Game Comonads via Homomorphism Indistinguishability.
CoRR
Moritz Lichter, Benedikt Pago, Tim Seppelt
2023 B conf
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors.
MFCS
Tim Seppelt
2023 J jnl
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors.
CoRR
Tim Seppelt
2023 J jnl
The Complexity of Homomorphism Reconstructibility.
CoRR
Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke
2023 A* conf
Weisfeiler-Leman and Graph Spectra.
SODA
Gaurav Rattan, Tim Seppelt
2022 A* conf
Homomorphism Tensors and Linear Equations.
ICALP
Martin Grohe, Gaurav Rattan, Tim Seppelt
2021 J jnl
Homomorphism Tensors and Linear Equations.
CoRR
Martin Grohe, Gaurav Rattan, Tim Seppelt
2021 J jnl
Weisfeiler-Leman, Graph Spectra, and Random Walks.
CoRR
Gaurav Rattan, Tim Seppelt
2019 J jnl
The Graph Isomorphism Problem: Local Certificates for Giant Action.
CoRR
Tim Seppelt