VLDB 2026 Research / reviewers in the wild / expert
Anna E. Frid
dblp:95/2744
· DBLP profile ↗
18ranked-venue papers
11as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 18 · 11 first-author · 2 since 2021Security and privacy · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Prefix Palindromic Length of the Sierpinski Word
Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic |
DLT | 2 |
| 2021 | On prefix palindromic length of automatic words
Anna E. Frid, Enzo Laborde, Jarkko Peltomäki |
Theor. Comput. Sci. | 1 |
| 2020 | Morphic words and equidistributed sequences
Mélodie Andrieu, Anna E. Frid |
Theor. Comput. Sci. | 2 |
| 2019 | First Lower Bounds for Palindromic Length
Anna E. Frid |
DLT | 1 |
| 2019 | The number of valid factorizations of Fibonacci prefixes
Pierre Bonardo, Anna E. Frid, Jeffrey Shallit |
Theor. Comput. Sci. | 2 |
| 2015 | Ergodic Infinite Permutations of Minimal Complexity
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina |
DLT | 2 |
| 2014 | Subword Complexity and Decomposition of the Set of Factors
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni |
MFCS (1) | 2 |
| 2011 | Infinite permutations of lowest maximal pattern complexity
Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov |
Theor. Comput. Sci. | 2 |
| 2009 | Simple equations on binary factorial languages
Anna E. Frid |
Theor. Comput. Sci. | 1 |
| 2007 | Commutation of Binary Factorial Languages
Anna E. Frid |
Developments in Language Theory | 1 |
| 2007 | On the arithmetical complexity of Sturmian words
Julien Cassaigne, Anna E. Frid |
Theor. Comput. Sci. | 2 |
| 2005 | Sequences of linear arithmetical complexity
Anna E. Frid |
Theor. Comput. Sci. | 1 |
| 2003 | Arithmetical complexity of symmetric D0L words
Anna E. Frid |
Theor. Comput. Sci. | 1 |
| 2001 | On the subword complexity of iteratively generated infinite words
Anna E. Frid |
Discret. Appl. Math. | 1 |
| 2001 | On factor graphs of DOL words
Anna E. Frid |
Discret. Appl. Math. | 1 |
| 1998 | On Bispecial Words and Subword Complexity of DOL Sequences
Anna E. Frid, Sergey V. Avgustinovich |
SETA | 1 |
| 1998 | On Uniform DOL Words
Anna E. Frid |
STACS | 1 |
| 1997 | The Subword Complexity of Fixed Points of Binary Uniform Morphisms
Anna E. Frid |
FCT | 1 |