792 Publications
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
2002 | Dissertation | LibreCat-ID: 18169
Ziegler M. Zur Berechenbarkeit reeller geometrischer Probleme. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002.
LibreCat
| Files available
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 | 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 | 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: 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 | 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. Published online 2002:217-245. doi:10.1007/s00224-001-1045-z
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: 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 | 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
2001 | Dissertation | LibreCat-ID: 19622
Schröder K. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 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 | 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 | 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: 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 | 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 | 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 | 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: 23731
Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333
LibreCat
| DOI
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: 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: 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
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: 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 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 | 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 | 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
2000 | Dissertation | LibreCat-ID: 19620
Rieping I. Communication in Parallel Systems-Models, Algorithms and Implementations. Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.
LibreCat
2000 | Dissertation | LibreCat-ID: 19621
Westermann M. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.
LibreCat
| Files available
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 | Habilitation | LibreCat-ID: 19784
Scheideler C. Probabilistic Methods for Coordination Problems.; 2000.
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 | 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: 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: 2146 |
Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.
LibreCat
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
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.
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 | 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 | 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: 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 | 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. doi:10.1145/355483.355490
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.
LibreCat
| Files available
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: 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 | 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 | 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
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 | 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
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 | 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 | 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: 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 | Dissertation | LibreCat-ID: 18942
Lukovszki T. New Results on Geometric Spanners and Their Applications. Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.
LibreCat
| Files available
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 | 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 | 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: 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: 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 | 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 | 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 | 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. ; 1999. doi:10.1007/978-3-662-01069-3_47
LibreCat
| DOI
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
1998 | Dissertation | LibreCat-ID: 19639
Vöcking B. Static and Dynamic Data Management in Networks. Vol 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 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 | 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 | 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 | Report | LibreCat-ID: 18145
Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998.
LibreCat
1998 | Dissertation | LibreCat-ID: 18445
Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn; 1998.
LibreCat
1998 | Journal Article | LibreCat-ID: 2168
Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
LibreCat
| DOI
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: 2170 |
Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.
LibreCat
| Files available
1998 | Book | LibreCat-ID: 2185
Scheideler C. 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 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 | 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 | 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
1997 | Dissertation | LibreCat-ID: 19631
Bäumker A. Communication Efficient Parallel Searching. Vol 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19636
Dittrich W. Communication and I/O Efficient Parallel Data Structures. Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19637
Strothmann W-B. Bounded Degree Spanning Trees. Vol 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 19869
Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: 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 W-B, Lukovszki T. Decremental Biconnectivity on Planar Graphs. Paderborn; 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 18575
Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry. ; 1997:39-43.
LibreCat
1997 | Conference Paper | LibreCat-ID: 2175 |
Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 2179 |
Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.
LibreCat
| Files available
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16565
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16568
Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: 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 A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16689
Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: 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 F, Decker T. Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 19958
Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
LibreCat
1996 | Report | LibreCat-ID: 17418
Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17483
Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96). Amsterdam: IOS Press; 1996:13–27.
LibreCat
| Files available
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725
LibreCat
| DOI
1996 | Report | LibreCat-ID: 18352
Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn; 1996.
LibreCat
| Files available
1996 | Dissertation | LibreCat-ID: 2181
Scheideler C. Universal Routing Strategies. University of Paderborn, Germany; 1996.
LibreCat
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1
LibreCat
| DOI
1996 | Conference Paper | LibreCat-ID: 2183 |
Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.
LibreCat
| Files available
1996 | Conference Paper | LibreCat-ID: 2184 |
Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.
LibreCat
| Files available
1996 | Conference Paper | LibreCat-ID: 2186 |
Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.
LibreCat
| Files available
1996 | Journal Article | LibreCat-ID: 16698
Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. Acta Informatica. 1996:621-630. doi:10.1007/bf03036467
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16700
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16701
Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722
LibreCat
| DOI
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0
LibreCat
| DOI
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16
LibreCat
| DOI
1995 | Dissertation | LibreCat-ID: 19623
Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
LibreCat
1995 | Dissertation | LibreCat-ID: 19627
Czumaj A. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
LibreCat
| Files available
1995 | Dissertation | LibreCat-ID: 19630
Wachsmann A. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Vol 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
LibreCat
1995 | Dissertation | LibreCat-ID: 19634
Ameur F. Space-Bounded Learning Algorithms. Vol 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
LibreCat
1995 | Conference Paper | LibreCat-ID: 17482
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating shared memory in real time: On the computation power of reconfigurable meshes. In: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures. ; 1995:46--59.
LibreCat
1995 | Conference Paper | LibreCat-ID: 2187 |
Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154
LibreCat
| Files available
| DOI
1995 | Conference Paper | LibreCat-ID: 2207 |
Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: SPAA. ; 1995:137--146.
LibreCat
| Files available
1995 | Conference Paper | LibreCat-ID: 2208 |
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278.
LibreCat
| Files available
1995 | Journal Article | LibreCat-ID: 16566
Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_133
LibreCat
| DOI
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: 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 A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: 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 F, Westermann M. Hot-potato routing on multi-dimensional tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60618-1_77
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131
LibreCat
| DOI
1994 | Dissertation | LibreCat-ID: 19624
Wanka R. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität Paderborn; 1994.
LibreCat
| Files available
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing. 1994:738-761. doi:10.1137/s0097539791194094
LibreCat
| DOI
1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide F, Monien B, Rosenberg AL, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer; 1993. doi:10.1007/3-540-56731-3
LibreCat
| DOI
1993 | Conference Paper | LibreCat-ID: 17479
Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In: Proc. 3rd PASA Workshop, PARS Mitteilungen. ; 1993:50-55.
LibreCat
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. Information and Computation. 1993:196-217. doi:10.1006/inco.1993.1007
LibreCat
| DOI
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: Automata, Languages and Programming. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56939-1_89
LibreCat
| DOI
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations. In: 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 K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56503-5_46
LibreCat
| DOI
1992 | Journal Article | LibreCat-ID: 18936
Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2. Published online 1992:213-220. doi:10.1142/s0129626492000349
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55488-2_31
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1992. doi:10.1007/3-540-56731-3_3
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: STACS 92. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55210-3_176
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 16736
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: 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 M, Meyer auf der Heide F. Dynamic Hashing in Real Time. In: TEUBNER-TEXTE Zur Informatik. Wiesbaden; 1992. doi:10.1007/978-3-322-95233-2_7
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: Automata, Languages and Programming. Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide F. Dynamic hashing strategies. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029630
LibreCat
| DOI
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: 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, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: 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 F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum. 1990;13(4):231-232.
LibreCat
1989 | Journal Article | LibreCat-ID: 16743
Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division. RAIRO - Theoretical Informatics and Applications. 1989:101-111. doi:10.1051/ita/1989230101011
LibreCat
| DOI
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger M, Meyer auf der Heide F. An optimal parallel dictionary. In: 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 F. On genuinely time bounded computations. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028969
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal parallel computers. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028978
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: STACS 89. Berlin, Heidelberg; 1989. doi:10.1007/bfb0028983
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16763
Babai L, Just B, Meyer auf der Heide F. On the limits of computations with the floor function. Information and Computation. 1988:99-107. doi:10.1016/0890-5401(88)90031-4
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide F. Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM). 1988:740-747. doi:10.1145/44483.44490
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16765
Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science. 1988:57-68. doi:10.1016/0304-3975(88)90018-7
LibreCat
| DOI
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: [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 B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On computations with integer division. In: STACS 88. Berlin, Heidelberg; 1988. doi:10.1007/bfb0035829
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and lower bounds for the dictionary problem. In: SWAT 88. Berlin, Heidelberg; 1988. doi:10.1007/3-540-19487-8_24
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16772
Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing. 1987:97-99. doi:10.1137/0216007
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. SIAM Journal on Computing. 1987:100-107. doi:10.1137/0216008
LibreCat
| DOI
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide F. Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing. 1986:106-119. doi:10.1137/0215008
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16774
Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In: Automata, Languages and Programming. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16761-7_54
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide F. Speeding up random access machines by few processors. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_72
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16776
Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_89
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16779
Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In: 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 FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . . . infinity: lower bounds for parallel computation. In: 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 F. Fast algorithms for n-dimensional restrictions of hard problems. In: 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 F. Nondeterministic versus probabilistic linear search algorithms. In: 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 F. Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control. 1985;67(1-3):195-211. doi:10.1016/S0019-9958(85)80035-8
LibreCat
| DOI
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide F. A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM). 1984:668-676. doi:10.1145/828.322450
LibreCat
| DOI
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide F, Reischuk R. On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In: 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 F. Efficient simulations among several models of parallel computers (extended abstract). In: STACS 84. Berlin, Heidelberg; 1984. doi:10.1007/3-540-12920-0_20
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide F. Efficiency of universal parallel computers. Acta Informatica. 1983:269-296. doi:10.1007/bf00265559
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16807
Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem on random access machines. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide F. Infinite cube-connected cycles. Information Processing Letters. 1983:1-2. doi:10.1016/0020-0190(83)90001-7
LibreCat
| DOI
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: 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 F. Efficiency of universal parallel computers. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1983. doi:10.1007/bfb0036483
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10854-8_29
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10856-4_111
LibreCat
| DOI
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Theoretical Computer Science. 1981:315-322. doi:10.1016/s0304-3975(81)80004-7
LibreCat
| DOI
1980 | Book Chapter | LibreCat-ID: 16815
Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem. In: GI - 10. Jahrestagung. Berlin, Heidelberg; 1980. doi:10.1007/978-3-642-67838-7_34
LibreCat
| DOI
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming ICALP 1979. 1979:411-421. doi:10.1007/3-540-09510-1_32
LibreCat
| DOI