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.

709 Publications


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

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

2003 | Conference Paper | LibreCat-ID: 18907
Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. ; 2003. doi:10.1145/777412.777418
LibreCat | DOI
 

2003 | Mastersthesis | LibreCat-ID: 19828
Mahlmann P. Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web.; 2003.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 19900
Klein J, Zachmann G. Time-Critical Collision Detection Using an Average-Case Approach. In: Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003). ; 2003:22-31. doi:10.1145/1008653.1008660
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 2128
Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17
LibreCat | DOI
 

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

2003 | Journal Article | LibreCat-ID: 19785
Salzwedel KA. Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies. 2003;2625. doi:10.1007/3-540-36574-5_12
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 19874
Klein J, Zachmann G. ADB-Trees: Controlling the Error of Time-Critical Collision Detection. In: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003). ; 2003:37-45.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 2129
Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.
LibreCat | Files available
 

2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg AL, Meyer auf der Heide F, eds. Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03.; 2003. doi:10.1145/777412
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 16720
Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network processor design. In: 28th Annual IEEE International Conference on Local Computer Networks. ; 2003. doi:10.1109/LCN.2003.1243185
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18372
Dangelmaier W, Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: 2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.
LibreCat | Files available
 

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

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

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

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

2003 | Conference Paper | LibreCat-ID: 19952
Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). ; 2003. doi:10.1137/s0097539702419649
LibreCat | DOI
 

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

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

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

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

2002 | Conference Paper | LibreCat-ID: 19727
Bonorden O, Meyer auf der Heide F, Wanka R. 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). ; 2002:2202-2208.
LibreCat
 

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

2002 | Conference Paper | LibreCat-ID: 18179
Brattka V, Ziegler M. Computability of Linear Equations. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. Boston, MA; 2002:95-106. doi:10.1007/978-0-387-35608-2_9
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16490
Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. 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. ; 2002. doi:10.1145/585740.585764
LibreCat | DOI
 

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

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

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

2002 | Conference Paper | LibreCat-ID: 19850
Wanka R. 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). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36
LibreCat | DOI
 

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

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

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

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

2002 | Report | LibreCat-ID: 18961
Lukovszki T, Benczúr A. 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
Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23
LibreCat | DOI
 

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

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

2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2
LibreCat | DOI
 

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

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

2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18166
Ziegler M, Emamy-Khansari MR. 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. ; 2001:155-164.
LibreCat
 

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

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

2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki T, Maheshwari A, Zeh N. 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. ; 2001. doi:10.1007/3-540-45294-x_21
LibreCat | DOI
 

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

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

2001 | Dissertation | LibreCat-ID: 19622
Schröder K. 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
Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: Proceedings of the PDPTA 2001. Vol 1. ; 2001:463-470.
LibreCat
 

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

2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59
LibreCat | DOI
 

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

2000 | Conference Paper | LibreCat-ID: 17990
Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15
LibreCat | DOI
 

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

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

2000 | Conference Paper | LibreCat-ID: 18146
Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34
LibreCat | DOI
 

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

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

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

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

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

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

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

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

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

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

2000 | Journal Article | LibreCat-ID: 16345
Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn. 2000:112-116.
LibreCat | Files available
 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1999 | Conference Paper | LibreCat-ID: 18965
Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. 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. ; 1999:165-174. doi:10.1145/305619.305637
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17052
Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: Informatik Aktuell. Berlin, Heidelberg; 1999. doi:10.1007/978-3-662-01069-3_47
LibreCat | DOI
 

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

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

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

1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332
LibreCat | DOI
 

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

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

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

1998 | Conference Paper | LibreCat-ID: 16563
Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98. ; 1998. doi:10.1145/276698.276790
LibreCat | DOI
 

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

1998 | Book | LibreCat-ID: 2185
Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 17412
Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg; 1998. doi:10.1007/3-540-68530-8_14
LibreCat | Files available | DOI
 

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

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

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

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

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

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed