Wouter Gelade

According to our database1, Wouter Gelade authored at least 24 papers between 2007 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
Simplifying XML Schema: Single-type approximations of regular tree languages.
J. Comput. Syst. Sci., 2013

2012
Succinctness of the Complement and Intersection of Regular Expressions.
ACM Trans. Comput. Log., 2012

The dynamic complexity of formal languages.
ACM Trans. Comput. Log., 2012

Regular Expressions with Counting: Weak versus Strong Determinism.
SIAM J. Comput., 2012

2011
Succinctness of pattern-based schema languages for XML.
J. Comput. Syst. Sci., 2011

2010
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data.
TWEB, 2010

Incremental XPath evaluation.
ACM Trans. Database Syst., 2010

Succinctness of regular expressions with interleaving, intersection and counting.
Theor. Comput. Sci., 2010

Optimizing the Region Algebra is PSPACE-complete.
Inf. Process. Lett., 2010

Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
CoRR, 2010

Simplifying XML schema: single-type approximations of regular tree languages.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
SIAM J. Comput., 2009

The Dynamic Complexity of Formal Languages.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Simplifying XML schema: effortless handling of nondeterministic regular expressions.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Regular Expressions with Counting: Weak versus Strong Determinism.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Incremental XPath evaluation.
Proceedings of the Database Theory, 2009

2008
Dynamic Complexity of Formal Languages
CoRR, 2008

Succinctness of the Complement and Intersection of Regular Expressions
CoRR, 2008

Learning deterministic regular expressions for the inference of schemas from XML data.
Proceedings of the 17th International Conference on World Wide Web, 2008

Succinctness of the Complement and Intersection of Regular Expressions.
Proceedings of the STACS 2008, 2008

Complexity and composition of synthesized web services.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Succinctness of Regular Expressions with Interleaving, Intersection and Counting.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
Proceedings of the Database Theory, 2007

Succinctness of Pattern-Based Schema Languages for XML.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007


  Loading...