792 Publications

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 | OA
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 | OA
Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.
LibreCat | Files available
 
2000 | Conference Paper | LibreCat-ID: 2147 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat | Files available
 
1997 | Conference Paper | LibreCat-ID: 2179 | OA
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.
LibreCat | Files available
 
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
LibreCat | DOI
 
1997 | Journal Article | LibreCat-ID: 16565
Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.
LibreCat | DOI
 
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071.
LibreCat | DOI
 
1997 | Conference Paper | LibreCat-ID: 16568
Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.
LibreCat | DOI
 
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat | DOI
 
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997, doi:10.1145/258492.258522.
LibreCat | DOI
 
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.
LibreCat | DOI
 
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
LibreCat | DOI
 
1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117.
LibreCat | DOI
 
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.
LibreCat | DOI
 
1996 | Journal Article | LibreCat-ID: 19958
Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
LibreCat
 
1996 | Report | LibreCat-ID: 17418
Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996.
LibreCat
 
1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.
LibreCat
 
1996 | Conference Paper | LibreCat-ID: 17483
Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27.
LibreCat | Files available
 
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.
LibreCat | DOI
 
1996 | Report | LibreCat-ID: 18352
Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
LibreCat | Files available
 
1996 | Dissertation | LibreCat-ID: 2181
Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.
LibreCat
 
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat | DOI
 
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
LibreCat | Files available
 
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat | Files available
 
1996 | Journal Article | LibreCat-ID: 16698
Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
LibreCat | DOI
 
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
LibreCat | DOI
 
1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
LibreCat | DOI
 
1996 | Journal Article | LibreCat-ID: 16701
Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.
LibreCat | DOI
 
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.
LibreCat | DOI
 
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS 96, 1996, doi:10.1007/3-540-60922-9_16.
LibreCat | DOI
 
1995 | Dissertation | LibreCat-ID: 19623
Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 
1995 | Dissertation | LibreCat-ID: 19627
Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat | Files available
 
1995 | Dissertation | LibreCat-ID: 19630
Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 
1995 | Dissertation | LibreCat-ID: 19634
Ameur, Foued. Space-Bounded Learning Algorithms. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 
1995 | Conference Paper | LibreCat-ID: 17482
Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat
 
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat | Files available | DOI
 
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat | Files available
 
1995 | Journal Article | LibreCat-ID: 16566
Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
LibreCat | DOI
 
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
LibreCat | DOI
 
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
LibreCat | DOI
 
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995, doi:10.1145/215399.215430.
LibreCat | DOI
 
1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
LibreCat | DOI
 
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.
LibreCat | DOI
 
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat | DOI
 
1994 | Dissertation | LibreCat-ID: 19624
Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. 1994.
LibreCat | Files available
 
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.
LibreCat | DOI
 
1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
LibreCat | DOI
 
1993 | Conference Paper | LibreCat-ID: 17479
Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat
 
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
LibreCat | DOI
 
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
LibreCat | DOI
 
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993, doi:10.1145/165231.165246.
LibreCat | DOI
 
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.
LibreCat | DOI
 
1992 | Journal Article | LibreCat-ID: 18936
Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, pp. 213–20, doi:10.1142/s0129626492000349.
LibreCat | DOI
 
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
LibreCat | DOI
 
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992, doi:10.1007/3-540-56731-3_3.
LibreCat | DOI
 
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
LibreCat | DOI
 
1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992, doi:10.1145/129712.129743.
LibreCat | DOI
 
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
LibreCat | DOI
 
1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
LibreCat | DOI
 
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.
LibreCat | DOI
 
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.
LibreCat | DOI
 
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029630.
LibreCat | DOI
 
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100229.
LibreCat | DOI
 
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100247.
LibreCat | DOI
 
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32.
LibreCat
 
1989 | Journal Article | LibreCat-ID: 16743
Just, Bettina, et al. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011.
LibreCat | DOI
 
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989, doi:10.1145/72935.72974.
LibreCat | DOI
 
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi:10.1007/bfb0028969.
LibreCat | DOI
 
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” STACS 89, 1989, doi:10.1007/bfb0028978.
LibreCat | DOI
 
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat | DOI
 
1988 | Journal Article | LibreCat-ID: 16763
Babai, László, et al. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, pp. 99–107, doi:10.1016/0890-5401(88)90031-4.
LibreCat | DOI
 
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
LibreCat | DOI
 
1988 | Journal Article | LibreCat-ID: 16765
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Theoretical Computer Science, 1988, pp. 57–68, doi:10.1016/0304-3975(88)90018-7.
LibreCat | DOI
 
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988, doi:10.1109/sfcs.1988.21968.
LibreCat | DOI
 
1988 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, et al. “On Computations with Integer Division.” STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat | DOI
 
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
LibreCat | DOI
 
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
LibreCat | DOI
 
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
LibreCat | DOI
 
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” SIAM Journal on Computing, 1986, pp. 106–19, doi:10.1137/0215008.
LibreCat | DOI
 
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.
LibreCat | DOI
 
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat | DOI
 
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS 86, 1986, doi:10.1007/3-540-16078-7_89.
LibreCat | DOI
 
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.
LibreCat | DOI
 
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250.
LibreCat | DOI
 
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9.
LibreCat | DOI
 
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.
LibreCat | DOI
 
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22151.
LibreCat | DOI
 
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22191.
LibreCat | DOI
 
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38.
LibreCat | DOI
 
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control, vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8.
LibreCat | DOI
 
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450.
LibreCat | DOI
 
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.” 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.
LibreCat | DOI
 
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
LibreCat | DOI
 
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.
LibreCat | DOI
 
1983 | Journal Article | LibreCat-ID: 16807
Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735.
LibreCat | DOI
 
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.
LibreCat | DOI
 
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983, doi:10.1145/800061.808734.
LibreCat | DOI
 
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.
LibreCat | DOI
 
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
LibreCat | DOI
 
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
LibreCat | DOI
 
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.
LibreCat | DOI
 
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.
LibreCat | DOI
 
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979, pp. 411–21, doi:10.1007/3-540-09510-1_32 .
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export