Pamela Fleischmann

Orcid: 0000-0002-1531-7970

According to our database1, Pamela Fleischmann authored at least 30 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tight Bounds for the Number of Absent Scattered Factors.
CoRR, 2024

Word-Representable Graphs from a Word's Perspective.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Rollercoasters with Plateaus.
Proceedings of the Reachability Problems - 18th International Conference, 2024

2023
Nearly <i>k</i>-universal words - Investigating a part of Simon's congruence.
Theor. Comput. Sci., September, 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

α-β-Factorization and the Binary Case of Simon's Congruence.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
m-Nearly k-Universal Words - Investigating Simon Congruence.
CoRR, 2022

MaxSAT with Absolute Value Functions: A Parameterized Perspective.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Nearly k-Universal Words - Investigating a Part of Simon's Congruence.
Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021
On Special k-Spectra, k-Locality, and Collapsing Prefix Normal Words
PhD thesis, 2021

Reconstructing Words from Right-Bounded-Block Words.
Int. J. Found. Comput. Sci., 2021

The Show Must Go On - Examination During a Pandemic.
CoRR, 2021

Scattered Factor Universality - The Power of the Remainder.
CoRR, 2021

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

Blocksequences of k-local Words.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Weighted Prefix Normal Words: Mind the Gap.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020
Equations enforcing repetitions under permutations.
Discret. Appl. Math., 2020

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

On Weighted Prefix Normal Words.
CoRR, 2020

On Collapsing Prefix Normal Words.
Proceedings of the Language and Automata Theory and Applications, 2020

Scattered Factor-Universality of Words.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019
Repetition avoidance in products of factors.
Theor. Comput. Sci., 2019

On Collapsing Prefix Normal Words.
CoRR, 2019

k-Spectra of c-Balanced Words.
CoRR, 2019

Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods.
Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

k-Spectra of Weakly-c-Balanced Words.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
On Matching Generalised Repetitive Patterns.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Local Patterns.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017


  Loading...