Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model. Proc. 5th Conference on Real Numbers and Computers (RN), INRIA, 47–64.
LibreCat: /record/26263

Ziegler, M. (2003). Computable Operators on Regular Sets. Computability and Complexity in Analysis, 302-8/2003, 389–406.
LibreCat: /record/26277

Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &; Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer.https://doi.org/10.1007/978-3-540-39658-1_17 
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch, B., Brinkmann, A., &; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.
LibreCat: /record/2129

Mueck, B., Dangelmaier, W., &; Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In 15th European Simulation Symposium (ESS 2003) (pp. 367–371). SCS - Europe.
LibreCat: /record/17423

Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &; Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) (pp. 813–822).
LibreCat: /record/18791

Bienkowski, M., Korzeniowski, M., &; Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03.https://doi.org/10.1145/777412.777418 
LibreCat: /record/18907
DOI: 10.1145/777412.777418

Rust, C., Stappert, F., &; Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In 7th World Multiconference on Systemics, Cybernetics and Informatics.
LibreCat: /record/18947

Schindelhauer, C., Lukovszki, T., Rührup, S., &; Volbert, K. (2003). Worst case mobility in ad hoc networks. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA).https://doi.org/10.1145/777412.777448 
LibreCat: /record/18960
DOI: 10.1145/777412.777448

Azar, Y., Cohen, E., Fiat, A., Kaplan, H., &; Racke, H. (2003). Optimal oblivious routing in polynomial time. In Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03.https://doi.org/10.1145/780542.780599 
LibreCat: /record/18966
DOI: 10.1145/780542.780599

Gehweiler, J. (2003). Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn.
LibreCat: /record/18982

Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems, 14(3), 263--268.
LibreCat: /record/20435

Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03) (pp. 705–715).https://doi.org/10.1007/978-3-540-24587-2_72 
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &; Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science (Vol. 2748). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-45078-8_13 
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Fischer, M., Grafe, M., Matysczok, C., Mueck, B., &; Schoo, M. (2003). Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management (Vol. 5, pp. 170–177). Karlsruhe: Shaker Verlag.
LibreCat: /record/18367

Dangelmaier, W.,  Franke, W., Mueck, B., &; Fischer, M. (2003). Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In 2. Paderborner Workshop Augmented &; Virtual Reality in der Produktentstehung (Vol. 123, pp. 141–151).
LibreCat: /record/18372

Fischer, M., Grafe, M., Matysczok, C., Schoo, M., &; Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, 123, 153–166.
LibreCat: /record/18374

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

Sohler, C. (2003). Property Testing and Geometry (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18573

Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). It - Information Technology.https://doi.org/10.1524/itit.45.2.108.19606 
LibreCat: /record/16481
DOI: 10.1524/itit.45.2.108.19606

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

Rosenberg, A. L., &; Meyer auf der Heide, F. (Eds.). (2003). Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03.https://doi.org/10.1145/777412 
LibreCat: /record/16484
DOI: 10.1145/777412

Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann, J.-C.,https://doi.org/10.1109/LCN.2003.1243185__Thies, M. (2003). A holistic methodology for network processor design. In 28th Annual IEEE International Conference on Local Computer Networks.https://doi.org/10.1109/LCN.2003.1243185 
LibreCat: /record/16720
DOI: 10.1109/LCN.2003.1243185

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

Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg.https://doi.org/10.1007/3-540-36379-3_36 
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Klein, J., Krokowski, J., &; Cuntz, N. (2002). Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In Proc. of 4. GI-Informatiktage (pp. 224–229).
LibreCat: /record/19873

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

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

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

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

Sohler, C., &; Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 83–92.
LibreCat: /record/18853

Lukovszki, T., &; Benczúr, A. (2002). A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn.
LibreCat: /record/18961

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

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

Ziegler, M., Damerow, V., &; Finschi, L. (2002). Point Location Algorithms of Minimum Size. In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02).
LibreCat: /record/18177

Brattka, V., &; Ziegler, M. (2002). Computability of Linear Equations. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (pp. 95–106). Boston, MA.https://doi.org/10.1007/978-0-387-35608-2_9 
LibreCat: /record/18179
DOI: 10.1007/978-0-387-35608-2_9

