Wouter Gelade

26 papers A* 3A 4B 2Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2021 — ch.
Automata and finite model theory.
Handbook of Automata Theory (II.)
Wouter Gelade, Thomas Schwentick
2013 J jnl
Simplifying XML Schema: Single-type approximations of regular tree languages.
J. Comput. Syst. Sci.
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven, Jan Paredaens
2012 J jnl
Regular Expressions with Counting: Weak versus Strong Determinism.
SIAM J. Comput.
Wouter Gelade, Marc Gyssens, Wim Martens
2012 J jnl
Succinctness of the Complement and Intersection of Regular Expressions.
ACM Trans. Comput. Log.
Wouter Gelade, Frank Neven
2012 J jnl
The dynamic complexity of formal languages.
ACM Trans. Comput. Log.
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2011 J jnl
Succinctness of pattern-based schema languages for XML.
J. Comput. Syst. Sci.
Wouter Gelade, Frank Neven
2010 J jnl
Incremental XPath evaluation.
ACM Trans. Database Syst.
Henrik Björklund, Wouter Gelade, Wim Martens
2010 J jnl
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
CoRR
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren
2010 J jnl
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data.
ACM Trans. Web
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren
2010 J jnl
Optimizing the Region Algebra is PSPACE-complete.
Inf. Process. Lett.
Wouter Gelade, Frank Neven
2010 A* conf
Simplifying XML schema: single-type approximations of regular tree languages.
PODS
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven
2010 J jnl
Succinctness of regular expressions with interleaving, intersection and counting.
Theor. Comput. Sci.
Wouter Gelade
2009 — —
Foundations of XML: Regular Expressions Revisited
Wouter Gelade
2009 A conf
Incremental XPath evaluation.
ICDT
Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens
2009 J jnl
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
SIAM J. Comput.
Wouter Gelade, Wim Martens, Frank Neven
2009 B conf
Regular Expressions with Counting: Weak versus Strong Determinism.
MFCS
Wouter Gelade, Marc Gyssens, Wim Martens
2009 — conf
Simplifying XML schema: effortless handling of nondeterministic regular expressions.
SIGMOD Conference
Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven
2009 A conf
The Dynamic Complexity of Formal Languages.
STACS
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2008 A* conf
Complexity and composition of synthesized web services.
PODS
Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven, Antonella Poggi
2008 J jnl
Dynamic Complexity of Formal Languages
CoRR
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2008 A* conf
Learning deterministic regular expressions for the inference of schemas from XML data.
WWW
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren
2008 B conf
Succinctness of Regular Expressions with Interleaving, Intersection and Counting.
MFCS
Wouter Gelade
2008 J jnl
Succinctness of the Complement and Intersection of Regular Expressions
CoRR
Wouter Gelade, Frank Neven
2008 A conf
Succinctness of the Complement and Intersection of Regular Expressions.
STACS
Wouter Gelade, Frank Neven
2007 A conf
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
ICDT
Wouter Gelade, Wim Martens, Frank Neven
2007 — conf
Succinctness of Pattern-Based Schema Languages for XML.
DBPL
Wouter Gelade, Frank Neven