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.tex | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

(limited to 'mgr.tex')

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