792 Publications
2002 | Journal Article | LibreCat-ID: 18853
Abstract Combinatorial Programs and Efficient Property Testers
C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92.
LibreCat
C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92.
2002 | Report | LibreCat-ID: 18961
A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing
T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.
LibreCat
T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.
2002 | Dissertation | LibreCat-ID: 18169
Zur Berechenbarkeit reeller geometrischer Probleme
M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
LibreCat
| Files available
M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
2002 | Journal Article | LibreCat-ID: 18176
Computability on Regular Subsets of Euclidean Space
M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.
LibreCat
| DOI
M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.
2002 | Conference Paper | LibreCat-ID: 18177
Point Location Algorithms of Minimum Size
M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
LibreCat
M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
2002 | Conference Paper | LibreCat-ID: 18179
Computability of Linear Equations
V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.
LibreCat
| DOI
V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.
2002 | Conference Paper | LibreCat-ID: 18369
Bi-directional Coupling of Simulation Tools with a Walkthrough-System
B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.
LibreCat
B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.
2002 | Conference Paper | LibreCat-ID: 18566
Randomized Pursuit-Evasion in Graphs
M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.
LibreCat
| DOI
M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.
2002 | Journal Article | LibreCat-ID: 16489
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.
LibreCat
| DOI
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.
2002 | Conference Paper | LibreCat-ID: 16490
The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments
J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002.
LibreCat
| DOI
J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002.
2002 | Conference Paper | LibreCat-ID: 16491
Energy, congestion and dilation in radio networks
F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02, 2002.
LibreCat
| DOI
F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02, 2002.
2002 | Book Chapter | LibreCat-ID: 16723
Mobile Computing, Mobile Networks
F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.
LibreCat
| DOI
F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.
2001 | Dissertation | LibreCat-ID: 19622
Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing
K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
LibreCat
| Files available
K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
2001 | Conference Paper | LibreCat-ID: 19797
Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)
K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA 2001, 2001, pp. 463–470.
LibreCat
K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA 2001, 2001, pp. 463–470.
2001 | Journal Article | LibreCat-ID: 2139
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
LibreCat
| DOI
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
2001 | Conference Paper | LibreCat-ID: 2141 | 
SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat
| Files available
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.
2001 | Journal Article | LibreCat-ID: 18749
Testing Hypergraph Coloring
A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.
LibreCat
| DOI
A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.
2001 | Conference Paper | LibreCat-ID: 18750
Soft Kinetic Data Structures
C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
LibreCat
C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
2001 | Journal Article | LibreCat-ID: 18857
Property Testing with Geometric Queries
C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277.
LibreCat
| DOI
C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277.
2001 | Conference Paper | LibreCat-ID: 18964
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.
LibreCat
| DOI
T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.
2001 | Journal Article | LibreCat-ID: 23731
Factoring a binary polynomial of degree over one million
O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.
LibreCat
| DOI
O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.
2001 | Conference Paper | LibreCat-ID: 18152
A Computable Spectral Theorem
M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.
LibreCat
| DOI
M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.
2001 | Conference Paper | LibreCat-ID: 18166
New Bounds for Hypercube Slicing Numbers
M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, pp. 155–164.
LibreCat
M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, pp. 155–164.
2001 | Conference Paper | LibreCat-ID: 18168
Turing Computability of (Non-)Linear Optimization
V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.
LibreCat
V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.
2001 | Conference Paper | LibreCat-ID: 18370
Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph
J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.
LibreCat
| Files available
J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.
2001 | Conference Paper | LibreCat-ID: 16492
The randomized z-buffer algorithm
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01, 2001.
LibreCat
| DOI
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01, 2001.
2001 | Book Chapter | LibreCat-ID: 16493
Data Management in Networks
F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.
LibreCat
| DOI
F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.
2001 | Book Chapter | LibreCat-ID: 16494
Parallel Bridging Models and Their Impact on Algorithm Design
F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat
| DOI
F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
2001 | Book (Editor) | LibreCat-ID: 16722
Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.
LibreCat
| DOI
F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.
2000 | Dissertation | LibreCat-ID: 19620
Communication in Parallel Systems-Models, Algorithms and Implementations
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
2000 | Dissertation | LibreCat-ID: 19621
Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
| Files available
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
2000 | Report | LibreCat-ID: 19733
PUB-Library, Release 7.0, User Guide and Function Reference
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.
LibreCat
| Files available
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.
2000 | Habilitation | LibreCat-ID: 19784
Probabilistic Methods for Coordination Problems
C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.
LibreCat
C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.
2000 | Conference Paper | LibreCat-ID: 19849
Tradeoff analysis and architecture design of a hybrid hardware/software sorter
M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.
LibreCat
| DOI
M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.
2000 | Journal Article | LibreCat-ID: 2143
Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat
| DOI
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
2000 | Journal Article | LibreCat-ID: 2145
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
LibreCat
| DOI
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
2000 | Conference Paper | LibreCat-ID: 2146 |
Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat
| Files available
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
2000 | Conference Paper | LibreCat-ID: 2147 |
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
2000 | Journal Article | LibreCat-ID: 2148
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
LibreCat
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
2000 | Conference Paper | LibreCat-ID: 2149 |
Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
LibreCat
| Files available
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
2000 | Conference Paper | LibreCat-ID: 2150 |
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
2000 | Report | LibreCat-ID: 17865
Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes
M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.
LibreCat
| Files available
M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.
2000 | Conference Paper | LibreCat-ID: 18962
I/O-Efficient Well-Separated Pair Decomposition and Applications
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
LibreCat
| DOI
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
2000 | Conference Paper | LibreCat-ID: 17990
Property Testing in Computational Geometry
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.
LibreCat
| DOI
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.
2000 | Conference Paper | LibreCat-ID: 18146
Computing the Dimension of Linear Subspaces
M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.
LibreCat
| DOI
M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.
2000 | Conference Paper | LibreCat-ID: 18150
Computing Cut Numbers
M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
2000 | Journal Article | LibreCat-ID: 18446
Periodification Scheme: Constructing Sorting Networks with Constant Period
K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.
LibreCat
| DOI
K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.
2000 | Conference Paper | LibreCat-ID: 2211 |
A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
2000 | Conference Paper | LibreCat-ID: 16495
Data management in hierarchical bus networks
F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00, 2000.
LibreCat
| DOI
F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00, 2000.
2000 | Conference Paper | LibreCat-ID: 16496
Caching in networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.
LibreCat
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.
2000 | Book Chapter | LibreCat-ID: 16497
Complexity Theory and Algorithms
F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat
| DOI
F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
2000 | Journal Article | LibreCat-ID: 17010
Contention Resolution in Hashing Based Shared Memory Simulations
A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.
LibreCat
| DOI
A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.
2000 | Journal Article | LibreCat-ID: 16345
Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik
F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.
LibreCat
| Files available
F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.
1999 | Conference Paper | LibreCat-ID: 19732
The Paderborn university BSP (PUB) library-design, implementation and performance
O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.
LibreCat
| DOI
O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.
1999 | Journal Article | LibreCat-ID: 2151
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat
| DOI
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
1999 | Conference Paper | LibreCat-ID: 2164 |
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
LibreCat
| Files available
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.
1999 | Conference Paper | LibreCat-ID: 2165 |
Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
LibreCat
| Files available
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.
1999 | Conference Paper | LibreCat-ID: 17864
Partitioned neighborhood spanners of minimal outdegree
M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.
LibreCat
| Files available
M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.
1999 | Conference Paper | LibreCat-ID: 18747
Fast Reconstruction of Delaunay Triangulations
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.
LibreCat
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.
1999 | Dissertation | LibreCat-ID: 18942
New Results on Geometric Spanners and Their Applications
T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat
| Files available
T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
1999 | Conference Paper | LibreCat-ID: 18959
New Results on Fault Tolerant Geometric Spanners
T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat
| DOI
T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
1999 | Conference Paper | LibreCat-ID: 18965
Data management in networks: experimental evaluation of a provably good strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–174.
LibreCat
| DOI
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–174.
1999 | Conference Paper | LibreCat-ID: 18576
Generating Random Star-Shaped Polygons
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
LibreCat
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
1999 | Conference Paper | LibreCat-ID: 2210 |
Design of the PRESTO Multimedia Storage Network (Extended Abstract)
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat
| Files available
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
1999 | Conference Paper | LibreCat-ID: 2166 |
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat
| Files available
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
1999 | Journal Article | LibreCat-ID: 16501
Shortest-Path Routing in Arbitrary Networks
F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
LibreCat
| DOI
F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
1999 | Journal Article | LibreCat-ID: 16502
Allocating Weighted Jobs in Parallel
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.
LibreCat
| DOI
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.
1999 | Book Chapter | LibreCat-ID: 17052
International Workshop on Communication and Data Management in Large Networks
E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.
LibreCat
| DOI
E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.
1999 | Book Chapter | LibreCat-ID: 17053
Provably Good and Practical Strategies for Non-uniform Data Management in Networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat
| DOI
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
1998 | Dissertation | LibreCat-ID: 19639
Static and Dynamic Data Management in Networks
B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat
| Files available
B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
1998 | Report | LibreCat-ID: 19735
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.
LibreCat
| Files available
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.
1998 | Book Chapter | LibreCat-ID: 17412
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat
| Files available
| DOI
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
1998 | Conference Paper | LibreCat-ID: 17863
A Network Based Approach for Realtime Walkthrough of Massive Models
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.
LibreCat
| Files available
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.
1998 | Report | LibreCat-ID: 18145
Multimediale Entdeckungsreisen unserer Welt mit dem Internet
M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat
M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
1998 | Dissertation | LibreCat-ID: 18445
On Periodic Comparator Networks
B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.
LibreCat
B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.
1998 | Journal Article | LibreCat-ID: 2168
Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
LibreCat
| DOI
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
1998 | Conference Paper | LibreCat-ID: 2169 |
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
LibreCat
| Files available
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.
1998 | Conference Paper | LibreCat-ID: 2170 |
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
LibreCat
| Files available
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.
1998 | Book | LibreCat-ID: 2185
Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat
| DOI
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
1998 | Journal Article | LibreCat-ID: 16503
Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
LibreCat
| DOI
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
1998 | Journal Article | LibreCat-ID: 16504
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
LibreCat
| DOI
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
1998 | Book Chapter | LibreCat-ID: 16562
Communication-efficient parallel multiway and approximate minimum cut computation
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat
| DOI
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
1998 | Conference Paper | LibreCat-ID: 16563
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998.
LibreCat
| DOI
R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998.
1997 | Dissertation | LibreCat-ID: 19631
Communication Efficient Parallel Searching
A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
1997 | Dissertation | LibreCat-ID: 19636
Communication and I/O Efficient Parallel Data Structures
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
1997 | Dissertation | LibreCat-ID: 19637
Bounded Degree Spanning Trees
W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
| Files available
W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
1997 | Conference Paper | LibreCat-ID: 19869
Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat
| DOI
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
1997 | Report | LibreCat-ID: 18955
Decremental Biconnectivity on Planar Graphs
W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.
LibreCat
| Files available
W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.
1997 | Conference Paper | LibreCat-ID: 18575
Encoding a Triangulation as a Permutation of its Point Set
C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
1997 | Conference Paper | LibreCat-ID: 2175 |
Optimal Wormhole Routing in the (n, d)-Torus
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat
| Files available
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
1997 | Conference Paper | LibreCat-ID: 2179 |
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
LibreCat
| Files available
M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.
1997 | Journal Article | LibreCat-ID: 16564
A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.
LibreCat
| DOI
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.
1997 | Journal Article | LibreCat-ID: 16565
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.
LibreCat
| DOI
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.
1997 | Journal Article | LibreCat-ID: 16567
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.
LibreCat
| DOI
F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.
1997 | Conference Paper | LibreCat-ID: 16568
Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
LibreCat
| DOI
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
1997 | Book Chapter | LibreCat-ID: 16569
Static and dynamic data management in networks
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat
| DOI
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
1997 | Conference Paper | LibreCat-ID: 16604
Allocating weighted jobs in parallel
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997.
LibreCat
| DOI
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997.
1997 | Book Chapter | LibreCat-ID: 16605
Communication efficient parallel searching
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat
| DOI
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
1997 | Book Chapter | LibreCat-ID: 16687
Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat
| DOI
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
1997 | Conference Paper | LibreCat-ID: 16689
Exploiting locality for data management in systems of limited bandwidth
B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.
LibreCat
| DOI
B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.
1997 | Book Chapter | LibreCat-ID: 16693
Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”
F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.
LibreCat
| DOI
F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.
1996 | Journal Article | LibreCat-ID: 19958
Routing on Networks of Optical Crossbars (Extended Abstract).
F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.
LibreCat
F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.
1996 | Report | LibreCat-ID: 17418
Contention Resolution in Hashing Based Shared Memory Simulations
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.
LibreCat
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.
1996 | Conference Paper | LibreCat-ID: 17419
A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.
LibreCat
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.
1996 | Conference Paper | LibreCat-ID: 17483
A Realistic Cost Model for the Communication Time in Parallel Programs
M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.
LibreCat
| Files available
M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.
1996 | Book Chapter | LibreCat-ID: 17564
Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
LibreCat
| DOI
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
1996 | Report | LibreCat-ID: 18352
A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware
M. Fischer, J. Rethmann, A. Wachsmann, 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
M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996.
1996 | Dissertation | LibreCat-ID: 2181
Universal routing strategies
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
LibreCat
C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.
1996 | Journal Article | LibreCat-ID: 2182
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
LibreCat
| DOI
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
1996 | Conference Paper | LibreCat-ID: 2183 |
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
1996 | Conference Paper | LibreCat-ID: 2184 |
Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
1996 | Conference Paper | LibreCat-ID: 2186 |
Universal Algorithms for Store-and-Forward and Wormhole Routing
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
LibreCat
| Files available
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
1996 | Journal Article | LibreCat-ID: 16698
Trial and error. A new approach to space-bounded learning
F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.
LibreCat
| DOI
F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.
1996 | Journal Article | LibreCat-ID: 16699
Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.
LibreCat
| DOI
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.
1996 | Journal Article | LibreCat-ID: 16700
Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
LibreCat
| DOI
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
1996 | Journal Article | LibreCat-ID: 16701
The Tree Model for Hashing: Lower and Upper Bounds
J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.
LibreCat
| DOI
J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.
1996 | Book (Editor) | LibreCat-ID: 16702
Automata, Languages and Programming, 23rd International Colloquium, ICALP96
F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
LibreCat
| DOI
F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
1996 | Book Chapter | LibreCat-ID: 16703
Fault-tolerant shared memory simulations
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
LibreCat
| DOI
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
1995 | Dissertation | LibreCat-ID: 19623
Contention Resolution in Hashing Based Shared Memory Simulations
V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Dissertation | LibreCat-ID: 19627
Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations
A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
| Files available
A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Dissertation | LibreCat-ID: 19630
Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher
A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Dissertation | LibreCat-ID: 19634
Space-Bounded Learning Algorithms
F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
1995 | Conference Paper | LibreCat-ID: 17482
Simulating shared memory in real time: On the computation power of reconfigurable meshes
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
1995 | Conference Paper | LibreCat-ID: 2187 |
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
LibreCat
| Files available
| DOI
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
1995 | Conference Paper | LibreCat-ID: 2207 |
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
1995 | Conference Paper | LibreCat-ID: 2208 |
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
LibreCat
| Files available
F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.
1995 | Journal Article | LibreCat-ID: 16566
Transforming comparison model lower bounds to the parallel-random-access-machine
D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.
LibreCat
| DOI
D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.
1995 | Book Chapter | LibreCat-ID: 16704
A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
LibreCat
| DOI
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
1995 | Book Chapter | LibreCat-ID: 16705
Shared memory simulations with triple-logarithmic delay
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat
| DOI
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
1995 | Conference Paper | LibreCat-ID: 16706
Optimal trade-offs between size and slowdown for universal parallel networks
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.
LibreCat
| DOI
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.
1995 | Conference Paper | LibreCat-ID: 16707
Improved optimal shared memory simulations, and the power of reconfiguration
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.
LibreCat
| DOI
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.
1995 | Book Chapter | LibreCat-ID: 16717
Hot-potato routing on multi-dimensional tori
F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
LibreCat
| DOI
F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
1995 | Book Chapter | LibreCat-ID: 16874
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat
| DOI
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
1994 | Dissertation | LibreCat-ID: 19624
Paralleles Sortieren auf mehrdimensionalen Gittern
R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität Paderborn, 1994.
LibreCat
| Files available
R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität Paderborn, 1994.
1994 | Journal Article | LibreCat-ID: 16728
Dynamic Perfect Hashing: Upper and Lower Bounds
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.
LibreCat
| DOI
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.
1993 | Book (Editor) | LibreCat-ID: 17477
Parallel Architectures and Their Efficient Use
F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.
LibreCat
| DOI
F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.
1993 | Conference Paper | LibreCat-ID: 17479
OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)
U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat
U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
1993 | Journal Article | LibreCat-ID: 16729
An Optimal Parallel Dictionary
M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217.
1993 | Book Chapter | LibreCat-ID: 16730
Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat
| DOI
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.
1993 | Conference Paper | LibreCat-ID: 16731
Simple, efficient shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993.
1993 | Book Chapter | LibreCat-ID: 16732
Capabilities and complexity of computations with integer division
K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat
| DOI
K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
1992 | Journal Article | LibreCat-ID: 18936
Periodic Sorting on Two-Dimensional Meshes
M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.
LibreCat
| DOI
M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.
1992 | Book Chapter | LibreCat-ID: 16733
High performance universal hashing, with applications to shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.
1992 | Book Chapter | LibreCat-ID: 16734
Hashing strategies for simulating shared memory on distributed memory machines
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat
| DOI
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
1992 | Book Chapter | LibreCat-ID: 16735
On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat
| DOI
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
1992 | Conference Paper | LibreCat-ID: 16736
Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992.
LibreCat
| DOI
R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992.
1992 | Book Chapter | LibreCat-ID: 16737
Dynamic Hashing in Real Time
M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.
1990 | Book Chapter | LibreCat-ID: 3050
Approximation of convex polygons
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
LibreCat
| DOI
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
1990 | Book Chapter | LibreCat-ID: 16738
A new universal class of hash functions and dynamic hashing in real time
M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.
1990 | Book Chapter | LibreCat-ID: 16739
Dynamic hashing strategies
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat
| DOI
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
1990 | Book Chapter | LibreCat-ID: 16740
On the complexity of genuinely polynomial computation
M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat
| DOI
M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
1990 | Conference Paper | LibreCat-ID: 16741
How to distribute a dictionary in a complete network
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.
1990 | Conference Paper | LibreCat-ID: 16742
Not all keys can be hashed in constant time
J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.
LibreCat
| DOI
J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.
1990 | Journal Article | LibreCat-ID: 16824
Das Heinz Nixdorf-Institut der Universität-GH Paderborn
F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232.
LibreCat
F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232.
1989 | Journal Article | LibreCat-ID: 16743
On computations with integer division
B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.
LibreCat
| DOI
B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.
1989 | Conference Paper | LibreCat-ID: 16744
An optimal parallel dictionary
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89, 1989.
LibreCat
| DOI
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89, 1989.
1989 | Book Chapter | LibreCat-ID: 16745
On genuinely time bounded computations
F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat
| DOI
F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.
1989 | Book Chapter | LibreCat-ID: 16746
Time-optimal simulations of networks by universal parallel computers
F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat
| DOI
F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.
1989 | Book Chapter | LibreCat-ID: 16789
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat
| DOI
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
1988 | Journal Article | LibreCat-ID: 16763
On the limits of computations with the floor function
L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.
LibreCat
| DOI
L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.
1988 | Journal Article | LibreCat-ID: 16764
Fast algorithms for N-dimensional restrictions of hard problems
F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.
LibreCat
| DOI
F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.
1988 | Journal Article | LibreCat-ID: 16765
A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.
LibreCat
| DOI
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.
1988 | Conference Paper | LibreCat-ID: 16766
Dynamic perfect hashing: upper and lower bounds
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
LibreCat
| DOI
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
1988 | Book Chapter | LibreCat-ID: 16767
On computations with integer division
B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.
LibreCat
| DOI
B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.
1988 | Book Chapter | LibreCat-ID: 16768
Upper and lower bounds for the dictionary problem
M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.
LibreCat
| DOI
M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.
1987 | Journal Article | LibreCat-ID: 16772
A Time-Space Tradeoff for Element Distinctness
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 97–99.
LibreCat
| DOI
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 97–99.
1987 | Journal Article | LibreCat-ID: 16773
The Complexity of Parallel Sorting
F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.
LibreCat
| DOI
F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.
1986 | Journal Article | LibreCat-ID: 16771
Efficient Simulations among Several Models of Parallel Computers
F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119.
LibreCat
| DOI
F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119.
1986 | Book Chapter | LibreCat-ID: 16774
A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.
LibreCat
| DOI
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.
1986 | Book Chapter | LibreCat-ID: 16775
Speeding up random access machines by few processors
F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat
| DOI
F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.
1986 | Book Chapter | LibreCat-ID: 16776
A time-space tradeoff for element distinctness
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat
| DOI
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.
1985 | Journal Article | LibreCat-ID: 16779
Lower time bounds for integer programming with two variables
C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105.
LibreCat
| DOI
C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105.
1985 | Journal Article | LibreCat-ID: 16780
Lower bounds for solving linear diophantine equations on random access machines
F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.
LibreCat
| DOI
F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.
1985 | Journal Article | LibreCat-ID: 16781
Simulating probabilistic by deterministic algebraic computation trees
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
LibreCat
| DOI
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
1985 | Conference Paper | LibreCat-ID: 16782
The complexity of parallel sorting
F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.
LibreCat
| DOI
F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.
1985 | Conference Paper | LibreCat-ID: 16783
One, two, three . . . infinity: lower bounds for parallel computation
F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.
LibreCat
| DOI
F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.
1985 | Conference Paper | LibreCat-ID: 16784
Fast algorithms for n-dimensional restrictions of hard problems
F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.
LibreCat
| DOI
F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.
1985 | Conference Paper | LibreCat-ID: 16788
Nondeterministic versus probabilistic linear search algorithms
F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.
LibreCat
| DOI
F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.
1985 | Journal Article | LibreCat-ID: 16823
Lower time bounds for solving linear diophantine equations on several parallel computational models
F. Meyer auf der Heide, Information and Control 67 (1985) 195–211.
LibreCat
| DOI
F. Meyer auf der Heide, Information and Control 67 (1985) 195–211.
1984 | Journal Article | LibreCat-ID: 16785
A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem
F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.
LibreCat
| DOI
F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.
1984 | Conference Paper | LibreCat-ID: 16786
On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication
F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984.
LibreCat
| DOI
F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984.
1984 | Book Chapter | LibreCat-ID: 16787
Efficient simulations among several models of parallel computers (extended abstract)
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.
LibreCat
| DOI
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.
1983 | Journal Article | LibreCat-ID: 16806
Efficiency of universal parallel computers
F. Meyer auf der Heide, Acta Informatica (1983) 269–296.
LibreCat
| DOI
F. Meyer auf der Heide, Acta Informatica (1983) 269–296.
1983 | Journal Article | LibreCat-ID: 16807
A lower time bound for the knapsack problem on random access machines
P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.
LibreCat
| DOI
P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.
1983 | Journal Article | LibreCat-ID: 16808
Infinite cube-connected cycles
F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
LibreCat
| DOI
F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
1983 | Conference Paper | LibreCat-ID: 16809
A polynomial linear search algorithm for the n-dimensional knapsack problem
F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983.
LibreCat
| DOI
F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983.
1983 | Book Chapter | LibreCat-ID: 16810
Efficiency of universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.
LibreCat
| DOI
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.
1981 | Book Chapter | LibreCat-ID: 16813
Random access machines and straight-line programs
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat
| DOI
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
1981 | Book Chapter | LibreCat-ID: 16814
Time-processor trade-offs for universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat
| DOI
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
1981 | Journal Article | LibreCat-ID: 16820
A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
LibreCat
| DOI
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
1980 | Book Chapter | LibreCat-ID: 16815
Untere Zeitschranken für das Rucksack-Problem
P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
LibreCat
| DOI
P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
1979 | Journal Article | LibreCat-ID: 16812
A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979) 411–421.
LibreCat
| DOI
F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979) 411–421.