BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Canada
1 × Croatia
1 × Poland
1 × Switzerland
1 × Taiwan
2 × Austria
2 × Italy
2 × Japan
2 × USA
Collaborated with:
P.Schnoebelen R.Lazic J.Leroux P.Karandikar A.Boral M.Jurdzinski E.Bertsch M.Nederhof S.Haddad P.Héam C.Nicaud J.F.Gálvez J.Farré D.Baelde S.Lunel D.Figueira S.Figueira
Talks about:
recurs (4) time (4) pars (4) complex (3) detect (3) ambigu (3) tree (3) net (3) experiment (2) ordin (2)

♂ Person: Sylvain Schmitz

DBLP DBLP: Schmitz:Sylvain

Facilitated 3 volumes:

LDTA 2012PrCo
LDTA 2011PrCo
CIAA 2005Ed

Contributed to:

ICALP (2) 20152015
LICS 20152015
CSL-LICS 20142014
RTA-TLCA 20142014
CC 20132013
FOSSACS 20132013
LICS 20132013
LICS 20122012
ICALP (2) 20112011
LICS 20112011
CIAA 20092009
ICALP 20072007
LDTA 20072008
SCP, 20102010
CIAA 20062006
DLT 20062006
CSL 20162016

Wrote 17 papers:

ICALP-v2-2015-JurdzinskiLS #energy #game studies #pseudo
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (MJ, RL, SS), pp. 260–272.
LICS-2015-LerouxS #reachability
Demystifying Reachability in Vector Addition Systems (JL, SS), pp. 56–67.
LICS-CSL-2014-LazicS #branch
Non-elementary complexities for branching VASS, MELL, and extensions (RL, SS), p. 10.
RTA-TLCA-2014-Schmitz #logic
Implicational Relevance Logic is 2-ExpTime-Complete (SS), pp. 395–409.
CC-2013-BertschNS #lr #on the #parsing
On LR Parsing with Selective Delays (EB, MJN, SS), pp. 244–263.
FoSSaCS-2013-KarandikarS #complexity #parametricity #problem #recursion
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems (PK, SS), pp. 273–288.
LICS-2013-BoralS #model checking #parse tree
Model-Checking Parse Trees (AB, SS), pp. 153–162.
LICS-2012-HaddadSS #complexity #petri net #recursion
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (SH, SS, PS), pp. 355–364.
ICALP-v2-2011-SchmitzS #bound #multi #recursion
Multiply-Recursive Upper Bounds with Higman’s Lemma (SS, PS), pp. 441–452.
LICS-2011-FigueiraFSS #bound #recursion
Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.
CIAA-2009-HeamNS #automaton #generative #random
Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.
ICALP-2007-Schmitz #ambiguity #context-free grammar #detection
Conservative Ambiguity Detection in Context-Free Grammars (SS), pp. 692–703.
LDTA-2007-Schmitz08 #ambiguity #detection
An Experimental Ambiguity Detection Tool (SS), pp. 69–84.
LDTA-J-2007-Schmitz #ambiguity #detection
An experimental ambiguity detection tool (SS), pp. 71–84.
CIAA-2006-GalvezSF #bound #linear #lookahead #parsing
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
DLT-2006-Schmitz #lalr #parsing
Noncanonical LALR(1) Parsing (SS), pp. 95–107.
CSL-2016-BaeldeLS #calculus #finite #logic
A Sequent Calculus for a Modal Logic on Finite Data Trees (DB, SL, SS), p. 16.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.