Tore Koss

Orcid: 0000-0001-6002-1581

According to our database1, Tore Koss authored at least 12 papers between 2020 and 2024.

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

2024
On Combinatorial Properties of Subsequences
PhD thesis, 2024

Subsequence Matching and Analysis Problems for Formal Languages.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

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

k-Universality of Regular Languages.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

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

2022
Reverting and Combining Soliton Bursts.
J. Autom. Lang. Comb., 2022

Absent Subsequences in Words.
Fundam. Informaticae, 2022

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

Subsequences in Bounded Ranges: Matching and Analysis Problems.
Proceedings of the Reachability Problems - 16th International Conference, 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

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


  Loading...