@article{2561,
  author       = {{Betz, Stefan}},
  journal      = {{Zeitschrift für Betriebswirtschaft}},
  pages        = {{pp. 425 -- 444}},
  title        = {{{Die Berücksichtigung von technischem Fortschritt im Konzept der investitionstheoretisch fundierten Abschreibung}}},
  volume       = {{65}},
  year         = {{1995}},
}

@article{2563,
  author       = {{Betz, Stefan}},
  journal      = {{Zeitschrift für Planung}},
  pages        = {{pp. 167 -- 183}},
  title        = {{{Die Bedeutung der Periodenplanbeschäftigung im Rahmen einer investitionstheoretisch fundierten Kostenrechnung}}},
  volume       = {{6}},
  year         = {{1995}},
}

@misc{19555,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Wirkendes Wort}},
  number       = {{H. 2}},
  pages        = {{357--359}},
  title        = {{{Ingo Schmidt, Florian Vaßen. Unter Mitarbeit von Uwe Sänger sowie Roger Fornhoff, Anja Maria Prochaska und Hendrik Werner: Bibliographie Heiner Müller 1948-1992. Bielefeld 1993}}},
  volume       = {{45}},
  year         = {{1995}},
}

@misc{19556,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Zeitschrift für Germanistik}},
  number       = {{H. 1}},
  pages        = {{149--151}},
  title        = {{{Bürgerlichkeit im Umbruch. Studien zum deutschsprachigen Drama 1750-1800. Mit einer Bibliographie der Dramen der Oettingen-Wallersteinschen Bibliothek zwischen 1750 und 1800. Hg. von Helmut Koopmann. Tübingen 1993}}},
  volume       = {{NF V}},
  year         = {{1995}},
}

@phdthesis{19623,
  author       = {{Stemann, Volker}},
  isbn         = {{3-931466-02-7}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Contention Resolution in Hashing Based Shared Memory Simulations}}},
  volume       = {{3}},
  year         = {{1995}},
}

@phdthesis{19627,
  author       = {{Czumaj, Artur}},
  isbn         = {{3-931466-07-8}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations}}},
  volume       = {{8}},
  year         = {{1995}},
}

@phdthesis{19630,
  author       = {{Wachsmann, Alf}},
  isbn         = {{3-931466-05-1}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher}}},
  volume       = {{6}},
  year         = {{1995}},
}

@phdthesis{19634,
  author       = {{Ameur, Foued}},
  isbn         = {{3-931466-09-4}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Space-Bounded Learning Algorithms}}},
  volume       = {{10}},
  year         = {{1995}},
}

@inproceedings{2447,
  author       = {{Röttger, Markus and Schroeder, Ulf-Peter and Simon, Jens}},
  booktitle    = {{Proc. Int. Conf. on High-Performance Computing and Networking}},
  pages        = {{781--786}},
  publisher    = {{Springer}},
  title        = {{{Implementation of a Parallel and Distributed Mapping Kernel for PARIX}}},
  doi          = {{10.1007/BFb0046714}},
  volume       = {{919}},
  year         = {{1995}},
}

@inproceedings{2448,
  author       = {{Römke, Thomas and Röttger, Markus and Schroeder, Ulf-Peter and Simon, Jens}},
  booktitle    = {{Proc. ZEUS Workshop on Par. Programming and Computation}},
  publisher    = {{IOS Press}},
  title        = {{{An Efficient Mapping Library for Parix}}},
  year         = {{1995}},
}

@inproceedings{2449,
  author       = {{Römke, Thomas and Röttger, Markus and Schroeder, Ulf-Peter and Simon, Jens}},
  booktitle    = {{Proc. European Conf. on Parallel Processing (Euro-Par)}},
  isbn         = {{978-3-540-44769-6}},
  pages        = {{179--192}},
  publisher    = {{Springer}},
  title        = {{{On Efficient Embeddings of Grids into Grids in PARIX}}},
  doi          = {{10.1007/BFb0020464}},
  volume       = {{966}},
  year         = {{1995}},
}

@techreport{2450,
  author       = {{Gehring, Jörn and Simon, Jens}},
  publisher    = {{Paderborn Center for Parallel Computing}},
  title        = {{{SparcStation SCI-Interface}}},
  year         = {{1995}},
}

@inbook{2451,
  author       = {{Blazy, Stephan and Dralle, Uwe and Simon, Jens}},
  booktitle    = {{PowerXplorer User Report - Applications and Projects on the Parsytec PowerXplorer Parallel Computer}},
  publisher    = {{Heinrich-Heine-Universität}},
  title        = {{{Parallel CG Poisson Solver for PowerPC 601}}},
  year         = {{1995}},
}

@article{2573,
  author       = {{Betz, Stefan}},
  journal      = {{Kostenrechnungspraxis}},
  pages        = {{pp. 135 -- 144}},
  title        = {{{Gemeinkostencontrolling auf Basis der Prozesskostenrechnung}}},
  volume       = {{39}},
  year         = {{1995}},
}

@article{2576,
  author       = {{Betz, Stefan}},
  journal      = {{Betriebswirtschaftliche Forschung und Praxis}},
  pages        = {{pp. 609--625}},
  title        = {{{Die Erfahrungskurve als Instrument der Zielkostenspaltung}}},
  volume       = {{47}},
  year         = {{1995}},
}

@article{2577,
  author       = {{Betz, Stefan}},
  journal      = {{Zeitschrift für Planung}},
  pages        = {{pp. 321 -- 339}},
  title        = {{{Kostenorientierte Planung der Entsorgungslogistik}}},
  volume       = {{6}},
  year         = {{1995}},
}

@book{3386,
  author       = {{Gries, Thomas}},
  isbn         = {{3-16-146193-9}},
  publisher    = {{Mohr (Siebeck)}},
  title        = {{{Wachstum, Humankapital und die Dynamik der komparativen Vorteile}}},
  year         = {{1995}},
}

@inbook{3530,
  author       = {{Gries, Thomas}},
  booktitle    = {{Standort und Region, Neue Ansätze zur Regionalökonomik}},
  editor       = {{Gahlen, Bernhard and Hesse, Helmut}},
  isbn         = {{9783161464720}},
  publisher    = {{Mohr (Siebeck)}},
  title        = {{{Neue regionale Wachstumstheorie und Humankapital als regionaler charakteristischer Faktor}}},
  year         = {{1995}},
}

@article{3037,
  abstract     = {{For two given simple polygonsP, Q, the problem is to determine a rigid motionI ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff distance betweenP andI(Q). Faster algorithms as the one for the general problem are obtained for special cases, namely thatI is restricted to translations or even to translations only in one specified direction. It turns out that determining pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant factor, can be done much more efficiently than determining optimal solutions. In the most general case, the algorithm for the pseudo-optimal solution is based on the surprising fact that for the optimal possible match betweenP and an imageI(Q) ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q) is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also shown that the Hausdorff distance between two polygons can be determined in timeO(n logn), wheren is the total number of vertices.}},
  author       = {{Alt, Helmut and Behrends, Bernd and Blömer, Johannes}},
  issn         = {{1573-7470}},
  journal      = {{Annals of Mathematics and Artificial Intelligence}},
  number       = {{3}},
  title        = {{{Approximate matching of polygonal shapes}}},
  volume       = {{13}},
  year         = {{1995}},
}

@techreport{3038,
  author       = {{Blömer, Johannes and Kalfane, Malik and Karp, Richard and Karpinski, Marek and Luby, Michael and Zuckerman, David}},
  title        = {{{An XOR-based erasure-resilient coding scheme}}},
  year         = {{1995}},
}