umlaute

Signed-off-by: Nils Gillmann <ng0@n0.is>

1 files changed, 26 insertions, 26 deletions

diff --git a/gnunetbib.bib b/gnunetbib.bib
index 606faab..776446b 100644
--- a/gnunetbib.bib
+++ b/gnunetbib.bib
@@ -111,7 +111,7 @@
         year = {2016},
         month = apr,
         pages = {0--103},
-        school = {Humboldt-Universitaet zu Berlin},
+        school = {Humboldt-Universit{\"a}t zu Berlin},
         type = {Diplomarbeit},
         address = {Berlin},
         abstract = {This thesis studies the GNUnet project comprising its history, ideas and the P2P network technology. It specifically investigates the question of emancipatory potentials with regard to forms of information power due to a widely deployed new Internet technology and tries to identify essential suspensions of power within the scope of an impact assessment. Moreover, we will see by contrasting the GNUnet project with the critical data protection project, founded on social theory, that both are heavily concerned about the problem of illegitimate and unrestrained information power, giving us additional insights for the assessment. Last but least I'll try to present a scheme of how both approaches may interact to realize their goals},
@@ -167,9 +167,9 @@
         year = {2015},
         month = dec,
         pages = {0--69},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Master},
-        address = {Muenchen},
+        address = {M{\"u}nchen},
         abstract = {Byzantine consensus is a fundamental and well-studied problem in the area of distributed system. It requires a group of peers to reach agreement on some value, even if a fraction of the peers is controlled by an adversary. This thesis proposes set union consensus, an efficient generalization of Byzantine consensus from single elements to sets. This is practically motivated by Secure Multiparty Computation protocols such as electronic voting, where a large set of elements must be collected and agreed upon. Existing practical implementations of Byzantine consensus are typically based on state machine replication and not well-suited for agreement on sets, since they must process individual agreements on all set elements in sequence. We describe and evaluate our implementation of set union consensus in GNUnet, which is based on a composition of Eppstein set reconciliation protocol with the simple gradecast consensus prococol described by Ben-Or},
         www_section = {byzantine consensus, GNUnet, secure multiparty computation, set reconciliation, voting},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ma_dold_consensus_21dec2015.pdf},
@@ -182,7 +182,7 @@
         year = {2015},
         month = jan,
         institution = {GNUnet e.V},
-        address = {Muenchen},
+        address = {M{\"u}nchen},
         www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
         journal = {unknown},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-es.pdf},
@@ -195,7 +195,7 @@
         year = {2015},
         month = jan,
         institution = {GNUnet e.V},
-        address = {Muenchen},
+        address = {M{\"u}nchen},
         www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
         journal = {unknown},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-it.pdf},
@@ -208,7 +208,7 @@
         year = {2015},
         month = jan,
         institution = {GNUnet e.V},
-        address = {Muenchen},
+        address = {M{\"u}nchen},
         www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
         journal = {unknown},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-fr.pdf},
@@ -221,7 +221,7 @@
         year = {2015},
         month = jan,
         institution = {GNUnet e.V},
-        address = {Muenchen},
+        address = {M{\"u}nchen},
         www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN, TLS},
         journal = {unknown},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-en.pdf},
@@ -356,9 +356,9 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
         year = {2014},
         month = feb,
         pages = {0--106},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Masters},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {As a means of reducing power consumption, hardware devices are capable to enter into sleep-states that have low power consumption. Waking up from those states in order to return to work is typically a rather energy-intensive activity. Some existing applications have non-urgent tasks that currently force hardware to wake up needlessly or prevent it from going to sleep. It would be better if such non-urgent activities could be scheduled to execute when the respective devices are active to maximize the duration of sleep-states. This requires cooperation between applications and the kernel in order to determine when the execution of a task will not be expensive in terms of power consumption.
         This work presents the design and implementation of Cryogenic, a POSIX-compatible API that enables clustering tasks based on the hardware activity state. Specifically, Cryogenic's API allows applications to defer their execution until other tasks use the device they want to use. As a result, two actions that contribute to reduce the device energy consumption are achieved: reduce the number of hardware wake-ups and maximize the idle periods.
         The energy measurements enacted at the end of this thesis demonstrate that, for the specific setup and conditions present during our experimentation, Cryogenic is capable to achieve savings between 1\% and 10\% for a USB WiFi device.
@@ -375,9 +375,9 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
         year = {2014},
         month = aug,
         pages = {0--49},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Bachelor's},
-        address = {Muenchen},
+        address = {M{\"u}nchen},
         abstract = {Elections are a vital tool for decision-making in democratic societies. The past decade has witnessed a handful of attempts to apply modern technology to the election process in order to make it faster and more cost-effective.
         Most of the practical efforts in this area have focused on replacing traditional voting booths with electronic terminals, but did not attempt to apply cryptographic techniques able to guarantee critical properties of elections such as secrecy of ballot and verifiability. While such techniques were extensively researched in the past 30 years, practical implementation of cryptographically secure remote electronic voting schemes are not readily available. All existing implementation we are aware of either exhibit critical security flaws, are proprietary black-box systems or require additional physical assumptions such as a preparatory key ceremony executed by the election officials. The latter makes such systems unusable for purely digital communities.
         This thesis describes the design and implementation of an electronic voting system in GNUnet, a framework for secure and decentralized networking. We provide a short survey of voting schemes and existing implementations. The voting scheme we implemented makes use of threshold cryptography, a technique which requires agreement among a large subset of the election officials to execute certain cryptographic operations. Since such protocols have applications outside of electronic voting, we describe their design and implementation in GNUnet separately},
@@ -573,9 +573,9 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
         year = {2014},
         month = feb,
         pages = {0--91},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Masters},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {The successful operation of a peer-to-peer network depends on the resilience of its peer's
 communications. On the Internet, direct connections between peers are often limited by restrictions like NATs and traffic filtering. Addressing such problems is particularly pressing for peer-to-peer networks that do not wish to rely on any trusted infrastructure, which might otherwise help the participants establish communication channels. Modern peer-to-peer networks employ various techniques to address the problem of restricted connectivity on the Internet. One interesting development is that various overlay networks now support multiple communication protocols to improve resilience and counteract service degradation.
 
@@ -598,9 +598,9 @@ The design is evaluated with the help of simulation and a realistic implementati
         year = {2014},
         month = feb,
         pages = {0--65},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Bachelor's},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {Linear programming (LP) has numerous applications in different fields. In some scenarios, e.g. supply chain master planning (SCMP), the goal is solving linear programs involving multiple parties reluctant to sharing their private information. In this case, methods from the area of secure multi-party computation (SMC) can be used. Secure multi-party versions of LP solvers have been known to be impractical due to high communication complexity. To overcome this, solutions based on problem transformation have been put forward.
 
 In this thesis, one such algorithm, proposed by Dreier and Kerschbaum, is discussed, implemented, and evaluated with respect to numerical stability and scalability. Results
@@ -686,9 +686,9 @@ This paper maps the design space and gives design requirements for censorship re
         year = {2013},
         month = jun,
         pages = {0--76},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Masters },
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {Evaluations of P2P protocols during the system's design and implementation phases are commonly done through simulation and emulation respectively.  While the current state-of-the-art simulation allows evaluations with many millions of peers through the use of abstractions, emulation still lags behind as it involves executing the real implementation at some parts of the system.  This difference in scales can make it hard to relate the evaluations made created with simulation and emulation during the design and implementation phases and can results in a limited evaluation of the implementation, which may cause severe problems after deployment.
 
 In this thesis, we build upon an existing emulator for P2P applications to push the scales offered by emulation towards the limits set by simulation.  Our approach distributes and co-ordinates the emulation across many hosts.  Large deployments are possible by deploying hundreds or thousands of peers on each host.
@@ -764,9 +764,9 @@ In this paper we describe the problems that occur when debugging widely distribu
         year = {2013},
         month = nov,
         pages = {0--124},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Master's},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {SPDY is a rather new protocol which is an alternative to HTTP. It was designed to address inefficiencies in the latter and thereby improve latency and reduce bandwidth consumption.
 
 This thesis presents the design and implementation of a setup for utilizing SPDY within the anonymizing Tor network for reducing latency and traffic in the latter. A C library implementing the SPDY server protocol is introduced together with an HTTP to SPDY and a SPDY to HTTP proxy which are the base for the presented design.
@@ -895,9 +895,9 @@ This thesis includes extensive measurement data highlighting the possible benefi
         year = {2012},
         month = nov,
         pages = {0--100},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Masters},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {This thesis presents a novel approach for decentralized evaluation of regular expressions for capability discovery in DHT-based overlays. The system provides support for announcing capabilities expressed as regular expressions and discovering participants offering adequate capabilities. The idea behind our approach is to convert regular expressions into finite automatons and store the corresponding states and transitions in a DHT. We show how locally constructed DFA are merged in the DHT into an NFA without the knowledge of any NFA already present in the DHT and without the need for any central authority. Furthermore we present options of optimizing the DFA. There exist several possible applications for this general approach of decentralized regular expression evaluation. However, in this thesis we focus on the application of discovering users that are willing to provide network access using a specified protocol to a particular destination. We have implemented the system for our proposed approach and conducted a simulation. Moreover we present the results of an emulation of the implemented system in a cluster},
         www_section = {DFA, distributed hash table, GNUnet, NFA, regular expressions, search},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/szengel2012ms.pdf},
@@ -912,7 +912,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
         pages = {0--116},
         school = {TU Munich},
         type = {Master's},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {This thesis presents the design and implementation of the GNU Alternative Domain System (GADS), a decentralized, secure name system providing memorable names for the Internet as an alternative to the Domain Name System (DNS).  The system builds on ideas from Rivest's Simple Distributed Security Infrastructure (SDSI) to address a central issue with providing a decentralized mapping of secure identifiers to memorable names: providing a global, secure and memorable mapping is impossible without a trusted authority.  SDSI offers an alternative by linking local name spaces; GADS uses the transitivity provided by the SDSI design to build a decentralized and censorship resistant name system without a trusted root based on secure  delegation of authority. Additional details need to be considered in order to enable GADS to integrate smoothly with the World Wide Web.  While following links on the Web matches following delegations in GADS, the existing HTTP-based infrastructure makes many assumptions about globally unique names; however, proxies can be used to enable legacy applications to function with GADS. This work presents the fundamental goals and ideas behind GADS, provides technical details on how GADS has been implemented and discusses deployment issues for using GADS with existing systems.  We discuss how GADS and legacy DNS can interoperate during a transition period and what additional security advantages GADS offers over DNS with Security Extensions (DNSSEC).  Finally, we present the results of a survey into surfing behavior, which suggests that the manual introduction of new direct links in GADS will be infrequent},
         www_section = {censorship resistance, decentralized, DNS, GNU Name System, GNUnet},
         www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/schanzen2012msc.pdf},
@@ -943,8 +943,8 @@ Interestingly, the design of our mechanism is quite different from the tradition
         title = {Efficient and Secure Decentralized Network Size Estimation},
         year = {2012},
         month = may,
-        institution = {Technische Universitaet Muenchen},
-        address = {Garching bei Muenchen},
+        institution = {Technische Universit{\"a}t M{\"u}nchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {The size of a Peer-to-Peer (P2P) network is an important parameter for
 performance tuning of P2P routing algorithms.  This paper introduces
 and evaluates a new efficient method for participants in an
@@ -1117,9 +1117,9 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
         year = {2012},
         month = jul,
         pages = {0--78},
-        school = {Technische Universitaet Muenchen},
+        school = {Technische Universit{\"a}t M{\"u}nchen},
         type = {Masters},
-        address = {Garching bei Muenchen},
+        address = {Garching bei M{\"u}nchen},
         abstract = {Debugging is tedious and time consuming work that, for certain types of bugs, can and should be automated. Debugging distributed systems is more complex due to time dependencies between interacting processes. Another related problem is duplicate bug reports in bug repositories. Finding bug duplicates is hard and wastes developers' time which may affect the development team's rate of bug fixes and new releases.
 In this master thesis we introduce Monkey, a new tool that provides a solution for automated classification, investigation and characterization of bugs, as well as a solution for comparing bug reports and avoiding duplicates. Our tool is particularly suitable for distributed systems due to its autonomy. We present Monkey's key design goals and architecture and give experimental results demonstrating the viability of our approach},
         www_section = {automation, debugging, distributed systems},