@incollection{bagan2006,
	doi = {10.1007/11874683_11},
	% url = {https://doi.org/10.1007%2F11874683_11},
	year = 2006,
	publisher = {Springer Berlin Heidelberg},
	pages = {167--181},
	author = {Guillaume Bagan},
	title = {{MSO} Queries on Tree Decomposable Structures Are Computable with Linear Delay}
}
@article{kazana2013,
	doi = {10.1145/2528928},
	% url = {https://doi.org/10.1145%2F2528928},
	year = 2013,
	month = {nov},
	publisher = {Association for Computing Machinery ({ACM})},
	volume = {14},
	number = {4},
	pages = {1--12},
	author = {Wojciech Kazana and Luc Segoufin},
	title = {Enumeration of monadic second-order queries on trees}
}
@incollection{colcombet,
	doi = {10.1007/978-3-540-73420-8_77},
	% url = {https://doi.org/10.1007%2F978-3-540-73420-8_77},
	publisher = {Springer Berlin Heidelberg},
	pages = {901--912},
	author = {Thomas Colcombet},
	title = {A Combinatorial Theorem for Trees}
}
@incollection{bender2000,
	doi = {10.1007/10719839_9},
	% url = {https://doi.org/10.1007%2F10719839_9},
	year = 2000,
	publisher = {Springer Berlin Heidelberg},
	pages = {88--94},
	author = {Michael A. Bender and Mart{\'{\i}}n Farach-Colton},
	title = {The {LCA} Problem Revisited}
}
@article{tarjan1984,
	doi = {10.1137/0213024},
	url = {https://doi.org/10.1137%2F0213024},
	year = 1984,
	month = {may},
	publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
	volume = {13},
	number = {2},
	pages = {338--355},
	author = {Dov Harel and Robert Endre Tarjan},
	title = {Fast Algorithms for Finding Nearest Common Ancestors}
}
@article{schieber1988,
	doi = {10.1137/0217079},
	url = {https://doi.org/10.1137%2F0217079},
	year = 1988,
	month = {dec},
	publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
	volume = {17},
	number = {6},
	pages = {1253--1262},
	author = {Baruch Schieber and Uzi Vishkin},
	title = {On Finding Lowest Common Ancestors: Simplification and Parallelization}
}
@article{berkman1993,
	doi = {10.1137/0222017},
	url = {https://doi.org/10.1137%2F0222017},
	year = 1993,
	month = {apr},
	publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
	volume = {22},
	number = {2},
	pages = {221--242},
	author = {Omer Berkman and Uzi Vishkin},
	title = {Recursive Star-Tree Parallel Data Structure}
}