Optimal broadcast on parallel locality models
B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete Algorithms (2003) 151–166.
LibreCat: /record/16482
DOI: 10.1016/s1570-8667(03)00023-6

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA 
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: /record/16484
DOI: 10.1145/777412

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: /record/16720
DOI: 10.1109/LCN.2003.1243185

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: /record/19727

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: /record/19850
DOI: 10.1007/3-540-36379-3_36

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: /record/19873

Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks
A.  Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop on Abstract State Machines, LNCS (2002).
LibreCat: /record/24336

Distributed Maintenance of Resource Efficient Wireless Network Topologies
M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

A simulation environment for ad hoc networks using sector subdivision
K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002.
LibreCat: /record/26412
DOI: 10.1109/empdp.2002.994324

Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

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: /record/18853

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: /record/18961

Zur Berechenbarkeit reeller geometrischer Probleme
M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
LibreCat: /record/18169

Computability on Regular Subsets of Euclidean Space
M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.
LibreCat: /record/18176
DOI: 10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4

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: /record/18177

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: /record/18179
DOI: 10.1007/978-0-387-35608-2_9

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: /record/18369

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: /record/18566
DOI: 10.1007/3-540-45465-9_77

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: /record/16489
DOI: 10.1007/s00224-001-1045-z

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: /record/16490
DOI: 10.1145/585740.585764

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: /record/16491
DOI: 10.1145/564870.564910

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: /record/16723
DOI: 10.1007/3-540-45706-2_133

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, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
LibreCat: /record/19622

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: /record/19797

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat: /record/2139
DOI: 10.1007/s004930170007

SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat: /record/2141

Testing Hypergraph Coloring
A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

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

Property Testing with Geometric Queries
C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA) (2001) 266–277.
LibreCat: /record/18857
DOI: 10.1007/3-540-44676-1_22

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: /record/18964
DOI: 10.1007/3-540-45294-x_21

Factoring a binary polynomial of degree over one million
O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.
LibreCat: /record/23731
DOI: 10.1145/504331.504333

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: /record/18152
DOI: 10.1007/3-540-45335-0_23

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: /record/18166

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: /record/18168

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: /record/18370

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: /record/16492
DOI: 10.1145/383259.383299

Data Management in Networks
F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

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: /record/16494
DOI: 10.1007/3-540-45718-6_68

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: /record/16722
DOI: 10.1007/3-540-44676-1

Communication in Parallel Systems-Models, Algorithms and Implementations
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat: /record/19620

Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat: /record/19621

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: /record/19733

Probabilistic Methods for Coordination Problems
C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.
LibreCat: /record/19784

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: /record/19849
DOI: 10.1109/asap.2000.862400

Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat: /record/2143
DOI: 10.1007/s002240010006

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: /record/2145
DOI: 10.1137/S0097539799353431

Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat: /record/2146

Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
LibreCat: /record/2147

Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
LibreCat: /record/2148

Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
LibreCat: /record/2149

A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
LibreCat: /record/2150

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: /record/17865

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: /record/18962
DOI: 10.1007/s00453-005-1197-3

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: /record/17990
DOI: 10.1007/3-540-45253-2_15

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: /record/18146
DOI: 10.1007/3-540-44411-4_34

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

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: /record/18446
DOI: 10.1145/355483.355490

A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems 
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat: /record/2211

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: /record/16495
DOI: 10.1145/341800.341814

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: /record/16496

Complexity Theory and Algorithms
F. Meyer auf der Heide, M. Kutyowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

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: /record/17010
DOI: 10.1137/s009753979529564x

Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik
F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.
LibreCat: /record/16345

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: /record/19732
DOI: 10.1109/ipps.1999.760442

Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat: /record/2164

Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat: /record/2165

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: /record/17864

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

New Results on Geometric Spanners and Their Applications
T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat: /record/18942

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: /record/18959
DOI: 10.1007/3-540-48447-7_20

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: /record/18965
DOI: 10.1145/305619.305637

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

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: /record/2210

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat: /record/2166

Shortest-Path Routing in Arbitrary Networks
F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
LibreCat: /record/16501
DOI: 10.1006/jagm.1998.0980

Allocating Weighted Jobs in Parallel
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.
LibreCat: /record/16502
DOI: 10.1007/s002240000119

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: /record/17052
DOI: 10.1007/978-3-662-01069-3_47

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: /record/17053
DOI: 10.1007/3-540-48481-7_9

Static and Dynamic Data Management in Networks
B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat: /record/19639

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: /record/19735

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: /record/17412
DOI: 10.1007/3-540-68530-8_14

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: /record/17863

Multimediale Entdeckungsreisen unserer Welt mit dem Internet
M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat: /record/18145

On Periodic Comparator Networks
B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.
LibreCat: /record/18445

Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat: /record/2169

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat: /record/2170

Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

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: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

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: /record/16562
DOI: 10.1007/bfb0054332

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: /record/16563
DOI: 10.1145/276698.276790

Communication Efficient Parallel Searching
A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19631

Communication and I/O Efficient Parallel Data Structures
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19636

Bounded Degree Spanning Trees
W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19637

Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Decremental Biconnectivity on Planar Graphs
W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.
LibreCat: /record/18955

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: /record/18575

Optimal Wormhole Routing in the (n, d)-Torus
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat: /record/2175