From 3f3e0925683c7981b14ce5a4fd5cf005b0bb01d9 Mon Sep 17 00:00:00 2001
From: Marcin Chrzanowski <mc370754@students.mimuw.edu.pl>
Date: Sat, 7 Aug 2021 20:21:24 -0400
Subject: Add bibliography generation with biber

---
 mgr.bib | 38 ++++++++++++++++++++++++++++++++++++++
 mgr.tex | 11 ++++++++---
 2 files changed, 46 insertions(+), 3 deletions(-)
 create mode 100644 mgr.bib

diff --git a/mgr.bib b/mgr.bib
new file mode 100644
index 0000000..18b0cf8
--- /dev/null
+++ b/mgr.bib
@@ -0,0 +1,38 @@
+@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}
+}
diff --git a/mgr.tex b/mgr.tex
index 808555f..fd0643f 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -3,6 +3,9 @@
 \documentclass[en]{pracamgr}
 
 \usepackage{definitions}
+\usepackage[backend=biber]{biblatex}
+\addbibresource{mgr.bib}
+
 
 % Dane magistranta:
 \autor{Marcin Chrzanowski}{370754}
@@ -50,7 +53,7 @@
     between nodes $x$ and $y$ belong to the regular language $L$'' (for a
     previously fixed regular language $L$) in the same time complexities. Our
     approach is much simpler in presentation than a previously known solution
-    due to Colcombet.
+    due to \textcite{colcombet}.
 \end{abstract}
 
 \tableofcontents
@@ -267,8 +270,8 @@ We can now reduce the problem to the following:
 
 We will build an index structure, constructible in linear time, that allows us
 to handle such queries in constant time. The structure is heavily inspired by
-Bender and Farach-Colton's presentation of an algorithm originally described by
-Berkman and Vishkin for computing LCA queries.
+\textcite{bender2000}, where a simple algorithm for computing LCA queries is
+presented.
 
 First, let's define an auxillary problem we will use, that of Range Minimum
 Queries (RMQ):
@@ -326,6 +329,8 @@ h
 
 \chapter{Conclusions}
 
+\printbibliography
+
 \end{document}
 
 %%% Local Variables:
-- 
cgit v1.2.3