@inbook{19400,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Deutsche Dramatiker des 20. Jahrhunderts}},
  editor       = {{Allkemper, Alo and Eke, Norbert Otto}},
  pages        = {{382--402}},
  publisher    = {{Erich Schmidt}},
  title        = {{{George Tabori}}},
  year         = {{2000}},
}

@inbook{19401,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Willibald Alexis (1798-1871). Ein Autor des Vor- und Nachmärz}},
  editor       = {{Beutin, Wolfgang and Stein, Peter}},
  pages        = {{55--80}},
  publisher    = {{Aisthesis}},
  title        = {{{Der Kritiker in der Kritik. Willibald Alexis, das Junge Deutschland und Alexis' autobiographische Fragmente Erinnerungen aus meinem Leben}}},
  year         = {{2000}},
}

@inbook{19403,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Literatur und Demokratie}},
  editor       = {{Allkemper, Alo and Eke, Norbert Otto}},
  pages        = {{285--300}},
  publisher    = {{Erich Schmidt}},
  title        = {{{Wahrnehmung im Augen-Schein. Thomas Braschs (und Jurek Beckers) filmische Reflexion über die Kunst nach Auschwitz: „Der Passagier – Welcome to Germany“}}},
  year         = {{2000}},
}

@misc{23424,
  author       = {{Zimmer, Detmar}},
  title        = {{{Aus einem Getriebemodul und einem Antriebsmodul bestehende Antriebseinheit}}},
  year         = {{2000}},
}

@misc{23425,
  author       = {{Zimmer, Detmar}},
  title        = {{{Getriebebaukasten mit Kronengetriebe}}},
  year         = {{2000}},
}

@inproceedings{17990,
  abstract     = {{We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.}},
  author       = {{Czumaj, Artur and Sohler, Christian and Ziegler, Martin}},
  booktitle    = {{Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)}},
  isbn         = {{9783540410041}},
  issn         = {{0302-9743}},
  pages        = {{155--166}},
  publisher    = {{Springer}},
  title        = {{{Property Testing in Computational Geometry}}},
  doi          = {{10.1007/3-540-45253-2_15}},
  volume       = {{4698}},
  year         = {{2000}},
}

@book{18121,
  editor       = {{Fromme, J. and Ganguin, S. and Iske, S. and Meister, Dorothee M. and Sander, U.}},
  publisher    = {{VS Verlag}},
  title        = {{{Medienbildung und Gesellschaft}}},
  year         = {{2000}},
}

@inproceedings{18146,
  abstract     = {{Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.}},
  author       = {{Ziegler, Martin and Brattka, Vasco}},
  booktitle    = {{SOFSEM 2000: Theory and Practice of Informatics}},
  isbn         = {{9783540413486}},
  issn         = {{0302-9743}},
  pages        = {{450--458}},
  publisher    = {{Springer}},
  title        = {{{Computing the Dimension of Linear Subspaces}}},
  doi          = {{10.1007/3-540-44411-4_34}},
  volume       = {{1963}},
  year         = {{2000}},
}

@inproceedings{18150,
  abstract     = {{What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.<br>This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).<br>We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7.}},
  author       = {{Ziegler, Martin and Sohler, Christian}},
  booktitle    = {{Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)}},
  pages        = {{73--79}},
  title        = {{{Computing Cut Numbers}}},
  year         = {{2000}},
}

