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.
792 Publications
2003 | Journal Article | LibreCat-ID: 16482
Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.” Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
LibreCat
| DOI
2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. 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, Olaf, et al. “A Holistic Methodology for Network Processor Design.” 28th Annual IEEE International Conference on Local Computer Networks, 2003, doi:10.1109/LCN.2003.1243185.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 19727
Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–08.
LibreCat
2002 | Conference Paper | LibreCat-ID: 19850
Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 19873
Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” Proc. of 4. GI-Informatiktage, 2002, pp. 224–29.
LibreCat
2002 | Journal Article | LibreCat-ID: 24336
Benczúr, András, et al. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” Proc. of 10th International Workshop on Abstract State Machines, LNCS, 2002.
LibreCat
| Files available
2002 | Conference Paper | LibreCat-ID: 24338
Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” Proceedings of the 8th International Euro-Par Conference, 2002, doi:10.1007/3-540-45706-2_134.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 26412
Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.” Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002, doi:10.1109/empdp.2002.994324.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 2136 | 
Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 18853
Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 2002, pp. 83–92.
LibreCat
2002 | Report | LibreCat-ID: 18961
Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. 2002.
LibreCat
2002 | Dissertation | LibreCat-ID: 18169
Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 18176
Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” Mathematical Logic Quarterly (MLQ), vol. 48, no. S1, 2002, pp. 157–81, doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 18177
Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
LibreCat
2002 | Conference Paper | LibreCat-ID: 18179
Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106, doi:10.1007/978-0-387-35608-2_9.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 18369
Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” Simulation Und Visualisierung, SCS European Publishing House, 2002, pp. 71–84.
LibreCat
2002 | Conference Paper | LibreCat-ID: 18566
Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.
LibreCat
| DOI
2002 | Journal Article | LibreCat-ID: 16489
Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002, pp. 217–45, doi:10.1007/s00224-001-1045-z.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 16490
Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” 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: 16491
Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.” Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02, 2002, doi:10.1145/564870.564910.
LibreCat
| DOI
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.
LibreCat
| DOI
2001 | Dissertation | LibreCat-ID: 19622
Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 19797
Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” Proceedings of the PDPTA 2001, vol. 1, 2001, pp. 463–70.
LibreCat
2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 2141 |
Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat
| Files available
2001 | Journal Article | LibreCat-ID: 18749
Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18750
Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.
LibreCat
2001 | Journal Article | LibreCat-ID: 18857
Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), 2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” 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: 23731
Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18152
Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18166
Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), vol. AA, 2001, pp. 155–64.
LibreCat
2001 | Conference Paper | LibreCat-ID: 18168
Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–84.
LibreCat
2001 | Conference Paper | LibreCat-ID: 18370
Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–78.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 16492
Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.
LibreCat
| DOI
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
LibreCat
| DOI
2000 | Dissertation | LibreCat-ID: 19620
Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms and Implementations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
2000 | Dissertation | LibreCat-ID: 19621
Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 19733
Bonorden, Olaf, et al. PUB-Library, Release 7.0, User Guide and Function Reference. 2000.
LibreCat
| Files available
2000 | Habilitation | LibreCat-ID: 19784
Scheideler, Christian. Probabilistic Methods for Coordination Problems. 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 19849
Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi:10.1109/asap.2000.862400.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2143
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 |
Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 18962
Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, Artur, et al. “Property Testing in Computational Geometry.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM, vol. 45, 2000, pp. 944–67, doi:10.1145/355483.355490.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” 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: 16496
Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.
LibreCat
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 17010
Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 16345
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, pp. 112–16.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 19732
Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi:10.1109/ipps.1999.760442.
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 2151
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 2164 |
Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2165 |
Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 17864
Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 18747
Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–41.
LibreCat
1999 | Dissertation | LibreCat-ID: 18942
Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204, doi:10.1007/3-540-48447-7_20.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18965
Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18576
Sohler, Christian. “Generating Random Star-Shaped Polygons.” Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–77.
LibreCat
1999 | Conference Paper | LibreCat-ID: 2210 |
Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2166 |
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.
LibreCat
| Files available
1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.
LibreCat
| DOI
1998 | Dissertation | LibreCat-ID: 19639
Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat
| Files available
1998 | Report | LibreCat-ID: 19735
Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.
LibreCat
| Files available
1998 | Book Chapter | LibreCat-ID: 17412
Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.
LibreCat
| Files available
| DOI
1998 | Conference Paper | LibreCat-ID: 17863
Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, 1998, pp. 133--142.
LibreCat
| Files available
1998 | Report | LibreCat-ID: 18145
Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.
LibreCat
1998 | Dissertation | LibreCat-ID: 18445
Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.
LibreCat
1998 | Journal Article | LibreCat-ID: 2168
Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 2169 |
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
LibreCat
| Files available
1998 | Conference Paper | LibreCat-ID: 2170 |
Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
LibreCat
| Files available
1998 | Book | LibreCat-ID: 2185
Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.
LibreCat
| DOI
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 16563
Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998, doi:10.1145/276698.276790.
LibreCat
| DOI
1997 | Dissertation | LibreCat-ID: 19631
Bäumker, Armin. Communication Efficient Parallel Searching. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19636
Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19637
Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi:10.1007/3-540-63397-9_9.
LibreCat
| DOI
1997 | Report | LibreCat-ID: 18955
Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 18575
Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
1997 | Conference Paper | LibreCat-ID: 2175 |
Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat
| Files available