@phdthesis{19605, author = {{Lürwer-Brüggemeier, Katharina}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}}}, volume = {{261}}, year = {{2009}}, } @phdthesis{19614, author = {{Mense, Mario}}, isbn = {{978-3-939350-79-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{On Fault-Tolerant Data Placement in Storage Networks}}}, volume = {{260}}, year = {{2009}}, } @phdthesis{19617, author = {{Kortenjan, Michael}}, isbn = {{978-3-939350-77-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}}}, volume = {{258}}, year = {{2009}}, } @phdthesis{19618, author = {{Bonorden, Olaf}}, isbn = {{978-3-939350-76-7}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}}}, volume = {{257}}, year = {{2009}}, } @inbook{19633, author = {{Büker, Petra}}, booktitle = {{Europäisierung der Bildung. Konsequenzen und Herausforderungen für die Grundschulpädagogik (Jahrbuch Grundschulforschung, Bd. 13)}}, editor = {{Röhner, Charlotte and Henrichwark, Claudia and Hopf, Michaela}}, pages = {{179--183}}, publisher = {{VS Verlag}}, title = {{{Europäische Bildung im Sachunterricht – Bilanz und Perspektiven für Forschung und Praxis}}}, volume = {{Bd. 13}}, year = {{2009}}, } @article{19635, author = {{Büker, Petra}}, journal = {{Praxis Deutsch }}, number = {{H. 214}}, pages = {{13--17}}, title = {{{Leistungsbezogenes Feedback in der Grundschule. Referate vorbereiten, vortragen und bewerten}}}, volume = {{36, H. 214}}, year = {{2009}}, } @techreport{19722, author = {{Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}}, title = {{{Complexity and approximation of a geometric local robot assignment problem}}}, year = {{2009}}, } @inbook{19724, abstract = {{We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.}}, author = {{Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}}, booktitle = {{Algorithmic Aspects of Wireless Sensor Networks}}, isbn = {{9783642054334}}, issn = {{0302-9743}}, pages = {{252--262}}, publisher = {{Springer}}, title = {{{Complexity and Approximation of a Geometric Local Robot Assignment Problem}}}, doi = {{10.1007/978-3-642-05434-1_25}}, year = {{2009}}, } @article{1982, author = {{Krimphove, Dieter}}, journal = {{Rechtstheorie}}, number = {{Jg. 39, Heft 1}}, pages = {{105 – 138}}, publisher = {{Dunker und Humblot}}, title = {{{Was ist Wahrheit – Die ökonomische Seite des Phänomens}}}, year = {{2009}}, } @techreport{19825, abstract = {{Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.}}, author = {{Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}}, publisher = {{Paderborn, Germany}}, title = {{{3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}}}, year = {{2009}}, }