Mueck, B., Dangelmaier, W., Fischer, M., &; Klemisch, W. (2002). Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In Simulation und Visualisierung (pp. 71–84). Ghent, BE: SCS European Publishing House.
LibreCat: /record/18369

Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &; Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45465-9_77 
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &; Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems, 217–245.https://doi.org/10.1007/s00224-001-1045-z 
LibreCat: /record/16489
DOI: 10.1007/s00224-001-1045-z

Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &; Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02.https://doi.org/10.1145/585740.585764 
LibreCat: /record/16490
DOI: 10.1145/585740.585764

Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &; Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02.https://doi.org/10.1145/564870.564910 
LibreCat: /record/16491
DOI: 10.1145/564870.564910

Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &; Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45706-2_133 
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing (Vol. 89). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19622

Salzwedel, K., Hartmann, G., Wolff, C., &; Preis, R. (2001). Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In Proceedings of the PDPTA 2001 (Vol. 1, pp. 463–470).
LibreCat: /record/19797

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

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

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

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

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

Lukovszki, T., Maheshwari, A., &; Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS.https://doi.org/10.1007/3-540-45294-x_21 
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21

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

Ziegler, M., &; Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45335-0_23 
LibreCat: /record/18152
DOI: 10.1007/3-540-45335-0_23

Ziegler, M., &; Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).
LibreCat: /record/18166

Brattka, V., &; Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01) (pp. 181–184).
LibreCat: /record/18168

Klein, J., &; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp. 275–278). Bad Schussenried.
LibreCat: /record/18370

Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &; Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01.https://doi.org/10.1145/383259.383299 
LibreCat: /record/16492
DOI: 10.1145/383259.383299

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

Meyer auf der Heide, F., &; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45718-6_68 
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer .https://doi.org/10.1007/3-540-44676-1 
LibreCat: /record/16722
DOI: 10.1007/3-540-44676-1

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

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

Bonorden, O., Rieping, I., von Otte, I., &; Juurlink, B. (2000). PUB-Library, Release 7.0, User Guide and Function Reference.
LibreCat: /record/19733

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

Bednara, M., Beyer, O., Teich, J., &; Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308.https://doi.org/10.1109/asap.2000.862400 
LibreCat: /record/19849
DOI: 10.1109/asap.2000.862400

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

Scheideler, C., &; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155.https://doi.org/10.1137/S0097539799353431 
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat: /record/2146

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

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

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

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

Wand, M., Fischer, M., &; Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn.
LibreCat: /record/17865

Govindarajan, S., Lukovszki, T., Maheshwari, A., &; Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614).https://doi.org/10.1007/s00453-005-1197-3 
LibreCat: /record/18962
DOI: 10.1007/s00453-005-1197-3

Czumaj, A., Sohler, C., &; Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-45253-2_15 
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Ziegler, M., &; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-44411-4_34 
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

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

Lorys, K., Wanka, R., Oesterdiekhoff, B., &; Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967.https://doi.org/10.1145/355483.355490 
LibreCat: /record/18446
DOI: 10.1145/355483.355490

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

Meyer auf der Heide, F., Räcke, H., &; Westermann, M. (2000). Data management in hierarchical bus networks. Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00.https://doi.org/10.1145/341800.341814 
LibreCat: /record/16495
DOI: 10.1145/341800.341814

Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (2000). Caching in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).
LibreCat: /record/16496

Meyer auf der Heide, F., Kutyowski, M., &; Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/3-540-44520-x_59 
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739.https://doi.org/10.1137/s009753979529564x 
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

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

Bonorden, O., Juurlink, B., Von Otte, I., &; Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104.https://doi.org/10.1109/ipps.1999.760442 
LibreCat: /record/19732
DOI: 10.1109/ipps.1999.760442

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

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

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

Fischer, M., Lukovszki, T., &; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver.
LibreCat: /record/17864

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

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

Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204).https://doi.org/10.1007/3-540-48447-7_20 
LibreCat: /record/18959
DOI: 10.1007/3-540-48447-7_20

Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &; Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99 (pp. 165–174).https://doi.org/10.1145/305619.305637 
LibreCat: /record/18965
DOI: 10.1145/305619.305637

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

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat: /record/2210

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

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

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

Mayr, E. W., Meyer auf der Heide, F., &; Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell.https://doi.org/10.1007/978-3-662-01069-3_47 
LibreCat: /record/17052
DOI: 10.1007/978-3-662-01069-3_47

Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg.https://doi.org/10.1007/3-540-48481-7_9 
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

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