@phdthesis{25563, author = {{Danne, Klaus}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Real-Time Multitasking in Embedded Systems Based on Reconfigurable Hardware}}}, volume = {{213}}, year = {{2006}}, } @misc{19481, author = {{Eke, Norbert Otto}}, booktitle = {{Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik}}, editor = {{Brunner, Horst and Moritz, Rainer}}, pages = {{68--70}}, publisher = {{Erich Schmidt}}, title = {{{Bürgerliches Trauerspiel}}}, year = {{2006}}, } @misc{19484, author = {{Eke, Norbert Otto}}, booktitle = {{Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik}}, editor = {{Brunner, Horst and Moritz, Rainer}}, pages = {{74--79}}, publisher = {{Erich Schmidt}}, title = {{{DDR-Literatur}}}, year = {{2006}}, } @misc{19486, author = {{Eke, Norbert Otto}}, booktitle = {{Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik}}, editor = {{Brunner, Horst and Moritz, Rainer}}, pages = {{411--414}}, publisher = {{Erich Schmidt}}, title = {{{Tragödie}}}, year = {{2006}}, } @misc{19518, author = {{Eke, Norbert Otto}}, booktitle = {{Germanistik}}, number = {{H. 1/2}}, pages = {{480f.}}, title = {{{Kathrin Krause: Robert Menasses Trilogie der Entgeisterung. Ein Beitrag zur Theorie des Romans. Bielefeld: Aisthesis, 2005}}}, volume = {{47}}, year = {{2006}}, } @misc{19519, author = {{Eke, Norbert Otto}}, booktitle = {{Germanistik}}, number = {{H. 1/2}}, pages = {{431}}, title = {{{Ariana Eichenberg: Zwischen Erfahrung und Erfindung. Jüdische Lebensentwürfe nach der Shoah. Köln u.a.: Böhlau, 2004}}}, volume = {{47}}, year = {{2006}}, } @phdthesis{19612, author = {{Klein, Jan}}, isbn = {{3-939350-05-2}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Efficient Collision Detection for Point and Polygon Based Models}}}, volume = {{186}}, year = {{2006}}, } @phdthesis{19613, author = {{Rührup, Stefan}}, isbn = {{978-3-939350-22-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Position-based Routing Strategies}}}, volume = {{203}}, year = {{2006}}, } @article{1964, author = {{Krimphove, Dieter}}, journal = {{Rechtstheorie}}, number = {{Jg. 36, Heft 3}}, pages = {{365 – 390}}, publisher = {{Dunker und Humblot}}, title = {{{Sprache und Recht. Zur rechttheoretischen Entsprechung zwei-er Phänomene }}}, year = {{2006}}, } @inbook{1966, author = {{Krimphove, Dieter}}, booktitle = {{Finanzwirtschaft Finanzdienstleistungen Empirische Wirtschaftsforschung}}, editor = {{Schmeisser, Wilhelm and Zündorf, Horst and Eckstein, Peter and Krimphove, Dieter}}, pages = {{111 – 138}}, publisher = {{Rainer Hampp Verlag}}, title = {{{Rechtsfragen des Personalcontrollings – Eine Übersicht}}}, year = {{2006}}, } @inproceedings{19690, author = {{Briest, Patrick and Krysta, Piotr}}, booktitle = {{Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)}}, title = {{{Single-Minded Unlimited Supply Pricing on Sparse Instances}}}, year = {{2006}}, } @inproceedings{19691, author = {{Briest, Patrick and Gunia, Christian}}, booktitle = {{Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)}}, title = {{{Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels}}}, year = {{2006}}, } @inbook{19697, author = {{Büker, Petra}}, booktitle = {{Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe}}, editor = {{Kammler, Clemens}}, pages = {{24--49}}, publisher = {{Klett/Kallmeyer}}, title = {{{Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr)}}}, year = {{2006}}, } @article{19698, author = {{Büker, Petra}}, journal = {{Beiträge Jugendliteratur und Medien }}, number = {{H. 2}}, pages = {{104--111}}, title = {{{Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe}}}, volume = {{58, H. 2}}, year = {{2006}}, } @article{19699, author = {{Büker, Petra}}, journal = {{Praxis Deutsch }}, pages = {{16--22}}, title = {{{„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen}}}, volume = {{33, H.196}}, year = {{2006}}, } @misc{19718, author = {{Degener, Bastian}}, title = {{{Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}}}, year = {{2006}}, } @inproceedings{19808, abstract = {{We study the problem of designing an adaptive hash table for redundant data storage in a system of storage devices with arbitrary capacities. Ideally, such a hash table should make sure that (a) a storage device with x% of the available capacity should get x% of the data, (b) the copies of each data item are distributed among the storage devices so that no two copies are stored at the same device, and (c) only a near-minimum amount of data replacements is necessary to preserve (a) and (b) under any change in the system. Hash tables satisfying (a) and (c) are already known, and it is not difficult to construct hash tables satisfying (a) and (b). However, no hash table is known so far that can satisfy all three properties as long as this is in principle possible. We present a strategy called SPREAD that solves this problem for the first time. As long as (a) and (b) can in principle be satisfied, SPREAD preserves (a) for every storage device nearly optimal, with high probability, guarantees (b) for every data item, and only needs a constant factor more data replacements than minimum possible in order to preserve (a) and (b).}}, author = {{Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06}}, isbn = {{1595934529}}, pages = {{308----317}}, title = {{{Distributed random digraph transformations for peer-to-peer networks}}}, doi = {{10.1145/1148109.1148162}}, year = {{2006}}, } @inproceedings{19838, author = {{Rührup, Stefan and Schindelhauer, Christian}}, booktitle = {{Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}}, isbn = {{9783540496946}}, issn = {{0302-9743}}, title = {{{Online Multi-path Routing in a Maze}}}, doi = {{10.1007/11940128_65}}, year = {{2006}}, } @inproceedings{19839, abstract = {{Storage Area Networks commonly consist a more or less static set of n data servers that handle a dynamic collection of m documents. Such SANs can minimize the access time to documents by distributing each document among several servers, allowing users to access documents in parallel. This paper describes an efficient solution for providing parallel access to multiple hard disks for popular content. In extension to previous approaches we provide an efficient and elegant hash table data structure for utilizing the full capacity of each data server. Concerning the dynamics, documents as well as server may be added or removed from the system causing only local changes. We consider sequential and parallel access to data in the average case. For the average time model we present a fast optimal algorithm.}}, author = {{Schindelhauer, Christian and Schomaker, Gunnar}}, booktitle = {{5th International Conference on Networking (ICN)}}, isbn = {{0769525520}}, title = {{{SAN Optimal Multi Parameter Access Scheme}}}, doi = {{10.1109/icniconsmcl.2006.190}}, year = {{2006}}, } @techreport{19840, author = {{Rührup, Stefan and Schindelhauer, Christian}}, title = {{{Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks}}}, year = {{2006}}, }