www.uhasselt.be
DSpace

Document Server@UHasselt >

Browsing by Author GELADE, Wouter

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 20 of 23
TitleTypeIssue Date
Complexity and composition of synthesized web services
Lenzerini, Maurizio & Lembo, Domenico (Ed.) Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. p. 231-240.
Proceedings Paper2008
The Dynamic Complexity of Formal Languages
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 13 (3)
Journal Contribution2012
Foundations of XML: Regular Expressions Revisited
Theses and Dissertations2009
Incremental XPath Evaluation
ACM TRANSACTIONS ON DATABASE SYSTEMS, 35(4)
Journal Contribution2010
Incremental XPath Evaluation
Fagin, Ronald (Ed.) Proceedings of the International Conference on Database Theory. p. 162-173.
Proceedings Paper2009
Learning deterministic regular expressions for the inference of schemas from XML data
Huai, Jinpeng & Chen, Robin & Liu, Hsiao-Wuen & Ma, Wei-Ying & Tomkins, Andrew & Zhang, Xiadong (Ed.) Proceedings of the 17th International Conference on World Wide Web. p. 825-834.
Proceedings Paper2008
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
ACM TRANSACTIONS ON THE WEB, 4(4)
Journal Contribution2010
Optimization of XML schema languages: complexity of counting and the shuffle operator
Theses and Dissertations2006
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing, 38(5). p. 2021-2043
Journal Contribution2009
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
Proceedings of International Conference on Database Theory. p. 269-283
Proceedings Paper2007
Optimizing the Region Algebra is PSPACE-complete
INFORMATION PROCESSING LETTERS, 110(16). p. 639-643
Journal Contribution2010
Regular Expressions with Counting: Weak versus Strong Determinism
Kralovic, R; Niwinski, D (Ed.) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009. p. 369-381.
Proceedings Paper2009
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM JOURNAL ON COMPUTING, 41(1), p. 160-190
Journal Contribution2012
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Cetintemel, Ugur & Zdonik, Stanley & Kossmann, Donald & Tatbul, Nesime (Ed.) Proceedings of the 35th SIGMOD international conference on Management of data. p. 731-744.
Proceedings Paper2009
Simplifying XML Schema: Single-type approximations of regular tree languages
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 79 (6), p. 910-936
Journal Contribution2013
Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages
Proceedings of the 29th ACM Conference on Principles of Database Systems (PODS). p. 251-260.
Proceedings Paper2010
Succinctness of pattern-based schema languages for XML
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 77 (3), p. 505-519
Journal Contribution2011
Succinctness of Pattern-Based Schema Languages for XML
Proceedings of Database Programming Languages. p. 201-215
Journal Contribution2007
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, 5162. p. 363-374
Journal Contribution2008
Succinctness of regular expressions with interleaving, intersection and counting
THEORETICAL COMPUTER SCIENCE, 411(31-33), p. 2987-2998
Journal Contribution2010
Showing results 1 to 20 of 23