default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Servais
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j4]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. Log. Methods Comput. Sci. 15(2) (2019)- 2018
- [j3]Emmanuel Filiot
, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Visibly pushdown transducers. J. Comput. Syst. Sci. 97: 147-181 (2018) - [j2]Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan:
Finite-State Map-Reduce Computation and Relational Algebra Queries. ACM Trans. Comput. Log. 19(2): 14:1-14:37 (2018) - 2013
- [j1]Pierre-Alain Reynier, Frédéric Servais:
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Fundam. Informaticae 122(1-2): 1-30 (2013)
Conference and Workshop Papers
- 2019
- [c12]Pierre-Alain Reynier, Frédéric Servais:
On the Computation of the Minimal Coverability Set of Petri Nets. RP 2019: 164-177 - 2015
- [c11]Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan:
Distributed Streaming with Finite Memory. ICDT 2015: 324-341 - 2013
- [c10]Timos Antonopoulos, Frank Neven, Frédéric Servais:
Definability problems for graph query languages. ICDT 2013: 141-152 - [c9]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. LICS 2013: 468-477 - [c8]Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Expressiveness of Visibly Pushdown Transducers. TTATT 2013: 17-26 - 2012
- [c7]Emmanuel Filiot, Frédéric Servais:
Visibly Pushdown Transducers with Look-Ahead. SOFSEM 2012: 251-263 - 2011
- [c6]Pierre-Alain Reynier, Frédéric Servais:
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Petri Nets 2011: 69-88 - [c5]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of Nested Word Transductions. FSTTCS 2011: 312-324 - [c4]François Picalausa, Frédéric Servais, Esteban Zimányi:
XEvolve: an XML schema evolution framework. SAC 2011: 1645-1650 - 2010
- [c3]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Properties of Visibly Pushdown Transducers. MFCS 2010: 355-367 - 2008
- [c2]Jean-François Raskin, Frédéric Servais:
Visibly Pushdown Transducers. ICALP (2) 2008: 386-397 - 2006
- [c1]Sébastien Collette, Jean-François Raskin, Frédéric Servais:
On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game. Computers and Games 2006: 220-233
Informal and Other Publications
- 2017
- [i3]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. CoRR abs/1707.00527 (2017) - 2013
- [i2]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. CoRR abs/1301.5197 (2013) - 2010
- [i1]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
On Functionality of Visibly Pushdown Transducers. CoRR abs/1002.1443 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