@article{18446,
  abstract     = {{We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called periodic. The number of parallel steps performed during a single run of M is called its period, the sorting time of M is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorting networks have the advantage that they need little hardware (control logic, wiring, area) and that they are adaptive. We are interested in comparator networks of a constant period, due to their potential applications in hardware design.

Previously, very little was known on such networks. The fastest solutions required time O(nε) where the depth was roughly 1/ε. We introduce a general method called periodification scheme that converts automatically an arbitrary sorting network that sorts n items in time T(n) and that has layout area A(n) into a sorting network that has period 5, sorts ***(n • T(n) items in time O(T(<n)• log n), and has layout area O(A(n)) • T(n)). In particular, applying this scheme to Batcher's algorithms, we get practical period 5 comparator networks that sort in time O(log3n). For theoretical interest, one may use the AKS netork resulting in a period 5 comparator network with runtime O(log2n).}},
  author       = {{Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}},
  journal      = {{Journal of the ACM}},
  pages        = {{944--967}},
  title        = {{{Periodification Scheme: Constructing Sorting Networks with Constant Period}}},
  doi          = {{10.1145/355483.355490}},
  volume       = {{45}},
  year         = {{2000}},
}

@inproceedings{2211,
  author       = {{Czumaj, Artur and Scheideler, Christian}},
  booktitle    = {{32nd ACM Symposium on Theory of Computing}},
  pages        = {{38--47}},
  title        = {{{A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }}},
  year         = {{2000}},
}

@article{21782,
  author       = {{Domik, Gitta}},
  journal      = {{IEEE Computer Graphics and Applications}},
  number       = {{4}},
  pages        = {{16--19}},
  publisher    = {{IEEE}},
  title        = {{{Do we need formal education in visualization?}}},
  doi          = {{10.1109/38.851744}},
  volume       = {{20}},
  year         = {{2000}},
}

@inproceedings{21783,
  author       = {{Volbracht, Sabine and Domik, Gitta}},
  booktitle    = {{Virtual Environments 2000}},
  editor       = {{Mulder, Jurriaan and van Liere, Robert}},
  isbn         = {{978-3-7091-6785-4}},
  pages        = {{55--64}},
  publisher    = {{Springer Vienna}},
  title        = {{{Developing Effective Navigation Techniques in Virtual 3D Environments}}},
  year         = {{2000}},
}

@proceedings{7790,
  editor       = {{Ehrig, Hartmut and Engels, Gregor and Kreowksi, H.-J. and Taentzer, Gabriele}},
  number       = {{2}},
  publisher    = {{Elsevier}},
  title        = {{{Special Issue: Selected Papers of GRATRA 2000}}},
  volume       = {{44}},
  year         = {{2000}},
}

@proceedings{7791,
  editor       = {{Rolim, J.D.P. and Broder, A.Z. and Corradini, A. and Gorrieri, R. and Heckel, R. and Hromkovic, J. and Vaccaro, U. and Wells, J.B.}},
  publisher    = {{Carleton Scientific}},
  title        = {{{Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland)}}},
  year         = {{2000}},
}

@inproceedings{7861,
  author       = {{Lohmann, Marc and Wagner, Annika}},
  booktitle    = {{Proceedings of Net.Object Days 2000, Erfurt (Germany)}},
  title        = {{{Konzeption eines XML-fähigen Mailtools}}},
  year         = {{2000}},
}

@inproceedings{7862,
  author       = {{Thöne, Sebastian}},
  booktitle    = {{Proceedings of the Informatiktage 2000, Bad Schussenried (Germany)}},
  publisher    = {{Konradin-Verlag}},
  title        = {{{Entwicklung eines Übersetzers von Nachrichtenaustauschformaten für Bankselbstbedienungssysteme in XML-Formate}}},
  year         = {{2000}},
}

@inproceedings{7863,
  author       = {{Cherchago, Alexey and Alexandrova, N.}},
  booktitle    = {{Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia)}},
  title        = {{{A Model of a Physician’s Decision-Making Process using Electropunctural Methods of Diagnostics}}},
  year         = {{2000}},
}

@inproceedings{7864,
  author       = {{Depke, Ralph and Langham, Matthew and Lütkemeier, Björn and Thöne, Sebastian}},
  booktitle    = {{Proceedings of the Net.ObjectDays (2000), Erfurt (Germany)}},
  title        = {{{Ein Konzept zur Generierung von XSL-Transformationen und dessen Anwendung bei Bankselbstbedienungssystemen}}},
  year         = {{2000}},
}

@inproceedings{7872,
  author       = {{Engels, Gregor and Heckel, Reiko}},
  booktitle    = {{Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), Geneva (Switzerland)}},
  pages        = {{127--150}},
  publisher    = {{Springer}},
  title        = {{{Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution}}},
  doi          = {{http://dx.doi.org/10.1007/3-540-45022-X_12}},
  volume       = {{1853}},
  year         = {{2000}},
}