![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Wim Martens Wim Martens, Frank Neven , Thomas Schwentick : Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005 : 68-82 Geert Jan Bex , Wim Martens, Frank Neven , Thomas Schwentick : Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005 : 712-721 Wim Martens, Frank Neven , Thomas Schwentick : Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004 : 889-900 Wim Martens, Frank Neven : Frontiers of Tractability for Typechecking Simple XML Transformations. PODS 2004 : 23-34 Wim Martens, Frank Neven : Typechecking Top-Down Uniform Unranked Tree Transducers. ICDT 2003 : 64-78 1 [ 4 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] 3 [ 3 ] [ 4 ] [ 5 ] ![]() ©2005 Association for Computing Machinery |