Philippe Narbel

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 VLDB 2026 / reviewers in the wild / expert

dblp:39/1943 · DBLP profile ↗

← Back

11ranked-venue papers

4as first author

0since 2021 · last 2015

—ORCID · none

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

Theory of computation · 10 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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

3 papers

Automata and formal languages · 60% Computational geometry · 26% Combinatorics and discrete mathematics · 14%

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

Topic	Weight	Papers	Last	Evidence papers
Automata and formal languages › l systems d0l systems	0.0	1	2003	Languages, D0L-systems, sets of curves, and surface automorphisms · Inf. Comput. 2003
Computational geometry graph drawing	0.0	1	1999	An Algorithm to Symbolically Describe Flows on Surfaces · SODA 1999

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

symbolic computation · 0.0combinatorics on words · 0.0

Year	Publication	Venue	Position
2015	Coding Non-orientable Laminations Luis-Miguel Lopez, Philippe Narbel	LATA	2
2007	Type sharing constraints and undecidability abstract Abstract Let ${\cal A}$ be a set of modules and parameterized modules including type sharing constraint specifications. We prove that determining the set of the effective modules described by ${\cal A}$ is undecidable. As a consequence, type sharing constraints are proved to be not always avoidable by constructive transformations. Philippe Narbel	J. Funct. Program.	1
2003	Languages, D0L-systems, sets of curves, and surface automorphisms Luis-Miguel Lopez, Philippe Narbel	Inf. Comput.	2
2001	Substitutions and interval exchange transformations of rotation class Luis-Miguel Lopez, Philippe Narbel	Theor. Comput. Sci.	2
1999	Substitutions from Rauzy induction (extended abstract) Luis-Miguel Lopez, Philippe Narbel	Developments in Language Theory	2
1999	An Algorithm to Symbolically Describe Flows on Surfaces Luis-Miguel Lopez, Philippe Narbel	SODA	2
1998	D0L-Systems and Surface Automorphisms Luis-Miguel Lopez, Philippe Narbel	MFCS	2
1995	Generalized Sturmian Languages Luis-Miguel Lopez, Philippe Narbel	ICALP	2
1993	Geometrical OL-Systems Coming from Tilings of the Plane Philippe Narbel	Developments in Language Theory	1
1993	The Boundary of Substitution Systems Philippe Narbel	MFCS	1
1993	The Limit Set of Recognizable Substitution Systems Philippe Narbel	STACS	1