|
13
|
The Role of Lazy Evaluation in Amortized Data Structures
– Chris Okasaki
- 1996
|
|
50
|
Extensible markup language
– T Bray, J Paoli, C M Sperberg-McQueen, E Maler
- 2000
|
|
9
|
Expressiveness of Structured Document Query Languages Based on Attribute Grammars
– Frank Neven, Jan Van Den Bussche, Limburgs Universitair Centrum
- 1998
|
|
3
|
XML Transformation Language Based on Monadic Second-order Logic
– Kazuhiro Inaba, Haruo Hosoya
|
|
9
|
Binary queries for document trees
– A Berlea, H Seidl
|
|
18
|
Towards Aggregated Answers for Semistructured Data
– Holger Meuss , Klaus U. Schulz, François Bry
- 2000
|
|
2
|
Regular n-ary queries in trees and variable independence
– Emmanuel Filiot, Sophie Tison
|
|
28
|
Fixed points vs. infinite generation
– D Niwi'nski
- 1988
|
|
7
|
Linear delay enumeration and monadic second-order logic
– Bruno Courcelle
- 2007
|
|
104
|
Regular expression pattern matching for XML
– Haruo Hosoya, Benjamin C. Pierce
- 2003
|
|
12
|
Mso queries on tree decomposable structures are computable with linear delay
– Guillaume Bagan
- 2006
|
|
219
|
Efficient algorithms for processing XPath queries
– Georg Gottlob, Christoph Koch, Reinhard Pichler
- 2002
|
|
65
|
Query Evaluation via Tree-Decompositions
– Jörg Flum, Markus Frick, Martin Grohe
- 2001
|
|
64
|
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
– Georg Gottlob, Christoph Koch
- 2002
|
|
80
|
Maintaining order in a linked list
– P F Dietz
- 1982
|
|
144
|
Generalized finite automata theory with an application to a decision problem of 2nd-order logic
– J W Thatcher, J B Wright
- 1968
|
|
4
|
The Derivation of a Tighter Bound for Top-Down Skew Heaps
– Anne Kaldewaij, Berry Schoenmakers
- 1991
|
|
11
|
Data Structures and Amortized Complexity in a Functional Setting
– Berry Schoenmakers
- 1992
|
|
43
|
Self-adjusting heaps
– D Sleater, R Tarjan
- 1986
|
