Wim Martens
Titel
Geciteerd door
Geciteerd door
Jaar
Expressiveness and complexity of XML Schema
W Martens, F Neven, T Schwentick, GJ Bex
ACM Transactions on Database Systems (TODS) 31 (3), 770-813, 2006
1922006
Frontiers of tractability for typechecking simple XML transformations
W Martens, F Neven
Journal of Computer and System Sciences 73 (3), 362-390, 2007
892007
Typechecking top-down uniform unranked tree transducers
W Martens, F Neven
International Conference on Database Theory, 64-78, 2003
822003
Querying graph databases with XPath
L Libkin, W Martens, D Vrgoč
Proceedings of the 16th International Conference on Database Theory, 129-140, 2013
812013
On the minimization of XML schemas and tree automata for unranked trees
W Martens, J Niehren
Journal of Computer and System Sciences 73 (4), 550-583, 2007
782007
An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm
The VLDB Journal, 1-25, 2019
762019
Automata: from logics to algorithms.
MY Vardi, T Wilke
Logic and automata 2, 629-736, 2008
74*2008
Complexity of decision problems for simple regular expressions
W Martens, F Neven, T Schwentick
International Symposium on Mathematical Foundations of Computer Science, 889-900, 2004
732004
The complexity of evaluating path expressions in SPARQL
K Losemann, W Martens
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
692012
Querying graphs with data
L Libkin, W Martens, D Vrgoč
Journal of the ACM (JACM) 63 (2), 14, 2016
572016
Conjunctive query containment over trees
H Björklund, W Martens, T Schwentick
Journal of Computer and System Sciences 77 (3), 450-472, 2011
57*2011
On the complexity of typechecking top-down XML transformations
W Martens, F Neven
Theoretical Computer Science 336 (1), 153-180, 2005
572005
Conjunctive query containment over trees using schema information
H Björklund, W Martens, T Schwentick
Acta Informatica 55 (1), 17-56, 2018
55*2018
Complexity of decision problems for XML schemas and chain regular expressions
W Martens, F Neven, T Schwentick
SIAM Journal on Computing 39 (4), 1486-1530, 2009
552009
Efficient separability of regular languages by subsequences and suffixes
W Czerwiński, W Martens, T Masopust
International Colloquium on Automata, Languages, and Programming, 150-161, 2013
532013
Regular expressions with counting: Weak versus strong determinism
W Gelade, M Gyssens, W Martens
SIAM Journal on Computing 41 (1), 160-190, 2012
532012
Expressiveness of XSDs: from practice to theory, there and back again
GJ Bex, W Martens, F Neven, T Schwentick
Proceedings of the 14th international conference on World Wide Web, 712-721, 2005
522005
The tractability frontier for NFA minimization
H Björklund, W Martens
Journal of Computer and System Sciences, 2012
50*2012
The complexity of regular expressions and property paths in SPARQL
K Losemann, W Martens
ACM Transactions on Database Systems (TODS) 38 (4), 24, 2013
432013
Simple off the shelf abstractions for XML schema
W Martens, F Neven, T Schwentick
ACM SIGMOD Record 36 (3), 15-22, 2007
432007
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20