SearchBrowse

close this section of the libraryftp://ftp.uni-paderborn.de (241)
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9122.ps.Z, 19920612
Using Dynamic Programming to Benchmark Communications on Parallel Computers Gregory V. Wilson and Felicity A. W. George Edinburgh Parallel Computing Centre James Clerk Maxwell Building University of Edinburgh Mayfield Road Edinburgh EH9 3JZ gvw@epcc.ed.ac.uk 17th October 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9105.ps.Z, 19920612
SERC Grant GR/E 21810 Edinburgh Concurrent Supercomputer Final Report Summary The goal of this project was to commission and exploit a major facility for high performance parallel computing in collaboration with Meiko Limited. The SERC Grant of $400k for three years from October 1987 was primarily for
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9121.ps.Z, 19920612
EPCC Technical Report EPCC-TR-91-21 Genetic Set Recombination and its Application to Neural Network Topology Optimisation Nicholas J. Radcliffe njr@epcc.ed.ac.uk Edinburgh Parallel Computing Centre, University of Edinburgh, King's Buildings, EH9 3JZ, Scotland
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9125.ps.Z, 19920612
Implementing Distributed Queues on Multicomputers Without Polling or Contention Gregory V. Wilson November 8, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9108.ps.Z, 19920612
PARTICS : A PARallel Taskfarm for Integrated Circuit Simulators G.J. Gaston, W.J.C. Alexander, L.J. Clarke y and A.J. Walton. Edinburgh Microfabrication Facility, Department of Electrical Engineering, University of Edinburgh, The King's Buildings, Edinburgh, UK, EH9 3JL. y Edinburgh Parallel Computing
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9113.ps.Z, 19920612
Linda-Like Systems and Their Implementation Edinburgh Parallel Computing Centre Technical Report 91-13 edited by Greg Wilson June 24, 1991 Contents 1 Orca: a Language Based on Shared Data-objects 5 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 1.2 The shared
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9127.ps.Z, 19920612
Using Opportunistic Combining Networks to Reduce Contention in Multicomputers Gregory V. Wilson Edinburgh Parallel Computing Centre James Clerk Maxwell Building University of Edinburgh Mayfield Road Edinburgh EH9 3JZ G.V.Wilson@uk.ac.ed November 3, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9117.ps.Z, 19920612
Optimal Simulation of PRAMs Timothy J. Harris Edinburgh Parallel Computing Centre University of Edinburgh Edinburgh Scotland EH9 3JZ February 26, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/92/tr9202.ps.Z, 19920612
Massively Parallel Computing: Status and Prospects D. J. Wallace1
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9102.ps.Z, 19920612
EPCC-TR-91-02 Proc. of the Fourth Inter'l Conf. on Genetic Algorithms Forma Analysis and Random Respectful Recombination Nicholas J. Radcliffe njr@castle.ed.ac.uk Edinburgh Parallel Computing Centre, King's Buildings, University of Edinburgh, EH9 3JZ, Scotland
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9123.ps.Z, 19920612
A Taxonomy of Conceptual Architectures Gregory V. Wilson Edinburgh Parallel Computing Centre James Clerk Maxwell Building University of Edinburgh Mayfield Road Edinburgh EH9 3JZ Scotland G.V.Wilson@uk.ac.ed October 18, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9111.ps.Z, 19920612
On the Performance Prediction of PRAM Simulating Models G. Chochia Edinburgh Parallel Computing Centre The University of Edinburgh James Clerk Maxwell Building, Kings Buildings, Edinburgh, EH9 3JZ.
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9128.ps.Z, 19920612
Utilising Symmetry to Simplify Computer Model Performance Evaluation G. Chochia Edinburgh Parallel Computing Centre The University of Edinburgh James Clerk Maxwell Building, Kings Buildings, Edinburgh, EH9 3JZ. November 24, 1991 1
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9126.ps.Z, 19920612
To the Age of Seven: A Personal Chronicle of Edinburgh Parallel Computing Centre's Summer Scholarship Programme Gregory V. Wilson Edinburgh Parallel Computing Centre University of Edinburgh Mayfield Road Edinburgh EH9 3JZ Scotland G.V.Wilson@uk.ac.ed November 10, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9106.ps.Z, 19920612
Using Massively{Parallel Supercomputers to Model Stochastic Spatial Predator{Prey Systems EPCC-TR91-06 To be published by the International Journal of Ecological Modelling Mark Smith Edinburgh Parallel Computing Centre University of Edinburgh James Clerk Maxwell Building King's Buildings Mayfield Road
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9118.ps.Z, 19920612
The Parameterized PRAM (Preliminary Version) Timothy J. Harris Edinburgh Parallel Computing Centre University of Edinburgh Edinburgh, Scotland, EH9 3JZ. Murray I. Cole Dept. of Computer Science University of Edinburgh Edinburgh, Scotland, EH9 3JZ.
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9114.ps.Z, 19920612
Models of Machines and Modules for Mapping to Minimise Makespan in Multicomputers Michael G. Norman Edinburgh Parallel Computing Centre University of Edinburgh Edinburgh, Scotland EH9 3JZ Peter Thanisch Department of Computer Science University of Edinburgh Edinburgh, Scotland EH9 3JZ
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/92/tr9201.ps.Z, 19920612
Design Principles for Message-Passing Systems Gregory V. Wilson Edinburgh Parallel Computing Centre James Clerk Maxwell Building University of Edinburgh Mayfield Road Edinburgh EH9 3JZ United Kingdom gvw@uk.ac.ed.epcc January 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9110.ps.Z, 19920612
Prediction of Lithofacies Types and Qualities Using a Distributed Neural Network EPCC-TR91-10 (Published in the proceedings of IEEE Workshop: Neural Networks for Signal Processing 1991, pp 483-493) Mark Smith Edinburgh Parallel Computing Centre University of Edinburgh Edinburgh, EH9 3JZ Email:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9116.ps.Z, 19920612
Via: A Structured Message-Passing System for Parallel Computers Greg Wilson Edinburgh Parallel Computing Centre University of Edinburgh
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/epcc/91/tr9124.ps.Z, 19920612
A Statistical Approach to Predicting the Performance of Concurrent Programs Rosemary Candlin Department of Computer Science Joe Phillips Department of Computer Science Peter Fisk Department of Statistics Neil Skilling Department of Chemical Engineering University of Edinburgh The King's Buldings
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-130.ps.Z, 19930921
Dissemination of Information in Vertex-Disjoint Paths Mode, Part 2: Gossiping in d-Dimensional Grids and Planar Graphs y Juraj Hromkovi<=cz, Ralf Klasing, Elena A. St ohr, Hubert Wagenerx Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-116.ps.Z, 19930921
The Shuffle Exchange Network has a Hamiltonian Path Rainer Feldmann Peter Mysliwietz Department of Mathematics and Computer Science University of Paderborn, Germany Preliminary Version November, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-117.ps.Z, 19930921
Problem Independent Distributed Simulated Annealing and its Applications R. Diekmann, R. L uling, J. Simon y Department of Mathematics and Computer Science University of Paderborn, Germany diek@uni-paderborn.de, rl@uni-paderborn.de, jens@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-113.ps.Z, 19930921
Broadcasting in Butterfly and DeBruijn Networks Ralf Klasingy, Burkhard Monieny, Regine Peine, Elena A. St ohr Universit at-GH Paderborn, FB 17, Warburger Str. 100, W-4790 Paderborn, Germany e-mail : klasing@uni-paderborn.de, bm@uni-paderborn.de, regine@uni-paderborn.de, stoehr@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-115.ps.Z, 19930921
OPTIMAL ALGORITHMS FOR DISSEMINATION OF INFORMATION IN GENERALIZED COMMUNICATION MODES y R.Feldmann J. Hromkovic S. Madhavapeddy B.Monien P.Mysliwietz Department of Mathematics and Computer Science University of Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-93-003.ps.Z, 19930921
Strongly Adaptive Token Distribution Friedhelm Meyer auf der Heide , Brigitte Oesterdiekhoff , Rolf Wanka Fachbereich Mathematik-Informatik and Heinz-Nixdorf-Institut Universit at-GH Paderborn D-W-4790 Paderborn, Germany email: ffmadh,brigitte,wankag@uni-paderborn.de Abstract. The token distribution
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-127.ps.Z, 19930921
Capabilities and Complexity of Computations with Integer Division (extended abstract) Katharina L urwer-Br uggemeier and Friedhelm Meyer auf der Heide Department for Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, 4790 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-131.ps.Z, 19930921
ON THE POWER OF COMMUNICATION STRUCTURE FOR DISTRIBUTIVE GENERATION OF LANGUAGES. DANA PARDUBSK A1 Department of Artificial Intelligence, Faculty of Mathematics and Physics Comenius University, 842 15 Bratislava, Slovakia
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-133.ps.Z, 19930921
Communication complexity hierarchies for distributive generation of languages Dana Pardubsk a yz Faculty of Mathematics and Physics Comenius University 842 15 Bratislava Slovakia September 21, 1993
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-130.ps.Z, 19930921
Dissemination of Information in Vertex-Disjoint Paths Mode, Part 2: Gossiping in d-Dimensional Grids and Planar Graphs y Juraj Hromkovi<=cz, Ralf Klasing, Elena A. St ohr, Hubert Wagenerx Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-112.ps.Z, 19930921
Compressing Cube-Connected Cycles and Butterfly Networks y Ralf Klasing, Reinhard L uling, Burkhard Monien Universit at-GH Paderborn, FB 17, Warburger Str. 100, W-4790 Paderborn, Germany e-mail : klasing@uni-paderborn.de, rl@uni-paderborn.de, bm@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-131.ps.Z, 19930921
ON THE POWER OF COMMUNICATION STRUCTURE FOR DISTRIBUTIVE GENERATION OF LANGUAGES. DANA PARDUBSK A1 Department of Artificial Intelligence, Faculty of Mathematics and Physics Comenius University, 842 15 Bratislava, Slovakia
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-115.ps.Z, 19930921
OPTIMAL ALGORITHMS FOR DISSEMINATION OF INFORMATION IN GENERALIZED COMMUNICATION MODES y R.Feldmann J. Hromkovic S. Madhavapeddy B.Monien P.Mysliwietz Department of Mathematics and Computer Science University of Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-93-003.ps.Z, 19930921
Strongly Adaptive Token Distribution Friedhelm Meyer auf der Heide , Brigitte Oesterdiekhoff , Rolf Wanka Fachbereich Mathematik-Informatik and Heinz-Nixdorf-Institut Universitat-GH Paderborn D-W-4790 Paderborn, Germany email: ffmadh,brigitte,wankag@uni-paderborn.de Abstract. The token distribution
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-133.ps.Z, 19930921
Communication complexity hierarchies for distributive generation of languages Dana Pardubsk a yz Faculty of Mathematics and Physics Comenius University 842 15 Bratislava Slovakia September 21, 1993
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-113.ps.Z, 19930921
Broadcasting in Butterfly and DeBruijn Networks Ralf Klasingy, Burkhard Monieny, Regine Peine, Elena A. St ohr Universit at-GH Paderborn, FB 17, Warburger Str. 100, W-4790 Paderborn, Germany e-mail : klasing@uni-paderborn.de, bm@uni-paderborn.de, regine@uni-paderborn.de, stoehr@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-129.ps.Z, 19930921
Dissemination of Information in Vertex-Disjoint Paths Mode, Part 1: General Bounds and Gossiping in Hypercube-Like Networks y Juraj Hromkovi<=cz, Ralf Klasing, Elena A. St ohr Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-127.ps.Z, 19930921
Capabilities and Complexity of Computations with Integer Division (extended abstract) Katharina L urwer-Br uggemeier and Friedhelm Meyer auf der Heide Department for Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, 4790 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-112.ps.Z, 19930921
Compressing Cube-Connected Cycles and Butterfly Networks y Ralf Klasing, Reinhard L uling, Burkhard Monien Universit at-GH Paderborn, FB 17, Warburger Str. 100, W-4790 Paderborn, Germany e-mail : klasing@uni-paderborn.de, rl@uni-paderborn.de, bm@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-93-006.ps.Z, 19930921
Hashing strategies for simulating shared memory on distributed memory machines Friedhelm Meyer auf der Heide Heinz Nixdorf Institute and Computer Science Department University of Paderborn 4790 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-116.ps.Z, 19930921
The Shuffle Exchange Network has a Hamiltonian Path Rainer Feldmann Peter Mysliwietz Department of Mathematics and Computer Science University of Paderborn, Germany Preliminary Version November, 1991
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-93-006.ps.Z, 19930921
Hashing strategies for simulating shared memory on distributed memory machines Friedhelm Meyer auf der Heide Heinz Nixdorf Institute and Computer Science Department University of Paderborn 4790 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-117.ps.Z, 19930921
Problem Independent Distributed Simulated Annealing and its Applications R. Diekmann, R. L uling, J. Simon y Department of Mathematics and Computer Science University of Paderborn, Germany diek@uni-paderborn.de, rl@uni-paderborn.de, jens@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-129.ps.Z, 19930921
Dissemination of Information in Vertex-Disjoint Paths Mode, Part 1: General Bounds and Gossiping in Hypercube-Like Networks y Juraj Hromkovi<=cz, Ralf Klasing, Elena A. St ohr Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-119.ps.Z, 19930922
Karel the Robot An Exercise in Implementing Language Processors with Eli Peter Pfahler Universit at-GH Paderborn Warburger Str. 100, D-33098 Paderborn email: peter@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-119.ps.Z, 19930922
Karel the Robot An Exercise in Implementing Language Processors with Eli Peter Pfahler Universit at-GH Paderborn Warburger Str. 100, D-33098 Paderborn email: peter@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-118.ps.Z, 19930924
On The Optimality Of Kung's Convolution Algorithm In Some Classes Of Systolic Algorithms Juraj Hromkovi<=c+, Juraj Proch azka Department of Mathematics and Informatics University of Paderborn 4790 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-118.ps.Z, 19930924
On The Optimality Of Kung's Convolution Algorithm In Some Classes Of Systolic Algorithms Juraj Hromkovi<=c+, Juraj Proch azka Department of Mathematics and Informatics University of Paderborn 4790 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-122.ps.Z, 19931004
An optimized reconfigurable architecture for Transputer networks R. Funke, R. L uling, B. Monien Department of Mathematics and Computer Science University of Paderborn, Germany e-mail : rainer@uni-paderborn.de, rl@uni-paderborn.de, bm@uni-paderborn.de F. L ucking, H. Blanke-Bohne Parsytec GmbH, Aachen,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-124.ps.Z, 19931004
Parallel Architectures: Design and Efficient Use B. Monien, R. Feldmann, R. Klasing, R. L uling Department of Computer Science, University of Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-114.ps.Z, 19931004
International Parallel Processing Symposium (IPPS-92) Load Balancing for Distributed Branch & Bound Algorithms y R. L uling, B. Monien Department of Mathematics and Computer Science University of Paderborn, Germany e-mail : rl@uni-paderborn.de, bm@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-124.ps.Z, 19931004
Parallel Architectures: Design and Efficient Use B. Monien, R. Feldmann, R. Klasing, R. L uling Department of Computer Science, University of Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-93-004.ps.Z, 19931004
A Realizable Efficient Parallel Architecture Burkhard Monien1 , Reinhard L uling1 , Falk Langhammer2 1 Department of Computer Science, University of Paderborn, Germany e-mail : bm@uni-paderborn.de, rl@uni-paderborn.de 2 Parsytec Computer, Aachen, Germany, e-mail : falk@parsytec.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-122.ps.Z, 19931004
An optimized reconfigurable architecture for Transputer networks R. Funke, R. L uling, B. Monien Department of Mathematics and Computer Science University of Paderborn, Germany e-mail : rainer@uni-paderborn.de, rl@uni-paderborn.de, bm@uni-paderborn.de F. L ucking, H. Blanke-Bohne Parsytec GmbH, Aachen,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-123.ps.Z, 19931004
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems B. Kr ogery, R. L uling, B. Monien, O. Vornbergery Department of Mathematics and Computer Science University of Paderborn, West Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-114.ps.Z, 19931004
International Parallel Processing Symposium (IPPS-92) Load Balancing for Distributed Branch & Bound Algorithms y R. L uling, B. Monien Department of Mathematics and Computer Science University of Paderborn, Germany e-mail : rl@uni-paderborn.de, bm@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-93-007.ps.Z, 19931004
Periodic constant depth sorting networks Marcin Kik, y Miros law Kuty lowski, z Grzegorz Stachowiak, x
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-123.ps.Z, 19931004
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems B. Kr ogery, R. L uling, B. Monien, O. Vornbergery Department of Mathematics and Computer Science University of Paderborn, West Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-93-004.ps.Z, 19931004
A Realizable Efficient Parallel Architecture Burkhard Monien1 , Reinhard Luling1 , Falk Langhammer2 1 Department of Computer Science, University of Paderborn, Germany e-mail : bm@uni-paderborn.de, rl@uni-paderborn.de 2 Parsytec Computer, Aachen, Germany, e-mail : falk@parsytec.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-93-007.ps.Z, 19931004
Periodic constant depth sorting networks Marcin Kik, y Miros law Kuty lowski, z Grzegorz Stachowiak, x
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-134.ps.Z, 19931005
Efficient PRAM Simulation on a Distributed Memory Machine Richard M. Karp University of California at Berkeley and International Computer Science Institute, Berkeley, CA Michael Lubyy International Computer Science Institute, Berkeley, CA and UC Berkeley Friedhelm Meyer auf der Heidez Heinz Nixdorf
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-93-005.ps.Z, 19931005
OCCAM-light { A Multiparadigm Programming Language for Transputer Networks (revised version) Alf Wachsmann1, Friedrich Wichmann2 1Universit at-GH Paderborn Heinz Nixdorf Institut und Fachbereich Mathematik-Informatik D-33095 Paderborn email: alf@uni-paderborn.de 2Universit at-GH Paderborn Fachbereich
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-93-005.ps.Z, 19931005
OCCAM-light { A Multiparadigm Programming Language for Transputer Networks (revised version) Alf Wachsmann1, Friedrich Wichmann2 1Universitat-GH Paderborn Heinz Nixdorf Institut und Fachbereich Mathematik-Informatik D-33095 Paderborn email: alf@uni-paderborn.de 2Universitat-GH Paderborn Fachbereich
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-134.ps.Z, 19931005
Efficient PRAM Simulation on a Distributed Memory Machine Richard M. Karp University of California at Berkeley and International Computer Science Institute, Berkeley, CA Michael Lubyy International Computer Science Institute, Berkeley, CA and UC Berkeley Friedhelm Meyer auf der Heidez Heinz Nixdorf
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/misc/phdFeldmann.ps.Z, 19931130
Game Tree Search on Massively Parallel Systems Submitted in partial fulfillment of the requirements for the degree of Doctor rer. nat. in the Department of Mathematics and Computer Science, University of Paderborn by Rainer Feldmann Department of mathematics and computer science University of Paderborn
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/misc/phdFeldmann.ps.Z, 19931130
Game Tree Search on Massively Parallel Systems Submitted in partial fulfillment of the requirements for the degree of Doctor rer. nat. in the Department of Mathematics and Computer Science, University of Paderborn by Rainer Feldmann Department of mathematics and computer science University of Paderborn
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-135.ps.Z, 19931216
1 Search Space and Average Proof Length of Resolution H. Kleine B uning T. Lettmann FB 17 { Mathematik/Informatik Universit at { GH { Paderborn Postfach 16 21 D{4790 Paderborn (Germany) E{mail: kbcsl@uni-paderborn.de lettmann@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-135.ps.Z, 19931216
1 Search Space and Average Proof Length of Resolution H. Kleine B uning T. Lettmann FB 17 { Mathematik/Informatik Universit at { GH { Paderborn Postfach 16 21 D{4790 Paderborn (Germany) E{mail: kbcsl@uni-paderborn.de lettmann@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-93-136.ps.Z, 19931220
THE COMPLEXITY OF SYSTOLIC DISSEMINATION OF INFORMATION IN INTERCONNECTION NETWORKS Juraj Hromkovi<=cy, Ralf Klasing, Walter Unger, Hubert Wagenerz Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany Dana Pardubsk ax Faculty of Mathematics and Physics Comenius
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-93-136.ps.Z, 19931220
THE COMPLEXITY OF SYSTOLIC DISSEMINATION OF INFORMATION IN INTERCONNECTION NETWORKS Juraj Hromkovi<=cy, Ralf Klasing, Walter Unger, Hubert Wagenerz Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany Dana Pardubsk ax Faculty of Mathematics and Physics Comenius
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-138.ps.Z, 19940201
Game Tree Search on a Massively Parallel System R.Feldmann P.Mysliwietz B.Monien Department of Mathematics and Computer Science University of Paderborn West Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-138.ps.Z, 19940201
Game Tree Search on a Massively Parallel System R.Feldmann P.Mysliwietz B.Monien Department of Mathematics and Computer Science University of Paderborn West Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-139.ps.Z, 19940201
Experiments With a Fully Distributed Chess Program R.Feldmann P.Mysliwietz B.Monien Department of Mathematics and Computer Science University of Paderborn Germany Extended Abstract
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-139.ps.Z, 19940201
Experiments With a Fully Distributed Chess Program R.Feldmann P.Mysliwietz B.Monien Department of Mathematics and Computer Science University of Paderborn Germany Extended Abstract
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-141.ps.Z, 19940202
The 1st International Paderborn Computer{Othello Tournament Michael Buro FB 17 { Mathematik/Informatik Universit at Paderborn Bericht Nr. 141 Reihe Informatik Februar 1994 The 1st International Paderborn Computer{Othello Tournament Michael Buro FB 17 { Mathematik/Informatik Universit at Paderborn
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-141.ps.Z, 19940202
The 1st International Paderborn Computer{Othello Tournament Michael Buro FB 17 { Mathematik/Informatik Universit at Paderborn Bericht Nr. 141 Reihe Informatik Februar 1994 The 1st International Paderborn Computer{Othello Tournament Michael Buro FB 17 { Mathematik/Informatik Universit at Paderborn
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-140.ps.Z, 19940202
Selection of Test Points during High-Level Synthesis Christof Nagel University Paderborn Warburgerstrasse 100 33098 Paderborn Federal Republic of Germany email: nagel@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-140.ps.Z, 19940202
Selection of Test Points during High-Level Synthesis Christof Nagel University Paderborn Warburgerstrasse 100 33098 Paderborn Federal Republic of Germany email: nagel@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-142.ps.Z, 19940304
ILFA A Project in Experimental Logic Computation Ulf Dunker, Andreas Fl ogel, Hans Kleine B uning, J urgen Lehmann, Theodor Lettmann B Universit at{GH Paderborn Fachbereich Mathematik/Informatik Postfach 1621 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-142.ps.Z, 19940304
ILFA A Project in Experimental Logic Computation Ulf Dunker, Andreas Fl ogel, Hans Kleine B uning, J urgen Lehmann, Theodor Lettmann B Universit at{GH Paderborn Fachbereich Mathematik/Informatik Postfach 1621 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-143.ps.Z, 19940323
Construction of Application Generators Using Eli Uwe Kastens, University of Paderborn, FRG
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-143.ps.Z, 19940323
Construction of Application Generators Using Eli Uwe Kastens, University of Paderborn, FRG
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-137.ps.Z, 19940506
Two lower bounds on distributive generation of languages Juraj Hromkovi<=c+ Dept. of Mathematics & Informatics, University of Paderborn 33098 Paderborn, Germany Jarkko Kari, Lila Kari Dept. of Mathematics, University of Turku and Academy of Finland 20500 Turku, Finland Dana Pardubsk a+; Faculty of
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-144.ps.Z, 19940506
Weak space complexity classes are not closed under complement Andrzej Szepietowski Universitaet GH Paderborn, FB17 Math-Informatik, 33095 Paderborn, Germany. E-mail: szepiet@uni-Paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-137.ps.Z, 19940506
Two lower bounds on distributive generation of languages Juraj Hromkovi<=c+ Dept. of Mathematics & Informatics, University of Paderborn 33098 Paderborn, Germany Jarkko Kari, Lila Kari Dept. of Mathematics, University of Turku and Academy of Finland 20500 Turku, Finland Dana Pardubsk a+; Faculty of
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-144.ps.Z, 19940506
Weak space complexity classes are not closed under complement Andrzej Szepietowski Universitaet GH Paderborn, FB17 Math-Informatik, 33095 Paderborn, Germany. E-mail: szepiet@uni-Paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-147.ps.Z, 19940613
Sammlung der Zusammenfassungen der Vortr age auf dem 23. Workshop uber Komplexit atstheorie, Datenstrukturen und effiziente Algorithmen am 31. Mai 1994 in Paderborn Organisation: Rolf Wanka 23. Workshop uber Komplexit atstheorie, Datenstrukturen und effiziente Algorithmen Paderborn, 31. Mai 1994
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-94-008.ps.Z, 19940613
Technical Report No. tr-rf-008-94, Dept. of Comp. Science, University of Paderborn, Germany, June 1994 Using Helpful Sets to Improve Graph Bisections Ralf Diekmann , Burkhard Monien and Robert Preis Department of Mathematics and Computer Science University of Paderborn, Germany fdiek, bm,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-94-008.ps.Z, 19940613
Technical Report No. tr-rf-008-94, Dept. of Comp. Science, University of Paderborn, Germany, June 1994 Using Helpful Sets to Improve Graph Bisections Ralf Diekmann , Burkhard Monien and Robert Preis Department of Mathematics and Computer Science University of Paderborn, Germany fdiek, bm,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-147.ps.Z, 19940613
Sammlung der Zusammenfassungen der Vortr age auf dem 23. Workshop uber Komplexit atstheorie, Datenstrukturen und effiziente Algorithmen am 31. Mai 1994 in Paderborn Organisation: Rolf Wanka 23. Workshop uber Komplexit atstheorie, Datenstrukturen und effiziente Algorithmen Paderborn, 31. Mai 1994
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-148.ps.Z, 19940630
Virtual Topology Library for PARIX 1 Markus R ottgerx, Ulf-Peter Schroederx, Jens Simony yPaderborn Center for Parallel Computing (PC2) xDepartment of Mathematics and Computer Science, University of Paderborn D-33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-148.ps.Z, 19940630
Virtual Topology Library for PARIX 1 Markus R ottgerx, Ulf-Peter Schroederx, Jens Simony yPaderborn Center for Parallel Computing (PC2) xDepartment of Mathematics and Computer Science, University of Paderborn D-33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-149.ps.Z, 19940701
Embedding 3-dimensional Grids into Optimal Hypercubes Markus R ottger, Ulf-Peter Schroeder, Walter Unger Department of Mathematics and Computer Science University of Paderborn D-33095 Paderborn, Germany e-mail: roettger@uni-paderborn.de, ups@uni-paderborn.de, quacks@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-149.ps.Z, 19940701
Embedding 3-dimensional Grids into Optimal Hypercubes Markus R ottger, Ulf-Peter Schroeder, Walter Unger Department of Mathematics and Computer Science University of Paderborn D-33095 Paderborn, Germany e-mail: roettger@uni-paderborn.de, ups@uni-paderborn.de, quacks@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-150.ps.Z, 19940815
Sequential and Parallel Approximation of Shortest Superstrings Artur Czumajy Heinz Nixdorf Institut, Universit at-GH-Paderborn, Warburger Str. 100, 33098 Paderborn, Germany, email : artur@hni.uni-paderborn.de. Leszek G asieniecz Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-150.ps.Z, 19940815
Sequential and Parallel Approximation of Shortest Superstrings Artur Czumajy Heinz Nixdorf Institut, Universit at-GH-Paderborn, Warburger Str. 100, 33098 Paderborn, Germany, email : artur@hni.uni-paderborn.de. Leszek G asieniecz Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-151.ps.Z, 19940823
Generating Interpreters from Compiler Specifications Uwe Kastens, University of Paderborn, FRG
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-151.ps.Z, 19940823
Generating Interpreters from Compiler Specifications Uwe Kastens, University of Paderborn, FRG
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-152.ps.Z, 19940921
Variational Principle in Discrete Extremal Problems Sergej Bezrukov Department of Math. and Comp. Sci. University of Paderborn D-33098 Paderborn, Germany sb@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-152.ps.Z, 19940921
Variational Principle in Discrete Extremal Problems Sergej Bezrukov Department of Math. and Comp. Sci. University of Paderborn D-33098 Paderborn, Germany sb@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-153.ps.Z, 19941004
Embedding Complete Trees into the Hypercube by Sergej Bezrukov Fachbereich Mathematik/Informatik Universit at Paderborn D{33198 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-153.ps.Z, 19941004
Embedding Complete Trees into the Hypercube by Sergej Bezrukov Fachbereich Mathematik/Informatik Universit at Paderborn D{33198 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-154.ps.Z, 19941004
Trial and Error: A New Approach to Space-Bounded Learning Foued Ameur Paul Fischery Klaus-U. H offgenz Friedhelm Meyer auf der Heidex
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-154.ps.Z, 19941004
Trial and Error: A New Approach to Space-Bounded Learning Foued Ameur Paul Fischery Klaus-U. H offgenz Friedhelm Meyer auf der Heidex
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-156.ps.Z, 19950206
Element distinctness problem on one-tape Turing machine Andrzej Szepietowski Universitaet GH Paderborn, FB17 Math-Informatik, 33095 Paderborn, Germany. E-mail: szepiet@uni-Paderborn.de November 21, 1994
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-156.ps.Z, 19950206
Element distinctness problem on one-tape Turing machine Andrzej Szepietowski Universitaet GH Paderborn, FB17 Math-Informatik, 33095 Paderborn, Germany. E-mail: szepiet@uni-Paderborn.de November 21, 1994
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-160.ps.Z, 19950622
Approximate compaction and padded-sorting on CREW PRAMs1 Miros law Kuty lowski Heinz Nixdorf Institute and Dept. of Math. & Computer Sci. Universit at-GH Paderborn, D-33095 Paderborn, Germany email: mirekk@uni-paderborn.de fax: +49 5251 603514 Tomasz Wierzbicki Instytut Informatyki, Uniwersytet Wroc
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-158.ps.Z, 19950622
9 January 1995 10:27 - 1 - Merlin: Supporting Cooperation in Software Development through a Knowledge-based Environment1 G. Junkermann*, B. Peuschel#, W. Sch fer , S. Wolf 1 Introduction Merlin2 is a prototype Process-centred Software Development Environment (PSDE), developed within the context of the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rf-95-009.ps.Z, 19950622
Constructing sorting networks with constant period y Krzysztof Lory sz Miros law Kuty lowski zx Brigitte Oesterdiekhoff{ Rolf Wanka{ Institute of Computer Science Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Wroc law University of Paderborn PL-51-151 Wroc law, Poland
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-157.ps.Z, 19950622
1. Introduction 1 Cooperation Patterns for process-centred Software Development Environments Wilhelm Sch fer*, Stefan Wolf# 1. Introduction Large-scale software projects require cooperation among multiple teams of developers, which involves access to shared information. This information includes all
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-158.ps.Z, 19950622
9 January 1995 10:27 - 1 - Merlin: Supporting Cooperation in Software Development through a Knowledge-based Environment1 G. Junkermann*, B. Peuschel#, W. Sch fer , S. Wolf 1 Introduction Merlin2 is a prototype Process-centred Software Development Environment (PSDE), developed within the context of the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rf-95-009.ps.Z, 19950622
Constructing sorting networks with constant period y Krzysztof Lory sz Miros law Kuty lowski zx Brigitte Oesterdiekhoff{ Rolf Wanka{ Institute of Computer Science Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Wroc law University of Paderborn PL-51-151 Wroc law, Poland
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-160.ps.Z, 19950622
Approximate compaction and padded-sorting on CREW PRAMs1 Miros law Kuty lowski Heinz Nixdorf Institute and Dept. of Math. & Computer Sci. Universit at-GH Paderborn, D-33095 Paderborn, Germany email: mirekk@uni-paderborn.de fax: +49 5251 603514 Tomasz Wierzbicki Instytut Informatyki, Uniwersytet Wroc
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-157.ps.Z, 19950622
1. Introduction 1 Cooperation Patterns for process-centred Software Development Environments Wilhelm Sch fer*, Stefan Wolf# 1. Introduction Large-scale software projects require cooperation among multiple teams of developers, which involves access to shared information. This information includes all
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-161.ps.Z, 19950626
Automata searching labyrinths, a survey Andrzej Szepietowski Universitaet GH Paderborn, FB17 Math-Informatik, 33095 Paderborn, Germany. E-mail: szepiet@uni-Paderborn.de June 12, 1995 A labyrinth L is a path-connected subset of the integer grid Z2. The set Z2 L is called the set of obstacles of the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-161.ps.Z, 19950626
Automata searching labyrinths, a survey Andrzej Szepietowski Universitaet GH Paderborn, FB17 Math-Informatik, 33095 Paderborn, Germany. E-mail: szepiet@uni-Paderborn.de June 12, 1995 A labyrinth L is a path-connected subset of the integer grid Z2. The set Z2 L is called the set of obstacles of the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-162.ps.Z, 19950629
Shallow Switching Networks for Special Families of Shifts Przemys lawa Kanarek and Krzysztof Lory s Institute of Computer Science, University of Wroc law, Przesmyckiego 20, PL-51-151 Wroc law email: pka, lorys@ii.uni.wroc.pl June 27, 1995
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-162.ps.Z, 19950629
Shallow Switching Networks for Special Families of Shifts Przemys lawa Kanarek and Krzysztof Lory s Institute of Computer Science, University of Wroc law, Przesmyckiego 20, PL-51-151 Wroc law email: pka, lorys@ii.uni.wroc.pl June 27, 1995
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-163.ps.Z, 19950704
Information Management in Process-Centered Software Engineering Environments Naser S. Barghouti,y Wolfgang Emmerich,x Wilhelm Sch aferz and Andrea Skarray yAT&T Bell Laboratories, USA xUniversity of Dortmund, Germany zUniversit at Paderborn,Germany accepted for: Trends in Software, Special Issue on the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-163.ps.Z, 19950704
Information Management in Process-Centered Software Engineering Environments Naser S. Barghouti,y Wolfgang Emmerich,x Wilhelm Sch aferz and Andrea Skarray yAT&T Bell Laboratories, USA xUniversity of Dortmund, Germany zUniversit at Paderborn,Germany accepted for: Trends in Software, Special Issue on the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-164.ps.Z, 19950908
The Relationship Between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width y Ralf Klasing Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany e-mail: klasing@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-159.ps.Z, 19950908
Version Management for tightly integrated Software Engineering Environments Sabine Sachweh and Wilhelm Sch afer Universit at GH Paderborn Fachbereich 17 - Mathematik/Informatik D-33095 Paderborn Germany sachweh@uni-paderborn.de wilhelm@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-165.ps.Z, 19950908
DReaMS { Concepts of a Distributed REAl-Time Management System* C. Ditze University of Paderborn Department of CS 33095 Paderborn Germany E-mail: cadi@uni-paderborn.de August 25, 1995
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-164.ps.Z, 19950908
The Relationship Between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width y Ralf Klasing Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn, Germany e-mail: klasing@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-165.ps.Z, 19950908
DReaMS { Concepts of a Distributed REAl-Time Management System* C. Ditze University of Paderborn Department of CS 33095 Paderborn Germany E-mail: cadi@uni-paderborn.de August 25, 1995
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-159.ps.Z, 19950908
Version Management for tightly integrated Software Engineering Environments Sabine Sachweh and Wilhelm Sch afer Universit at GH Paderborn Fachbereich 17 - Mathematik/Informatik D-33095 Paderborn Germany sachweh@uni-paderborn.de wilhelm@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-92-105.ps.Z, 19951027
Compilation for fine-grained parallelism: A code generator for the Intel i860 Friedrich Wichmann Peter Pfahler Fachbereich Mathematik/Informatik Universit at{GH{Paderborn D { 4790 Paderborn Bericht Nr. 105 Reihe Informatik Oktober 1992 Compilation for fine-grained Parallelism: A code generator for the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-92-105.ps.Z, 19951027
Compilation for fine-grained parallelism: A code generator for the Intel i860 Friedrich Wichmann Peter Pfahler Fachbereich Mathematik/Informatik Universit at{GH{Paderborn D { 4790 Paderborn Bericht Nr. 105 Reihe Informatik Oktober 1992 Compilation for fine-grained Parallelism: A code generator for the
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-168.ps.Z, 19951107
Wormhole versus deflection routing : A case study on the mesh *y Efstratios Karaivazoglou, Paul Spirakis and Vasilis Triantafilou E-mail : karaiv@hni.uni-paderborn.de, E-mail : spirakis@cti.gr, triantaf@cti.gr Heinz Nixdorf Institute Department of Computer Engineering University of Paderborn and
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-167.ps.Z, 19951107
On the minimal period of fast periodic sorting networks Brigitte Oesterdiekhoff Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn D-33095 Paderborn, Germany brigitte@uni-paderborn.de August 15, 1995
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-167.ps.Z, 19951107
On the minimal period of fast periodic sorting networks Brigitte Oesterdiekhoff Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn D-33095 Paderborn, Germany brigitte@uni-paderborn.de August 15, 1995
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-168.ps.Z, 19951107
Wormhole versus deflection routing : A case study on the mesh *y Efstratios Karaivazoglou, Paul Spirakis and Vasilis Triantafilou E-mail : karaiv@hni.uni-paderborn.de, E-mail : spirakis@cti.gr, triantaf@cti.gr Heinz Nixdorf Institute Department of Computer Engineering University of Paderborn and
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-94-155.ps.Z, 19951114
Configuration Based on Simplified Functional Models Hans Kleine B uning Daniel Curatolo Benno Stein B University of Paderborn Department of Mathematics and Computer Science Warburger Strasse 100 33095 Paderborn, Germany Report No. tr-ri-94-155 Series Computer Science November 1994 Configuration Based on
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-94-155.ps.Z, 19951114
Configuration Based on Simplified Functional Models Hans Kleine B uning Daniel Curatolo Benno Stein B University of Paderborn Department of Mathematics and Computer Science Warburger Strasse 100 33095 Paderborn, Germany Report No. tr-ri-94-155 Series Computer Science November 1994 Configuration Based on
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-166.ps.Z, 19951114
Design and Realization of a Knowledge-based System that Supports the Setting into Operation of Hydraulic Systems H. Kleine B uning, Benno Stein tr-ri-95-166 Design and Realization of a Knowledge-based System that Supports the Setting into Operation of Hydraulic Systems Technical Report June, 1995 H.
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-166.ps.Z, 19951114
Design and Realization of a Knowledge-based System that Supports the Setting into Operation of Hydraulic Systems H. Kleine B uning, Benno Stein tr-ri-95-166 Design and Realization of a Knowledge-based System that Supports the Setting into Operation of Hydraulic Systems Technical Report June, 1995 H.
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-95-171.ps.Z, 19951211
A Prolog-based Semantics of a Dedicated Process Design Language Gerald Junkermann Informatik Centrum Dortmund, Abteilung Softwaretechnik, Joseph-von-Fraunhofer-Str. 20, D-44227 Dortmund, Germany November 28, 1995 The work of Gerald Junkermann has been supported by the Provincial Ministry for Research
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-95-171.ps.Z, 19951211
A Prolog-based Semantics of a Dedicated Process Design Language Gerald Junkermann Informatik Centrum Dortmund, Abteilung Softwaretechnik, Joseph-von-Fraunhofer-Str. 20, D-44227 Dortmund, Germany November 28, 1995 The work of Gerald Junkermann has been supported by the Provincial Ministry for Research
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-95-001.ps.Z, 19951219
Embedding of Hypercubes into Grids Sergej Bezrukov, Markus R ottger, Ulf-Peter Schroeder Department of Mathematics and Computer Science University of Paderborn D-33098 Paderborn, Germany e-mail: @uni-paderborn.de phone: +49 +5251 60 6726, fax: +49 +5251 60 6697
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-95-001.ps.Z, 19951219
Embedding of Hypercubes into Grids Sergej Bezrukov, Markus R ottger, Ulf-Peter Schroeder Department of Mathematics and Computer Science University of Paderborn D-33098 Paderborn, Germany e-mail: @uni-paderborn.de phone: +49 +5251 60 6726, fax: +49 +5251 60 6697
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-95-002.ps.Z, 19951219
On k-Partitioning the n-Cube Sergej L. Bezrukov Department of Math. and CS University of Paderborn D-33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-95-002.ps.Z, 19951219
On k-Partitioning the n-Cube Sergej L. Bezrukov Department of Math. and CS University of Paderborn D-33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-006.ps.Z, 19960117
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures y Artur Czumaj (artur@uni-paderborn.de) Friedhelm Meyer auf der Heide (fmadh@uni-paderborn.de) Heinz Nixdorf Institute and Department of Computer Science University of Paderborn D-33102 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-005.ps.Z, 19960117
Contention Resolution in Hashing Based Shared Memory Simulations Artur Czumaj (artur@uni-paderborn.de) and Friedhelm Meyer auf der Heide (fmadh@uni-paderborn.de) Heinz Nixdorf Institute and Department of Computer Science University of Paderborn D-33102 Paderborn, Germany Volker Stemanny
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-004.ps.Z, 19960117
Parallel Decomposition of Unstructured FEM-Meshes Ralf Diekmanny, Derk Meyer, and Burkhard Monieny Department of Mathematics and Computer Science University of Paderborn, Germany z e-mail: fdiek, dm, bmg@uni-paderborn.de x
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-004.ps.Z, 19960117
Parallel Decomposition of Unstructured FEM-Meshes Ralf Diekmanny, Derk Meyer, and Burkhard Monieny Department of Mathematics and Computer Science University of Paderborn, Germany z e-mail: fdiek, dm, bmg@uni-paderborn.de x
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-006.ps.Z, 19960117
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures y Artur Czumaj (artur@uni-paderborn.de) Friedhelm Meyer auf der Heide (fmadh@uni-paderborn.de) Heinz Nixdorf Institute and Department of Computer Science University of Paderborn D-33102 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-005.ps.Z, 19960117
Contention Resolution in Hashing Based Shared Memory Simulations Artur Czumaj (artur@uni-paderborn.de) and Friedhelm Meyer auf der Heide (fmadh@uni-paderborn.de) Heinz Nixdorf Institute and Department of Computer Science University of Paderborn D-33102 Paderborn, Germany Volker Stemanny
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-008.ps.Z, 19960130
Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model* Armin B aumker, Wolfgang Dittrich and Friedhelm Meyer auf der Heide Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-003.ps.Z, 19960130
Specification and Design of the EAM (EAM - Evolving Algebra Abstract Machine) Giuseppe Del Castillo Igor D- urd-anovi c Uwe Gl asser
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-008.ps.Z, 19960130
Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model* Armin B aumker, Wolfgang Dittrich and Friedhelm Meyer auf der Heide Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-003.ps.Z, 19960130
Specification and Design of the EAM (EAM - Evolving Algebra Abstract Machine) Giuseppe Del Castillo Igor D- urd-anovi c Uwe Gl asser
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-172.ps.Z, 19960304
1 VON 15 Objektorientierte Spezifikation und Realisierung einer Umge- bung f r das Konfigurationsmanagement Sabine Sachweh und Wilhelm Sch fer Fachbereich Mathematik-Informatik AG Softwaretechnik Universit t-GH Paderborn Warburger Str. 100 33098 Paderborn {sachweh|wilhelm}@uni-paderborn.de 1 Einleitung
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-173.ps.Z, 19960304
1 A Design Environment for Migrating Relational to Object Oriented Database Systems Jens Jahnke, Wilhelm Sch fer, and Albert Z ndorf AG-Softwaretechnik, Fachbereich 17, GH-Paderborn, Warburger Str. 10, D-33098 Paderborn, Germany; e-mail: @uni-paderborn.de WWW:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-173.ps.Z, 19960304
1 A Design Environment for Migrating Relational to Object Oriented Database Systems Jens Jahnke, Wilhelm Sch fer, and Albert Z ndorf AG-Softwaretechnik, Fachbereich 17, GH-Paderborn, Warburger Str. 10, D-33098 Paderborn, Germany; e-mail: @uni-paderborn.de WWW:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-172.ps.Z, 19960304
1 VON 15 Objektorientierte Spezifikation und Realisierung einer Umge- bung f r das Konfigurationsmanagement Sabine Sachweh und Wilhelm Sch fer Fachbereich Mathematik-Informatik AG Softwaretechnik Universit t-GH Paderborn Warburger Str. 100 33098 Paderborn {sachweh|wilhelm}@uni-paderborn.de 1 Einleitung
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-009.ps.Z, 19960312
Kommunikation in parallelen Rechnernetzen Friedhelm Meyer auf der Heide und Rolf Wanka Fachbereich Mathematik/Informatik und Heinz Nixdorf Institut Universit at-GH Paderborn 33095 Paderborn e-mail: ffmadh,wankag@uni-paderborn.de Zusammenfassung Effiziente Kommunikationsmethoden in Netzwerken sind
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-009.ps.Z, 19960312
Kommunikation in parallelen Rechnernetzen Friedhelm Meyer auf der Heide und Rolf Wanka Fachbereich Mathematik/Informatik und Heinz Nixdorf Institut Universit at-GH Paderborn 33095 Paderborn e-mail: ffmadh,wankag@uni-paderborn.de Zusammenfassung Effiziente Kommunikationsmethoden in Netzwerken sind
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-010.ps.Z, 19960320
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations Friedhelm Meyer auf der Heide and Christian Scheideler Heinz Nixdorf Institute and Computer Science Department, University of Paderborn, 33095 Paderborn, Germany Volker Stemanny International Computer Science Institute,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-010.ps.Z, 19960320
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations Friedhelm Meyer auf der Heide and Christian Scheideler Heinz Nixdorf Institute and Computer Science Department, University of Paderborn, 33095 Paderborn, Germany Volker Stemanny International Computer Science Institute,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-007.ps.Z, 19960417
A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware Matthias Fischer1 Jochen Rethmann2 Alf Wachsmann1 1Universit at-GH Paderborn Heinz Nixdorf Institut und Fachbereich Mathematik-Informatik D-33095 Paderborn email:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-007.ps.Z, 19960417
A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware Matthias Fischer1 Jochen Rethmann2 Alf Wachsmann1 1Universit at-GH Paderborn Heinz Nixdorf Institut und Fachbereich Mathematik-Informatik D-33095 Paderborn email:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-011.ps.Z, 19960509
Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modeling and Experimental Results Alf Wachsmann Rolf Wanka Dept. of Mathematics and Computer Science and Heinz Nixdorf Institute University of Paderborn D-33095 Paderborn, Germany e-mail: falf,wankag@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-011.ps.Z, 19960509
Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modeling and Experimental Results Alf Wachsmann Rolf Wanka Dept. of Mathematics and Computer Science and Heinz Nixdorf Institute University of Paderborn D-33095 Paderborn, Germany e-mail: falf,wankag@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-176.ps.Z, 19960515
FACTORING MODULAR POLYNOMIALS Joachim von zur Gathen and Silke Hartlieb Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany fgathen,hartliebg@uni-paderborn.de May 13, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-176.ps.Z, 19960515
FACTORING MODULAR POLYNOMIALS Joachim von zur Gathen and Silke Hartlieb Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany fgathen,hartliebg@uni-paderborn.de May 13, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-014.ps.Z, 19960605
In: J. van Leeuwen (ed.): Computer Science Today. Springer LNCS 1000, pp. 62-77, 1995. Efficient Use of Parallel & Distributed Systems: From Theory to Practice Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard L uling, Knut Menzel, Thomas R omke, Ulf-Peter Schroeder Department of
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-014.ps.Z, 19960605
In: J. van Leeuwen (ed.): Computer Science Today. Springer LNCS 1000, pp. 62-77, 1995. Efficient Use of Parallel & Distributed Systems: From Theory to Practice Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard L uling, Knut Menzel, Thomas R omke, Ulf-Peter Schroeder Department of
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-013.ps.Z, 19960605
Parallel Algorithms and Applications (PAA), Vol. 8, pp. 61-84, 1996. Combining Helpful Sets and Parallel Simulated Annealing for the Graph-Partitioning Problem Ralf Diekmann,y Reinhard L uling,y Burkhard Monien,y and Carsten Spr aner Department of Mathematics and Computer Science, University of
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-013.ps.Z, 19960605
Parallel Algorithms and Applications (PAA), Vol. 8, pp. 61-84, 1996. Combining Helpful Sets and Parallel Simulated Annealing for the Graph-Partitioning Problem Ralf Diekmann,y Reinhard L uling,y Burkhard Monien,y and Carsten Spr aner Department of Mathematics and Computer Science, University of
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/schaefer/PhDThesisWolf.ps.gz, 19960628
Ein transaktionsbasierter Ansatz zur Unterst tzung kooperativer Softwareentwicklung Dissertation zur Erlangung des Grades des Doktors der Naturwissenschaften der Universit t Dortmund am Fachbereich Informatik von Stefan Wolf Dortmund 1994 Tag der m ndlichen Pr fung: 28.06.1994 Dekan: Prof. Dr. Peter
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/schaefer/PhDThesisJunkermann.ps.gz, 19960628
ESCAPE Eine graphische Sprache zur Spezifikation von Software-Prozessen Dissertation zur Erlangung des Grades des Doktors der Naturwissenschaften der Universit t Dortmund an der Abteilung Informatik Gerald Junkermann Dortmund 1995 II Tag der m ndlichen Pr fung: 20. September 1995 Dekan: Prof. Dr. H. M
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/schaefer/PhDThesisWolfgangEmmerich.ps.gz, 19960628
Tool Construction for Process-Centred Software Development Environments based on Object Databases Schriftliche Arbeit zur Erlangung des Grades ,,Doktor der Naturwissenschaften" im Fachbereich Mathematik/Informatik der Universit at-Gesamthochschule Paderborn vorgelegt von Wolfgang Emmerich aus S
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/schaefer/PhDThesisJunkermann.ps.gz, 19960628
ESCAPE Eine graphische Sprache zur Spezifikation von Software-Prozessen Dissertation zur Erlangung des Grades des Doktors der Naturwissenschaften der Universit t Dortmund an der Abteilung Informatik Gerald Junkermann Dortmund 1995 II Tag der m ndlichen Pr fung: 20. September 1995 Dekan: Prof. Dr. H. M
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/schaefer/PhDThesisWolfgangEmmerich.ps.gz, 19960628
Tool Construction for Process-Centred Software Development Environments based on Object Databases Schriftliche Arbeit zur Erlangung des Grades ,,Doktor der Naturwissenschaften" im Fachbereich Mathematik/Informatik der Universit at-Gesamthochschule Paderborn vorgelegt von Wolfgang Emmerich aus S
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/schaefer/PhDThesisWolf.ps.gz, 19960628
Ein transaktionsbasierter Ansatz zur Unterst tzung kooperativer Softwareentwicklung Dissertation zur Erlangung des Grades des Doktors der Naturwissenschaften der Universit t Dortmund am Fachbereich Informatik von Stefan Wolf Dortmund 1994 Tag der m ndlichen Pr fung: 28.06.1994 Dekan: Prof. Dr. Peter
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-178.ps.Z, 19960709
ORDERS OF GAUSS PERIODS IN FINITE FIELDS Joachim von zur Gathen and Igor Shparlinski June 17, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-178.ps.Z, 19960709
ORDERS OF GAUSS PERIODS IN FINITE FIELDS Joachim von zur Gathen and Igor Shparlinski June 17, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-019.ps.Z, 19960711
Universal Store-and-Forward Routing Friedhelm Meyer auf der Heide and Berthold V ockingy Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-019.ps.Z, 19960711
Universal Store-and-Forward Routing Friedhelm Meyer auf der Heide and Berthold V ockingy Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn 33095 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-180.ps.Z, 19960726
FACTORIZATION OF POLYNOMIALS MODULO SMALL PRIME POWERS Joachim von zur Gathen and Silke Hartlieb Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany fgathen,hartliebg@uni-paderborn.de July 16, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-180.ps.Z, 19960726
FACTORIZATION OF POLYNOMIALS MODULO SMALL PRIME POWERS Joachim von zur Gathen and Silke Hartlieb Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany fgathen,hartliebg@uni-paderborn.de July 16, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-177.ps.Z, 19960909
NORMAL BASES VIA GENERAL GAUSS PERIODS Joachim von zur Gathen & Sandra Schlink Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany fgathen,schlinkig@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-177.ps.Z, 19960909
NORMAL BASES VIA GENERAL GAUSS PERIODS Joachim von zur Gathen & Sandra Schlink Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany fgathen,schlinkig@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-024.ps.Z, 19961002
The PARTY Partitioning - Library User Guide { Version 1.1 Robert Preis HEINZ NIXDORF INSTITUT Universit at Paderborn, Germany preis@hni.uni-paderborn.de and Ralf Diekmann y Department of Mathematics and Computer Science Universit at Paderborn, Germany diek@uni-paderborn.de September 16, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-022.ps.Z, 19961002
An Algorithm for Resource{based Configuration Igor D- urd-anovi c, Hans Kleine B uning Department of Mathematics and Computer Science University of Paderborn D{33098 Paderborn, Germanyy email: figor, kbcslg@uni-paderborn.de September 20, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-022.ps.Z, 19961002
An Algorithm for Resource{based Configuration Igor D- urd-anovi c, Hans Kleine B uning Department of Mathematics and Computer Science University of Paderborn D{33098 Paderborn, Germanyy email: figor, kbcslg@uni-paderborn.de September 20, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-024.ps.Z, 19961002
The PARTY Partitioning - Library User Guide { Version 1.1 Robert Preis HEINZ NIXDORF INSTITUT Universit at Paderborn, Germany preis@hni.uni-paderborn.de and Ralf Diekmann y Department of Mathematics and Computer Science Universit at Paderborn, Germany diek@uni-paderborn.de September 16, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-027.ps.Z, 19961028
Priority Queue Operations and Selection for the BSP* Model Armin B aumker, Wolfgang Dittrich Friedhelm Meyer auf der Heide, and Ingo Rieping fabk, dittrich, fmadh, inrig@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-026.ps.Z, 19961028
2 1 Einleitung Prozesse, Aufgaben und Ziele von Unternehmen sind unterschiedlich. StandardsoftwareSysteme mit ihren festgef gten Strukturen, Abl ufen und ausschliefllich parametrisierbaren Funktionen f r die Produktionsplanung und -steuerung (PPS) einzusetzen, ist daher uflerst problematisch. H ufig
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-026.ps.Z, 19961028
2 1 Einleitung Prozesse, Aufgaben und Ziele von Unternehmen sind unterschiedlich. StandardsoftwareSysteme mit ihren festgef gten Strukturen, Abl ufen und ausschliefllich parametrisierbaren Funktionen f r die Produktionsplanung und -steuerung (PPS) einzusetzen, ist daher uflerst problematisch. H ufig
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-027.ps.Z, 19961028
Priority Queue Operations and Selection for the BSP* Model Armin B aumker, Wolfgang Dittrich Friedhelm Meyer auf der Heide, and Ingo Rieping fabk, dittrich, fmadh, inrig@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-021.ps.Z, 19961030
Decentralized Remapping of Data Parallel Applications in Distributed Memory Multiprocessors Chengzhong Xu y Dept. of Electrical & Computer Engg. Wayne State University Detroit, MI 48202 czxu@ece.eng.wayne.edu Francis C.M. Lau y Department of Computer Science The University of Hong Kong fcmlau@cs.hku.hk
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-020.ps.Z, 19961030
Nearest neighbor algorithms for load balancing in parallel computers Chengzhong Xu y Dept. of Electrical & Computer Engg. Wayne State University, Detroit, MI 48202 czxu@ece.eng.wayne.edu Burkhard Monien and Reinhard L uling z Department of Computer Science University of Paderborn, Germany fbm,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-021.ps.Z, 19961030
Decentralized Remapping of Data Parallel Applications in Distributed Memory Multiprocessors Chengzhong Xu y Dept. of Electrical & Computer Engg. Wayne State University Detroit, MI 48202 czxu@ece.eng.wayne.edu Francis C.M. Lau y Department of Computer Science The University of Hong Kong fcmlau@cs.hku.hk
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-020.ps.Z, 19961030
Nearest neighbor algorithms for load balancing in parallel computers Chengzhong Xu y Dept. of Electrical & Computer Engg. Wayne State University, Detroit, MI 48202 czxu@ece.eng.wayne.edu Burkhard Monien and Reinhard L uling z Department of Computer Science University of Paderborn, Germany fbm,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-028.ps.Z, 19961106
Parallelization Methods for a Characteristic's Pressure Correction Scheme S. Blazy, W. Borchers, U. Dralle Universit at Paderborn, Fachbereich 17, Warburgerstr. 100, 33098 Paderborn1 Summary Pressure correction schemes and the method of characteristics are combined to obtain numerical approximation
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-028.ps.Z, 19961106
Parallelization Methods for a Characteristic's Pressure Correction Scheme S. Blazy, W. Borchers, U. Dralle Universit at Paderborn, Fachbereich 17, Warburgerstr. 100, 33098 Paderborn1 Summary Pressure correction schemes and the method of characteristics are combined to obtain numerical approximation
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-029.ps.Z, 19961112
A Model for Systolic Parallelization of Multiple Loop Programs Friedrich Wichmann Universit at-Gesamthochschule Paderborn F urstenallee 11, 33102 Paderborn, Germany email: fwich@uni-paderborn.de November 11, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-029.ps.Z, 19961112
A Model for Systolic Parallelization of Multiple Loop Programs Friedrich Wichmann Universit at-Gesamthochschule Paderborn F urstenallee 11, 33102 Paderborn, Germany email: fwich@uni-paderborn.de November 11, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-96-174.ps.Z, 19961126
Efficiency of Proof Calculi Ulf Dunker, Andreas Goerdt, Hans Kleine B uning, Theodor Lettmann FB 17 { Mathematik/Informatik Universit at Paderborn Bericht Nr. 174 Reihe Informatik April 1996 Efficiency of Proof Calculi 1 Ulf Dunker, Andreas Goerdt, Hans Kleine B uning, Theodor Lettmann FB 17 {
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-030.ps.Z, 19961126
Improved Routing and Sorting on Multibutterflies Bruce M. Maggs1 School of Computer Science Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 bmm@cs.cmu.edu Berthold V ocking2 Dept. of Mathematics and Computer Science, and Heinz Nixdorf Institute University of Paderborn 33095 Paderborn,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-031.ps.Z, 19961126
Efficient Oblivious Parallel Sorting on the MasPar MP-1 Klaus Brockmann Heinz Nixdorf Institute Paderborn University 33095 Paderborn, Germany email: brockm@hni.uni-paderborn.de Rolf Wanka y International Computer Science Institute 1947 Center Street Berkeley, CA 94704-1198, USA email:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-031.ps.Z, 19961126
Efficient Oblivious Parallel Sorting on the MasPar MP-1 Klaus Brockmann Heinz Nixdorf Institute Paderborn University 33095 Paderborn, Germany email: brockm@hni.uni-paderborn.de Rolf Wanka y International Computer Science Institute 1947 Center Street Berkeley, CA 94704-1198, USA email:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-030.ps.Z, 19961126
Improved Routing and Sorting on Multibutterflies Bruce M. Maggs1 School of Computer Science Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 bmm@cs.cmu.edu Berthold V ocking2 Dept. of Mathematics and Computer Science, and Heinz Nixdorf Institute University of Paderborn 33095 Paderborn,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-96-174.ps.Z, 19961126
Efficiency of Proof Calculi Ulf Dunker, Andreas Goerdt, Hans Kleine B uning, Theodor Lettmann FB 17 { Mathematik/Informatik Universit at Paderborn Bericht Nr. 174 Reihe Informatik April 1996 Efficiency of Proof Calculi 1 Ulf Dunker, Andreas Goerdt, Hans Kleine B uning, Theodor Lettmann FB 17 {
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-032.ps.Z, 19961212
Periodic merging networks Miros law Kuty lowski1 and Krzysztof Lory s2 and Brigitte Oesterdiekhoff1 1 Heinz Nixdorf Institute and Department of Mathematics and Computer Science, University of Paderborn, D-33095 Paderborn, Germany, fmirekk,brigitteg@uni-paderborn.de 2 Dept. of Computer Science,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-032.ps.Z, 19961212
Periodic merging networks Miros law Kuty lowski1 and Krzysztof Lory s2 and Brigitte Oesterdiekhoff1 1 Heinz Nixdorf Institute and Department of Mathematics and Computer Science, University of Paderborn, D-33095 Paderborn, Germany, fmirekk,brigitteg@uni-paderborn.de 2 Dept. of Computer Science,
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-017.ps.Z, 19970106
Towards Developing Universal Dynamic Mapping Algorithms Thomas Decker, Ralf Diekmann, Reinhard L uling, and Burkhard Monien Department of Mathematics and Computer Science University of Paderborn, Germany e-mail: fdecker, diek, rl, bmg@uni-paderborn.de http://www.uni-paderborn.de/cs/ag-monien.html
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-017.ps.Z, 19970106
Towards Developing Universal Dynamic Mapping Algorithms Thomas Decker, Ralf Diekmann, Reinhard L uling, and Burkhard Monien Department of Mathematics and Computer Science University of Paderborn, Germany e-mail: fdecker, diek, rl, bmg@uni-paderborn.de http://www.uni-paderborn.de/cs/ag-monien.html
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-033.ps.Z, 19970116
Aktuelle Aspekte regelbasierten Routings 1 Andreas C. D ring, Gunther Lustig, Erik Maehle, Wolfgang Obel er Medizinische Universit t zu L beck Institut f r Technische Informatik Ratzeburger Allee 160, D-23538 L beck doering, lustig, maehle, obeloeer@iti.mu-luebeck.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-034.ps.Z, 19970116
- 1 - Rule-Based Routing for Fault-Tolerant Parallel Computers Werner Brockmann, Andreas D ring, Thomas Kosch, Gunther Lustig and Erik Maehle Medizinische Universit t zu L beck Institut f r Technische Informatik Ratzeburger Allee 160 D-23538 L beck, Germany E-mail: maehle@iti.mu-luebeck.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-97-033.ps.Z, 19970116
Aktuelle Aspekte regelbasierten Routings 1 Andreas C. D ring, Gunther Lustig, Erik Maehle, Wolfgang Obel er Medizinische Universit t zu L beck Institut f r Technische Informatik Ratzeburger Allee 160, D-23538 L beck doering, lustig, maehle, obeloeer@iti.mu-luebeck.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-025.ps.Z, 19970116
1 ANALYSIS OF NETWORK BEHAVIOR IN RESPECT TO DIFFERENT ROUTING DECISION TIMES1 Andreas C. D ring Gunther Lustig Wolfgang Obel er Medizinische Universit t zu L beck, Institut f r Technische Informatik Direktor: Prof. Dr.-Ing. Erik Maehle Ratzeburger Allee 160, D-23538 L beck E-Mail:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-035.ps.Z, 19970116
Systematischer Einsatz von Software-Wiederverwendung bei der Entwicklung paralleler Programme Christoph Eilinghoff Universit at-Gesamthochschule Paderborn F urstenallee 11, 33102 Paderborn, Germany email: che@uni-paderborn.de 8. Januar 1997
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-97-034.ps.Z, 19970116
- 1 - Rule-Based Routing for Fault-Tolerant Parallel Computers Werner Brockmann, Andreas D ring, Thomas Kosch, Gunther Lustig and Erik Maehle Medizinische Universit t zu L beck Institut f r Technische Informatik Ratzeburger Allee 160 D-23538 L beck, Germany E-mail: maehle@iti.mu-luebeck.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-97-035.ps.Z, 19970116
Systematischer Einsatz von Software-Wiederverwendung bei der Entwicklung paralleler Programme Christoph Eilinghoff Universit at-Gesamthochschule Paderborn F urstenallee 11, 33102 Paderborn, Germany email: che@uni-paderborn.de 8. Januar 1997
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-025.ps.Z, 19970116
1 ANALYSIS OF NETWORK BEHAVIOR IN RESPECT TO DIFFERENT ROUTING DECISION TIMES1 Andreas C. D ring Gunther Lustig Wolfgang Obel er Medizinische Universit t zu L beck, Institut f r Technische Informatik Direktor: Prof. Dr.-Ing. Erik Maehle Ratzeburger Allee 160, D-23538 L beck E-Mail:
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-036.ps.Z, 19970214
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka Dept. of Mathematics and Computer Science and Heinz Nixdorf Institute University of Paderborn D-33095 Paderborn, Germany e-mail: ffmadh,wankag@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-97-036.ps.Z, 19970214
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka Dept. of Mathematics and Computer Science and Heinz Nixdorf Institute University of Paderborn D-33095 Paderborn, Germany e-mail: ffmadh,wankag@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-97-183.ps.Z, 19970313
FACTORING POLYNOMIALS OVER FINITE FIELDS: A SURVEY Joachim von zur Gathen Fachbereich 17 Mathematik-Informatik, Universit at-GH Paderborn D-33095 Paderborn, Germany gathen@uni-paderborn.de Daniel Panario Department of Computer Science, University of Toronto Toronto, Ontario M5S 1A4, Canada
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-rsfb-96-029-errata.ps.Z, 19970313
A Model for Systolic Parallelization of Multiple Loop Programs Friedrich Wichmann Universit at-Gesamthochschule Paderborn F urstenallee 11, 33102 Paderborn, Germany email: fwich@uni-paderborn.de November 11, 1996
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik.alt/tr-ri-97-184.ps.Z, 19970313
A Novel Data-structure to Compute Dominating Set and Convex Hull in a Plane P. C. P. Bhatt Jan 6; 1997
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-047.ps.Z, 19970908
Periodic Comparator Networks Brigitte Oesterdiekhoff Heinz Nixdorf Institute and Department of Mathematics & Computer Science University of Paderborn, D-33095 Paderborn, Germany brigitte@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-049.ps.Z, 19970909
Case-Based Search Techniques for Solving Configuration Problems Eyke H ullermeier Department of Mathematics and Computer Science University of Paderborn September 9, 1997
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-041.ps.Z, 19970909
1 Verteilte und parallele nderungsrechnung f r Flow Shop Probleme auf der Basis einer objektorientierten Plattform* Norbert Holth fer, Wilhelm Dangelmaier HEINZ NIXDORF INSTITUT Universit t-GH Paderborn Wirtschaftsinformatik, insbesondere CIM e-mail: {holth, whd}@hni.uni-paderborn.de Technischer Bericht
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-046.ps.Z, 19970909
On Refinement of 2-Dimensional Grids Sergei Bezrukov, Walter Unger Fachbereich Mathematik/Informatik Universit at-GH Paderborn F urstenallee 11, 33102 Paderborn
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-044.ps.Z, 19970923
Ein paralleler Branch & Bound-Algorithmus zur Minimierung der Zykluszeit in Fliesslinien mit parallelen Maschinen Klaus Brockmann, Wilhelm Dangelmaier Heinz Nixdorf Institut Universit at-Gesamthochschule Paderborn F urstenallee 11, 33102 Paderborn, Germany fbrockm,whdg@hni.uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-97-189.ps.Z, 19970923
OFT Objectives and Concepts Benno Stein tr-ri-97- OFT Objectives and Concepts Technical Report August, 1996 Benno Stein email: stein@uni-paderborn.de This work was supported by the DFG Project number: Kl 529/7-1; Schw 120/56-1 B University of Paderborn Department of Mathematics / Computer Science
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-050.ps.Z, 19970923
Load Balancing Strategies for Distributed Memory Machines Ralf Diekmann and Burkhard Monien Department of Computer Science University of Paderborn F urstenallee 11, D-33102 Paderborn, Germany and Robert Preis Heinz Nixdorf Institut University of Paderborn F urstenallee 11, D-33102 Paderborn, Germany
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-97-187.ps.Z, 19970923
A Lower Bound for Randomized Algebraic Decision Trees Dima Grigoriev y Marek Karpinski z Friedhelm Meyer auf der Heide x Roman Smolensky {
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-043.ps.Z, 19970923
Virtual Data Space - A Universal Load Balancing Scheme Thomas Decker Department of Mathematics and Computer Science University of Paderborn, Germany e-mail: decker@uni-paderborn.de http://www.uni-paderborn.de/cs/decker.html
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-97-188.ps.Z, 19970923
Efficient Algorithms for the Consistency Analysis in Szenario Projects (Technical Report) Rainer Feldmann and Norbert Sensen Department of Mathematics and Computer Science University of Paderborn September 3, 1997
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-023.ps.Z, 19971022
New Aspects and Applications of Resource-based Con guration Igor ur fldanovi c , Hans Kleine B ning , Michael Suermann Email: igord@research.nj.nec.com, {kbcsl, michel}@uni-paderborn.de NEC Research Institute 4 Independence Way Princeton NJ 08540 USA University of Paderborn Department of Mathematics /
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-051.ps.Z, 19971029
Stability analysis of some odd-even schemes for two-dimensional diffusion and Schr odinger problems Raimondas <=Ciegis and Olga <=Stikonien _e Institute of Mathematics and Informatics Akademijos 4, 2600 Vilnius, Lithuania e-mail: rc@fm.vtu.lt olgast@ktl.mii.lt Uwe Dralle Paderborn Center for Parallel
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-048.ps.Z, 19971104
An Open, Distributed CAE Environment Thomas Decker and Ralf Diekmann http://www.uni-paderborn.de/cs/ag-monien.html mailto:fdecker, diekg@uni-paderborn.de Department of Computer Science University of Paderborn, F urstenallee 11, D-33102 Paderborn, Germany Peter Klingebiel
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-97-190.ps.Z, 19971120
On Subclasses of Minimal Unsatisfiable Formulas Hans Kleine B uning Department of Mathematics and Computer Science University of Paderborn 33095 Paderborn (Germany) E-mail: kbcsl@uni-paderborn.de
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-ri-97-191.ps.Z, 19971203
A Lower Bound for Randomized Algebraic Decision Trees Dima Grigoriev y Marek Karpinski z Friedhelm Meyer auf der Heide x Roman Smolensky {
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-97-054.ps.Z, 19980121
Efficient Embeddings of Grids into Grids Markus R ottger and Ulf-Peter Schroeder Department of Mathematics and Computer Science University of Paderborn D-33095 Paderborn, Germany e-mail: roettger@uni-paderborn.de, ups@uni-paderborn.de http://www.uni-paderborn.de/cs/ phone: +49
open this document and view contentsftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-98-055.ps.Z, 19980121
Experimental Validation of Parallel Computation Models on the Intel Paragon Ben H.H. Juurlink Heinz Nixdorf Institute, Paderborn University F urstenallee 11, 33102 Paderborn, Germany E-mail: benj@uni-paderborn.de