Demo Data from EDBT 2026 / reviewers in the wild / expert
Yves Roos
dblp:23/4048
· DBLP profile ↗
21ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-5045-4399ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 20 · 1 first-authorDatabases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1
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.
| Databases, data mining, and information retrieval
1 paper |
Database theory · 50% Query processing and optimization · 50% | |
| Theoretical computer science
4 papers |
Automata and formal languages · 82% Logic in computer science · 18% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
string rewriting |
0.2 | 1 | 2015 | A canonical automaton for one-rule length-preserving string rewrite systems · Inf. Comput. 2015 |
Query processing and optimization
query rewriting |
0.2 | 1 | 2014 | Static analysis of XML security views and query rewriting · Inf. Comput. 2014 |
Program analysis
static analysis |
0.1 | 1 | 2014 | Static analysis of XML security views and query rewriting · Inf. Comput. 2014 |
Logic in computer science
rewriting systems |
0.0 | 1 | 2001 | Synchronization Languages and Rewriting Systems · Inf. Comput. 2001 |
Logic in computer science › concurrency theory
semi-commutations |
0.0 | 1 | 1992 | Semi-Commutations and Rational Expressions · ICALP 1992 |
Logic in computer science
concurrency theory |
0.0 | 1 | 1990 | Decomposition of Partial Commutations · ICALP 1990 |
Logic in computer science › concurrency theory › trace theory
partial commutation |
0.0 | 1 | 1990 | Decomposition of Partial Commutations · ICALP 1990 |
Methods — techniques the papers use, named apart from their topics
string rewrite systems · 0.2automata · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | On prefixal one-rule string rewrite systems
Michel Latteux, Yves Roos |
Theor. Comput. Sci. | 2 |
| 2015 | A canonical automaton for one-rule length-preserving string rewrite systems
Michel Latteux, Yves Roos |
Inf. Comput. | 2 |
| 2014 | Static analysis of XML security views and query rewriting
Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison |
Inf. Comput. | 4 |
| 2012 | On One-Rule Grid Semi-Thue SystemsabstractThe family of one-rule grid semi-Thue systems, introduced by Alfons Geser, is the family of one-rule semi-Thue systems such that there exists a letter c that occurs as often in the left-hand side as the right-hand side of the rewriting rule. We prove Michel Latteux, Yves Roos |
Fundam. Informaticae | 2 |
| 2011 | View update translation for XMLabstractWe study the problem of update translation for views on XML documents. More precisely, given an XML view definition and a user defined view update program, find a source update program that translates the view update without side effects on the view. Additionally, we require the translation to be defined on all possible source documents; this corresponds to Hegner's notion of uniform translation. The existence of such translation would allow to update XML views without the need of materialization. Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawomir Staworko |
ICDT | 4 |
| 2008 | Streaming tree automata
Olivier Gauwin, Joachim Niehren, Yves Roos |
Inf. Process. Lett. | 3 |
| 2007 | Path constraints in semistructured data
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison |
Theor. Comput. Sci. | 4 |
| 2006 | Identification of biRFSA languages
Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte |
Theor. Comput. Sci. | 3 |
| 2005 | Monotone AC-Tree Automata
Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos |
LPAR | 4 |
| 2004 | Extraction and Implication of Path Constraints
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison |
MFCS | 4 |
| 2001 | Synchronization Languages and Rewriting Systems
Mireille Clerbout, Yves Roos, Isabelle Simplot-Ryl |
Inf. Comput. | 2 |
| 1999 | Generalized Synchronization Languages
Isabelle Simplot-Ryl, Yves Roos, Mireille Clerbout |
FCT | 2 |
| 1999 | Synchronization Languages
Mireille Clerbout, Yves Roos, Isabelle Simplot-Ryl |
Theor. Comput. Sci. | 2 |
| 1998 | About Synchronization Languages
Isabelle Simplot-Ryl, Yves Roos, Mireille Clerbout |
MFCS | 2 |
| 1997 | Partial Characterization of Synchronization Languages
Isabelle Simplot-Ryl, Yves Roos, Mireille Clerbout |
MFCS | 2 |
| 1992 | Semi-Commutations and Rational Expressions
Mireille Clerbout, Yves Roos, Wieslaw Zielonka |
ICALP | 2 |
| 1992 | Semicommutations and Algebraic Languages
Mireille Clerbout, Yves Roos |
Theor. Comput. Sci. | 2 |
| 1991 | Composition of Two Semi Commutations
Yves Roos, Pierre-André Wacrenier |
MFCS | 1 |
| 1990 | Decomposition of Partial Commutations
Mireille Clerbout, Michel Latteux, Yves Roos |
ICALP | 3 |
| 1990 | Semi-Commutations and Algebraic Languages
Mireille Clerbout, Yves Roos |
STACS | 2 |
| 1988 | 2-Asynchronous Automata
Robert Cori, Éric Sopena, Michel Latteux, Yves Roos |
Theor. Comput. Sci. | 4 |