Stefan Siemer

Orcid: 0000-0001-7509-8135

According to our database1, Stefan Siemer authored at least 16 papers between 2011 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure Under Self-assembly.
Proceedings of the Developments in Language Theory - 30th International Conference, 2026

2025
Novel tree-search method for synthesizing SMT strategies.
Acta Informatica, September, 2025

Longest Common Subsequence with Gap Constraints.
Theory Comput. Syst., June, 2025

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String.
CoRR, April, 2025

2024
Matching Patterns with Variables in Approximate Settings.
PhD thesis, 2024

Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.
Proceedings of the 22nd International Workshop on Satisfiability Modulo Theories co-located with the 36th International Conference on Computer Aided Verification (CAV 2024), 2024

2023
Matching Patterns with Variables Under Simon's Congruence.
Proceedings of the Reachability Problems - 17th International Conference, 2023

Longest Common Subsequence with Gap Constraints.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022
Combinatorial Algorithms for Subsequence Matching: A Survey.
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

Matching Patterns with Variables Under Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2022

2021
Efficiently Testing Simon's Congruence.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

The Edit Distance to k-Subsequence Universality.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Absent Subsequences in Words.
Proceedings of the Reachability Problems - 15th International Conference, 2021

Matching Patterns with Variables Under Hamming Distance.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
The Edit Distance to k-Subsequence Universality.
CoRR, 2020

2011
Quo vadis Robotische Medizin in der Urologie in Deutschland?
Proceedings of the 10. Jahrestagung der Deutschen Gesellschaft für Computer- und Roboterassistierte Chirurgie, 2011


  Loading...