summaryrefslogtreecommitdiff
path: root/summary
diff options
context:
space:
mode:
authorFlorian Dold <florian.dold@gmail.com>2019-04-30 01:59:45 +0200
committerFlorian Dold <florian.dold@gmail.com>2019-05-03 01:38:57 +0200
commitdd15e37e214904e1f9dc9f9bd0a57d247cca653f (patch)
treecbc4e16880e8111b13333013c725094b970eb850 /summary
parentb5d0fa21679e889a458f7d43afeef5c90dbd891c (diff)
downloaddold-thesis-phd-dd15e37e214904e1f9dc9f9bd0a57d247cca653f.tar.gz
dold-thesis-phd-dd15e37e214904e1f9dc9f9bd0a57d247cca653f.tar.bz2
dold-thesis-phd-dd15e37e214904e1f9dc9f9bd0a57d247cca653f.zip
editing WIP
Diffstat (limited to 'summary')
-rw-r--r--summary/summary-english.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/summary/summary-english.tex b/summary/summary-english.tex
index e9912c4..0f079b4 100644
--- a/summary/summary-english.tex
+++ b/summary/summary-english.tex
@@ -170,7 +170,7 @@ made, the one that supports the more highly ranked goal is preferred:
\item \textbf{GNU Taler must foster competition.}
It must be relatively easy for competitors to join the systems. While the
- barriers for this in traditional financial systems are rather high, the the
+ barriers for this in traditional financial systems are rather high, the
technical burden for new competitors to join must be minimized. Another
design choice that supports this is to split the whole system into smaller
components that can be operated, developed and improved upon independently,
@@ -181,7 +181,7 @@ made, the one that supports the more highly ranked goal is preferred:
\subsection{Byzantine Set Union Consensus} The Byzantine Set Union Consensus
protocol that we design, implement and evaluate offers an asymptotic
-improvement over a naive implementation using state machine replication.
+improvement over a na\"ive implementation using state machine replication.
For $n$ peers and a set of $m$ elements, our protocol has message complexity
$O(mn + n^2)$ when no peers show Byzantine behavior. When $f$ peers show