Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

699 Publications


2003 | Conference (Editor) | LibreCat-ID: 16484
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03
A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 16720
A holistic methodology for network processor design
O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International Conference on Local Computer Networks, 2003.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18372
Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen
W. Dangelmaier, W. Franke, B. Mueck, M. Fischer, in: 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 2003, pp. 141–151.
LibreCat | Files available
 

2003 | Journal Article | LibreCat-ID: 18567
Randomized Pursuit-Evasion in Graphs
M. Adler, B. Vöcking, C. Sohler, H. Räcke, N. Sivadasan, Combinatorics, Probability & Computing (2003) 225–244.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 18947
A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture
C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 18966
Optimal oblivious routing in polynomial time
Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 19806
Performance of distributed algorithms for topology control in wireless networks
S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 19952
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003.
LibreCat | DOI
 

2002 | Journal Article | LibreCat-ID: 18176
Computability on Regular Subsets of Euclidean Space
M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.
LibreCat | DOI
 

2002 | Dissertation | LibreCat-ID: 18169
Zur Berechenbarkeit reeller geometrischer Probleme
M. Ziegler, Zur Berechenbarkeit Reeller Geometrischer Probleme, Universität Paderborn, 2002.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 18177
Point Location Algorithms of Minimum Size
M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
LibreCat
 

2002 | Book Chapter | LibreCat-ID: 16723
Mobile Computing, Mobile Networks
F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 19727
Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example
O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 19873
Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression
J. Klein, J. Krokowski, N. Cuntz, in: Proc. of 4. GI-Informatiktage, 2002, pp. 224–229.
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 18179
Computability of Linear Equations
V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16490
The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments
J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 18369
Bi-directional Coupling of Simulation Tools with a Walkthrough-System
B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 18566
Randomized Pursuit-Evasion in Graphs
M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.
LibreCat | DOI
 

2002 | Dissertation | LibreCat-ID: 18573
Property Testing and Geometry
C. Sohler, Property Testing and Geometry, Universität Paderborn, 2002.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 19850
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 2136
Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 16489
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16491
Energy, congestion and dilation in radio networks
F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002.
LibreCat | DOI
 

2002 | Journal Article | LibreCat-ID: 18853
Abstract Combinatorial Programs and Efficient Property Testers
C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92.
LibreCat
 

2002 | Report | LibreCat-ID: 18961
A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing
T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18152
A Computable Spectral Theorem
M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 16492
The randomized z-buffer algorithm
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
Data Management in Networks
F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2141
SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 2139
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
Parallel Bridging Models and Their Impact on Algorithm Design
F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18166
New Bounds for Hypercube Slicing Numbers
M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, pp. 155–164.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18370
Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph
J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 18750
Soft Kinetic Data Structures
C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18964
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 18749
Testing Hypergraph Coloring
A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 18857
Property Testing with Geometric Queries
C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277.
LibreCat | DOI
 

2001 | Dissertation | LibreCat-ID: 19622
Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing
K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, Universität Paderborn, 2001.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 19797
Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)
K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA 2001, 2001, pp. 463–470.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18168
Turing Computability of (Non-)Linear Optimization
V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.
LibreCat
 

2000 | Book Chapter | LibreCat-ID: 16497
Complexity Theory and Algorithms
F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
Contention Resolution in Hashing Based Shared Memory Simulations
A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
Property Testing in Computational Geometry
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18962
I/O-Efficient Well-Separated Pair Decomposition and Applications
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2145
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
Computing the Dimension of Linear Subspaces
M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.
LibreCat | DOI
 

2000 | Dissertation | LibreCat-ID: 19620
Communication in Parallel Systems-Models, Algorithms and Implementations
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Universität Paderborn, 2000.
LibreCat
 

2000 | Report | LibreCat-ID: 19733
PUB-Library, Release 7.0, User Guide and Function Reference
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2146
Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat | Files available
 

2000 | Report | LibreCat-ID: 17865
Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes
M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.
LibreCat | Files available
 

