@electronic{strobl2016issues,
  abstract = {The recent launch of the Ethereum blockchain platform has triggered the interest in the decentralized
autonomous organizations (DAOs). DAOs aim to become businesses residing on the blockchain, investing
their funds obtained through initial token offerings. These tokens entitle the owner to vote on investment
and management decisions of the DAO and to obtain eventual dividend. In this paper, I discuss
several issues that stem from the organizational design of the DAO, that can potentially lead to DAO’s
organizational and functional breakdown. While some originate in the voting mechanism itself, other
emerge through the misalignment of interest between the DAO and the project or service provider. I also
discuss the impact on the token price and a bit of a legal perspective on the matter.},
  author = {Strobl, Martin},
  interhash = {2f56d9043f84363dfc7ae06fdce66794},
  intrahash = {9b49978ee41f86905ea60c888e0947da},
  title = {On the issues with decentralized autonomous organizations},
  url = {http://martinstrobl.cz/papers/On%20the%20issues%20within%20the%20DAOs.pdf},
  year = 2016
}

@inproceedings{conf/cla/BorchmannH16,
  author = {Borchmann, Daniel and Hanika, Tom},
  booktitle = {CLA},
  crossref = {conf/cla/2016},
  editor = {Huchard, Marianne and Kuznetsov, Sergei},
  ee = {http://ceur-ws.org/Vol-1624/paper5.pdf},
  interhash = {e8ddef8aeb9b874f97a1a8230332b7c4},
  intrahash = {8af414e45f306527e8316ac681fe7f08},
  pages = {57-69},
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  title = {Some Experimental Results on Randomly Generating Formal Contexts.},
  url = {http://dblp.uni-trier.de/db/conf/cla/cla2016.html#BorchmannH16},
  volume = 1624,
  year = 2016
}

@book{noauthororeditor2015abschied,
  address = {Essen},
  editor = {Bala, Christian and Müller, Klaus},
  interhash = {1a17ca906ec88801ff6189546ebcd918},
  intrahash = {4d7a57e5baf9566f11add583b07a59ec},
  isbn = {3837509974 9783837509977},
  publisher = {Klartext-Verl.},
  refid = {934646445},
  title = {Abschied vom Otto Normalverbraucher moderne Verbraucherforschung: Leitbilder, Informationen, Konsum und Demokratie},
  url = {http://www.worldcat.org/search?qt=worldcat_org_all&q=9783837509977},
  year = 2015
}

@inproceedings{vig2009tagsplanations,
  abstract = {While recommender systems tell users what items they might like, explanations of recommendations reveal why they might like them. Explanations provide many benefits, from improving user satisfaction to helping users make better decisions. This paper introduces tagsplanations, which are explanations based on community tags. Tagsplanations have two key components: tag relevance, the degree to which a tag describes an item, and tag preference, the user's sentiment toward a tag. We develop novel algorithms for estimating tag relevance and tag preference, and we conduct a user study exploring the roles of tag relevance and tag preference in promoting effective tagsplanations. We also examine which types of tags are most useful for tagsplanations.},
  address = {New York, NY, USA},
  author = {Vig, Jesse and Sen, Shilad and Riedl, John},
  booktitle = {IUI '09: Proceedings of the 13th International Conference on Intelligent User Interfaces},
  doi = {10.1145/1502650.1502661},
  interhash = {dabcca79d5af180632a26ff292859671},
  intrahash = {ed47adb106d45bb3ac20dd78c603532e},
  isbn = {978-1-60558-168-2},
  location = {Sanibel Island, Florida, USA},
  pages = {47--56},
  publisher = {ACM},
  title = {Tagsplanations: explaining recommendations using tags},
  url = {http://portal.acm.org/citation.cfm?id=1502661},
  year = 2009
}

@inproceedings{ames2007motivations,
  abstract = {Why do people tag? Users have mostly avoided annotating media such as photos -- both in desktop and mobile environments -- despite the many potential uses for annotations, including recall and retrieval. We investigate the incentives for annotation in Flickr, a popular web-based photo-sharing system, and ZoneTag, a cameraphone photo capture and annotation tool that uploads images to Flickr. In Flickr, annotation (as textual tags) serves both personal and social purposes, increasing incentives for tagging and resulting in a relatively high number of annotations. ZoneTag, in turn, makes it easier to tag cameraphone photos that are uploaded to Flickr by allowing annotation and suggesting relevant tags immediately after capture.</p> <p>A qualitative study of ZoneTag/Flickr users exposed various tagging patterns and emerging motivations for photo annotation. We offer a taxonomy of motivations for annotation in this system along two dimensions (sociality and function), and explore the various factors that people consider when tagging their photos. Our findings suggest implications for the design of digital photo organization and sharing applications, as well as other applications that incorporate user-based annotation.},
  acmid = {1240772},
  address = {New York, NY, USA},
  author = {Ames, Morgan and Naaman, Mor},
  booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems},
  doi = {10.1145/1240624.1240772},
  interhash = {bd24c17d66d2b904b3fc9444c2b64b44},
  intrahash = {bc08f76536610f3f376bece5f0b46ad5},
  isbn = {978-1-59593-593-9},
  location = {San Jose, California, USA},
  numpages = {10},
  pages = {971--980},
  publisher = {ACM},
  series = {CHI '07},
  title = {Why we tag: motivations for annotation in mobile and online media},
  url = {http://doi.acm.org/10.1145/1240624.1240772},
  year = 2007
}

@preprint{heuser2014sorting,
  abstract = {Our amounts of data are growing rapidly, but we need to keep them in order. Resultingly one frequent issue is sorting this data. There are many sorting algorithms out there, which differ in their functionallity, stability, performance and space complexity. In this paper you will get to know three methods named Shell-, Merge- and Quicksort. Their special characteristics are explained and which to use when.},
  author = {Heuser, Bastian},
  interhash = {50682a319510fd4007c1ec9d4dd92b0a},
  intrahash = {db02cebc086de0c136a600acb0acca50},
  pages = 12,
  title = {Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort (2nd ed.)},
  year = 2014
}

@phdthesis{lindner2013philosophie,
  address = {Stuttgart},
  author = {Lindner, Urs},
  edition = {1. Aufl.},
  format = {book},
  interhash = {e9f05ae3aba0e4ca68cb9a090c43f6bf},
  intrahash = {73b1d2dbe2403847af54c902f58724e6},
  isbn = {9783896570604},
  note = {Zugl.: Berlin, Freie Univ., Diss., 2010},
  primaryauthor = {Lindner, Urs},
  publisher = {Schmetterling-Verl.},
  shortsubtitle = {: wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheorie},
  shorttitle = {Marx und die Philosophie : wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheorie},
  subtitle = {wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheorie / Urs Lindner},
  title = {Marx und die Philosophie : wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheorie},
  titlestatement = {Urs Lindner},
  uniqueid = {HEB230483747},
  url = {http://d-nb.info/1018402225/04},
  year = 2013
}

@article{heuser2014bastian,
  author = {Heuser, Basler},
  editor = {Heuser},
  interhash = {c718a3e32a1ec0ac3f032f9367b52b7a},
  intrahash = {1d3dda9131be1b081abb1143ea00c131},
  title = {Bastian Heuser gelesen von Christoph Basler},
  year = 2014
}

@preprint{hruschka2014laufzeitvergleich,
  author = {Hruschka, Benedikt},
  editor = {Hruschka, Benedikt},
  interhash = {48a5d92ae99d183daac0e65fdc92f32a},
  intrahash = {d073268c29889e8b183ba8147ce706a8},
  title = {Laufzeitvergleich von Vergleichsbasierten Sortieralgorithmen auf Sortieren und Unsortierten Datensätzen},
  year = 2014
}

@preprint{beer2014vergleich,
  abstract = {Es gibt viele verschiedene Sortieralgorithmen, die
alle unterschiedliche Laufzeiten und unterschiedlichen Speicherplatz benotigen.
Fur diese Arbeit wurden die drei Sortieralgorithmen InsertionSort, BubbleSort
und Quicksort ausgesucht, um sie auf Laufzeit und Speicherplatz
miteinander zu vergleichen. Auf den nachsten Seiten folgt ein kleiner
Uberblick uber Sortieralgorithmen im Allgemeinen. Danach werden
die drei Sortierverfahren vorgestellt und durch Experimente miteinander
verglichen. Als Ergebnis bleibt festzuhalten, dass InsertionSort und
BubbleSort bei (fast) sortierten Folgen eine bessere Laufzeit als QuickSort besitzen. Ansonsten erweist sich aber QuickSort als das schnellste
Sortierverfahren.},
  author = {Beer, Gerald},
  day = 22,
  interhash = {c342bca08522ec4023e31f539860c9fb},
  intrahash = {1672576bd8ea59eed89c3e6e57381a05},
  month = {06},
  pages = {1 -13},
  title = {Vergleich von Sortieralgorithmen},
  type = {Seminar},
  year = 2014
}

@preprint{basler2014vergleich,
  author = {Basler, Christoph},
  interhash = {d1e0e28131a4c06bed6528476a67d37e},
  intrahash = {e6bda3c45a3f32f92f41f2aac99cc739},
  title = {Vergleich von Sortieralgorithmen},
  year = 2014
}

@preprint{heuser2014sorting,
  abstract = {Our amounts of data are growing rapidly, but we need to keep them in order. Resultingly one frequent issue is sorting this data. There are many sorting algorithms out there, which differ in their functionallity, stability, performance and space complexity. In this paper you will get to know three methods named Shell-, Merge- and Quicksort. Their special characteristics are explained and which to use when.},
  author = {Heuser, Bastian},
  interhash = {8acfc9b953a3c116fe6d52b2e1b5704b},
  intrahash = {5afc2968e62d28a1a318c77e9f4f8d22},
  pages = 12,
  title = {Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort},
  year = 2014
}

@preprint{berndt2014comparing,
  author = {Berndt, Maximilian},
  editor = {Berndt, Maximilian},
  interhash = {68e8f90d34280fb0e924b3297232eec1},
  intrahash = {4b8ad5987d785ece31ceb7baef18ac6d},
  title = {Comparing Sorting Algorithms for Sorted and Unsorted Input},
  year = 2014
}

@preprint{bottger2013vergleich,
  abstract = {Gegenstand dieser Arbeit ist der Vergleich der Sortierverfahren Radixsort, 
Mergesort und Quicksort. Alle drei Algorithmen werden zunächst ausführlich 
vorgestellt und ihre Funktionsweise erläutert. Dabei wird die Komplexität 
und das resultierende Laufzeitverhalten theoretisch betrachtet und 
die daraus entstehenden Vor- und Nachteile diskutiert. In einem Versuch 
werden zudem alle drei Algorithmen unter realen Bedingungen auf einem 
Computer getestet, um die theoretischen Betrachtungen zu untermauern.},
  author = {Böttger, Sebastian},
  interhash = {efc0acb2ef562534134741e6e652136e},
  intrahash = {13fe0c4bf045dfad24b8e206e4f10b2c},
  school = {University of Kassel},
  title = {Vergleich von Sortiertverfahren},
  year = 2013
}

@preprint{herwigvergleiche,
  author = {Herwig, S},
  interhash = {e0f712f4a97485de1090db0714bfffad},
  intrahash = {72020200333e343caf047c087b39fb3f},
  title = {Vergleiche von Sortieralgorithmen},
  year = 2013
}

@preprint{lobig2013analysis,
  author = {Löbig, Thorsten},
  interhash = {d82c38272a6bdb91685deb6a8af76ae2},
  intrahash = {4fe8fa2b5700d2119f8e6ef3183f55df},
  title = {Analysis of asymptotically optimal comparison-based Sorting Algorithms},
  year = 2013
}

@preprint{bauer2013vergleich,
  author = {Bauer, Pascal},
  interhash = {1285c52223520ec961f2ef46f7e92816},
  intrahash = {7048deab881c40433b51374c9606a82e},
  title = {Vergleich von Sortieralgorithmen},
  year = 2013
}

@preprint{iske2013vergleich,
  abstract = {In dieser Arbeit werden die drei vergleichsbasierten
Sortierverfahren BubbleSort, InsertionSort und QuickSort hinsichtlich
ihrer Laufzeit miteinander verglichen. Die Verfahren werden zunachst
vorgestellt und ihre Funktionsweise erklart. Anschlieend werden mittels
eines Java-Frameworks die Vergleichs- und Tauschoperationen fur
verschiedene Problemgroen experimentell ermittelt und analysiert.},
  author = {Iske, Andre},
  interhash = {cf544ab8a889b2f7ecbf41d62f98b130},
  intrahash = {3e1119ff7a8b6b7554919b72d5168637},
  key = {iske2013vergleich},
  school = {Universität Kassel},
  title = {Vergleich von Sortierverfahren},
  year = 2013
}

@preprint{thielelaufzeitanalysvergleich,
  author = {Thiele, Mathias},
  interhash = {6f936bd5a8b89cd85fb82658f13eec16},
  intrahash = {ddad8d2bd5597e1ff07f7cf74536650b},
  title = {Laufzeitanalyse vergleichsbasierter Sortieralgorithmen},
  year = 2013
}

@preprint{merz2013vergleich,
  author = {Merz, Marcel},
  interhash = {52a692e33463c83de2d6b68f4743a52d},
  intrahash = {44a73aa55d15cc950cf2539da99d6d8e},
  title = {Vergleich von Sortieralgorithmen},
  year = 2013
}