Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Jaina Veron

dblp:345/8492 · also Julien Veron · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Combinatorics and discrete mathematics · 33% Algorithms and data structures · 33% Computational complexity · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
combinatorics on words		 0.912025
A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words · ICALP 2025
Algorithms and data structures › sequence algorithms › string algorithms
compressed string algorithms		 0.912025
A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words · ICALP 2025
Computational complexity › decision problems › word problem
compressed word problems		 0.912025
A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words · ICALP 2025

Methods — techniques the papers use, named apart from their topics

tropical algebra · 0.9
YearPublicationVenuePosition
2025 A Tropical Approach to the Compositional Piecewise Complexity of Words and Compressed Words
abstract
We express the piecewise complexity of words using tools and concepts from tropical algebra. This allows us to define a notion of piecewise signature of a word that has size log(n)m^{O(1)} where m is the alphabet size and n is the length of the word. The piecewise signature of a concatenation can be computed from the signatures of its components, allowing a polynomial-time algorithm for computing the piecewise complexity of SLP-compressed words.
Philippe Schnoebelen, Jaina Veron, Isa Vialard
 ICALP2
2024 On the Piecewise Complexity of Words and Periodic Words
M. Praveen, Philippe Schnoebelen, Jaina Veron, Isa Vialard
 SOFSEM3