Paul Sarnighausen-Cahn

According to our database, Paul Sarnighausen-Cahn authored at least 5 papers between 2024 and 2026.

Collaborative distances:

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

2026

Learning SMT Algorithm Selection with High-Level Natural-Language Descriptions.

Zhengyang Lu, Paul Sarnighausen-Cahn, Jiahao Chen, Arie Gurfinkel, Florin Manea, Vijay Ganesh

Proceedings of the Foundations of Information and Knowledge Systems, 2026

2025

Novel tree-search method for synthesizing SMT strategies.

Zhengyang John Lu, Joel D. Day, Piyush Jha, Paul Sarnighausen-Cahn, Stefan Siemer, Florin Manea, Vijay Ganesh

Acta Informatica, September, 2025

Longest Common Subsequence with Gap Constraints.

Duncan Adamson, Paul Sarnighausen-Cahn, Marius Dumitran, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer

Theory Comput. Syst., June, 2025

Tight Bounds for the Number of Absent Subsequences.

Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhöft

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

SMTQuery: Analysing SMT-LIB String Benchmarks.

Mitja Kulczynski, Kevin Lotz, Florin Manea, Danny Bøgsted Poulsen, Paul Sarnighausen-Cahn

Proceedings of the Formal Methods: Foundations and Applications - 27th Brazilian Symposium, 2024