www.uhasselt.be
DSpace

Document Server@UHasselt >

Browsing by Author Schwentick, Thomas

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
05061 Abstracts Collection - Foundations of Semistructured Data
Neven, F. & Schwentick, T. & Suciu, D. (Ed.) Foundations of Semistructured Data. Dagstuhl Seminar Proceedings.
Proceedings Paper2005
Automata- and Logic-Based Pattern Languages for Tree-Structured Data
SEMANTICS IN DATABASES. p. 171-176
Journal Contribution2003
Automata for Unary Queries on Trees
Neven, F. & Schwentick, T. (Ed.) Grundlagen von Datenbanken. p. 102-106.
Proceedings Paper1999
Complexity of Decision Problems for Simple Regular Expressions.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS. p. 889-900
Journal Contribution2004
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM JOURNAL ON COMPUTING, 39(4). p. 1486-1530
Journal Contribution2009
Deterministic top-down tree automata: past, present, future
Flum, J & Graedel, E & Wilke, Th (Ed.) Logic and automata : History and perspectives, p. 505-530.
Book Section2007
Developing and Analyzing XSDs through BonXai
Proceedings of the VLDB Endowment, 5 (12), p. 1994-1997
Journal Contribution2012
The Dynamic Complexity of Formal Languages
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 13 (3)
Journal Contribution2012
Expressive and Efficient Pattern Languages for Tree-Structured Data.
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. p. 145-156.
Proceedings Paper2000
Expressiveness and complexity of XML Schema
ACM TRANSACTIONS ON DATABASE SYSTEMS, 31(3). p. 770-813
Journal Contribution2006
Expressiveness of XSDs: from practice to theory, there and back again
Proceedings of the 14th international conference on World Wide Web. p. 712-721.
Proceedings Paper2005
Finite state machines for strings over infinite alphabets
Transactions on Computational Logic, 5(3). p. 403-435
Journal Contribution2004
Inference of Concise Regular Expressions and DTDs
ACM TRANSACTIONS ON DATABASE SYSTEMS, 35(2)
Journal Contribution2010
On the Power of Tree-Walking Automata
AUTOMATA LANGUAGES AND PROGRAMMING. p. 547-560
Journal Contribution2000
On the power of tree-walking automata.
Information and Computation, 183(1). p. 86-103
Journal Contribution2003
Query Automata
Neven, F. & Schwentick, T. (Ed.) PODS. p. 205-214.
Proceedings Paper1999
Query automata over finite trees
Theoretical Computer Science, 275(1-2). p. 633-674
Journal Contribution2002
Simple off the shelf abstractions for XML schema
SIGMOD RECORD, 36(3). p. 15-22
Journal Contribution2007
Solving equations in the relational algebra
SIAM Journal on Computing, 33(5). p. 1052-1066
Journal Contribution2004
The Dynamic Complexity of Formal Languages
Albers, Susanne & Marion, Jean-Yves (Ed.) Proceedings of the International Symposium on Theoretical Aspects of Computer Science. p. 481-492.
Proceedings Paper2009
Showing results 1 to 20 of 23