Pascal Bergsträßer

According to our database, Pascal Bergsträßer authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Length Generalization Bounds for Transformers.

Andy Yang, Pascal Bergsträßer, Georg Zetzsche, David Chiang, Anthony W. Lin

CoRR, March, 2026

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking).

Kilian Lichtner, Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2026

2025

Transformers are Inherently Succinct.

Pascal Bergsträßer, Ryan Cotterell, Anthony W. Lin

CoRR, October, 2025

Ramsey Quantifiers in First-Order Logic: Complexity and Applications to Verification.

Pascal Bergsträßer

PhD thesis, 2025

2024

Ramsey Quantifiers in Linear Arithmetics.

Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche

Proc. ACM Program. Lang., January, 2024

The Power of Hard Attention Transformers on Data Sequences: A formal language theoretic perspective.

Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

Revisiting Membership Problems in Subclasses of Rational Relations.

Pascal Bergsträßer, Moses Ganardi

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification.

Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

A Characterization of Wreath Products Where Knapsack Is Decidable.

Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021