2000 | Dissertation | LibreCat-ID: 19621
Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Universität Paderborn, 2000.
LibreCat | Files available
 

2000 | Habilitation | LibreCat-ID: 19784
Probabilistic Methods for Coordination Problems
C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 16495
Data management in hierarchical bus networks
F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18150
Computing Cut Numbers
M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
 

2000 | Journal Article | LibreCat-ID: 18446
Periodification Scheme: Constructing Sorting Networks with Constant Period
K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.
LibreCat
 

2000 | Journal Article | LibreCat-ID: 2143
Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 16345 LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 16496
Caching in networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 19849
Tradeoff analysis and architecture design of a hybrid hardware/software sorter
M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2149
Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
LibreCat | Files available
 

1999 | Book Chapter | LibreCat-ID: 17053
Provably Good and Practical Strategies for Non-uniform Data Management in Networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 19732
The Paderborn university BSP (PUB) library-design, implementation and performance
O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2210
Design of the PRESTO Multimedia Storage Network (Extended Abstract)
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2164
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 16501
Shortest-Path Routing in Arbitrary Networks
F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 17864
Partitioned neighborhood spanners of minimal outdegree
M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18576
Generating Random Star-Shaped Polygons
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 18747
Fast Reconstruction of Delaunay Triangulations
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 2165
Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 16502
Allocating Weighted Jobs in Parallel
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2166
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18965
Data management in networks: experimental evaluation of a provably good strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–174.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17052
International Workshop on Communication and Data Management in Large Networks
E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18959
New Results on Fault Tolerant Geometric Spanners
T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat | DOI
 

1999 | Dissertation | LibreCat-ID: 18942
New Results on Geometric Spanners and Their Applications
T. Lukovszki, New Results on Geometric Spanners and Their Applications, Universität Paderborn, 1999.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 2151
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 16562
Communication-efficient parallel multiway and approximate minimum cut computation
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat | DOI
 

1998 | Report | LibreCat-ID: 18145
Multimediale Entdeckungsreisen unserer Welt mit dem Internet
M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat
 

1998 | Conference Paper | LibreCat-ID: 17863
A Network Based Approach for Realtime Walkthrough of Massive Models
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.
LibreCat | Files available
 

1998 | Conference Paper | LibreCat-ID: 2169
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat | Files available
 

1998 | Conference Paper | LibreCat-ID: 16563
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998.
LibreCat | DOI
 

1998 | Dissertation | LibreCat-ID: 18445
On Periodic Comparator Networks
B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.
LibreCat
 

1998 | Book | LibreCat-ID: 2185
Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 17412
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat | Files available | DOI
 

1998 | Dissertation | LibreCat-ID: 19639
Static and Dynamic Data Management in Networks
B. Vöcking, Static and Dynamic Data Management in Networks, Universität Paderborn, 1998.
LibreCat | Files available
 

1998 | Report | LibreCat-ID: 19735
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.
LibreCat | Files available
 

1998 | Journal Article | LibreCat-ID: 16503
Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16504
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 2170
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat | Files available
 

1998 | Journal Article | LibreCat-ID: 2168
Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16567
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 18575
Encoding a Triangulation as a Permutation of its Point Set
C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
 

1997 | Report | LibreCat-ID: 18955
Decremental Biconnectivity on Planar Graphs
W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.
LibreCat | Files available
 

1997 | Dissertation | LibreCat-ID: 19636
Communication and I/O Efficient Parallel Data Structures
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Universität Paderborn, 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19631
Communication Efficient Parallel Searching
A. Bäumker, Communication Efficient Parallel Searching, Universität Paderborn, 1997.
LibreCat
 

1997 | Conference Paper | LibreCat-ID: 19869
Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16568
Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
LibreCat | DOI
 

1997 | Dissertation | LibreCat-ID: 19637
Bounded Degree Spanning Trees
W.-B. Strothmann, Bounded Degree Spanning Trees, Universität Paderborn, 1997.
LibreCat | Files available
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed