P. Berenbrink, F. Meyer auf der Heide and K. Schröder.
Allocating weighted jobs in parallel. In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures
(SPAA), pages 302-310, June 1997.
[Abstract][Postscript]
P. Berenbrink, F. Meyer auf der Heide, and V. Stemann.
Fault-tolerant shared memory simulations. In Proc. 13th Symposium on Theoretical Aspects of Computer (STACS),
pages 181-192, 1996.
[Abstract][Postscript]
R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking.
Universal algorithms for store-and-forward and wormhole routing. Proc. of the 26th STOC, pages 356-365, 1996.
[Abstract][Postscript]
A. Czumaj, F. Meyer auf der Heide, and V. Stemann.
Contention resolution in hashing based shared memory simulations. Technical report, tr-rsfb-96-005, Paderborn University, 1996.
[Abstract][Postscript]
A. Czumaj, F. Meyer auf der Heide, and V. Stemann.
Simulating shared memory in real time: On the computational power
of reconfigurable architectures. Information and Computation, 137(2): 103-120, September 1997.
A. Czumaj and V. Stemann.
Randomized allocation processes. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science
(FOCS), pages 194-203, 1997.
[Abstract][Postscript]
T. Decker.
Virtual data space - A universal load balancing scheme.
In Proc. of the 4th International Symp. on Solving Irregularly Structured
Problems in Parallel (IRREGULAR), pages 159-166, 1997.
Mapping of coarse-grained applications onto workstation-clusters. In Proc. of the 5th EUROMICRO Workshop on Parallel and Distributed
Processing (PDP), pages 5-12, 1997.
[Abstract][Postscript]
T. Decker, R. Diekmann, P. Klingebiel, and J. Seuss.
Automatische Verteilung von rechenintensiven Anwendungen auf Workstation-Cluster. In Proc. of Workstations und ihre Anwendungen (SIWORK), pages
159-170, 1996.
[Abstract][Postscript]
T. Decker, R. Diekmann, P. Klingebiel and J. Seuss.
The SFB 376 "Massive Parallelism: Algorithms, Design Methods, Applications". In Proc. of the Jahrestagung der Gesellschaft für Informatik
1997.
[Abstract][Postscript]
R. Diekmann, M. Fischer, P. Klingebiel, U. Lefarth, and J. Seuss.
CAMeL/PVM: An open, distributed CAE environment for modelling and
simulating mechatronic systems. In Proc. of the EUROSIM, pages 645-650, 1995.
[Abstract][Postscript]
B. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann.
Exploiting locality in systems of limited bandwidth.
In Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS),
1997.
F. Meyer auf der Heide, K. Schröder, and F. Schwarze.
Routing on networks of optical crossbars. In Proc. of the Euro-Par, pages 299-306, 1996.
F. Meyer auf der Heide and B. Vöcking.
Static and dynamic data management in networks. In Proc. of the Euro-Par, pages 46-56, 1997.
[Abstract][Postsript]
B. Monien, S. Tschöke, and C.-Z. Xu.
Performance evaluation of load distribution strategies in parallel
branch and bound computations. In Proc. of the 8th ACM Symp. on Parallel and Distributed Processing
(SPDP), pages 402-405, 1995.
A. Reinefeld, R. Baraglia, T. Decker, J. Gehring, J. Simon, T. Römke,
F. Ramme, and D. Laforenza.
The MOL project: An open extensible metacomputer. In Proc. of the Heterogenous Computing Workshop (HCW), pages
17-32, 1997.
[Abstract][PDF]
C. Scheideler and B. Vöcking.
Universal continuous routing strategies. In Proc. of the 9th ACM Symp. on Parallel Algorithms and Architectures
(SPAA), pages 142-151, 1996.
[Abstract][Postscript]
Analyzing an infinite parallel job allocation process. In Proc. of the 6th European Symp. on Algorithms (ESA), pages
417-428, 1998.
[Abstract][Postscript]
M. Adler and C. Scheideler.
Efficient communication strategies for ad-hoc wireless networks. In Proc. of the 10th Symp. on Parallel Algorithms and Architectures
(SPAA), pages 259-268, 1998.
P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking.
Balanced allocations: The heavily loaded case. In Proc. of the 32nd ACM Symp. on Theory of Computing (STOC),
2000.
P. Berenbrink, T. Friedetzky, and E. W. Mayr.
Parallel continous randomized load balancing. In Proc. of the 10th Symp. on Parallel Algorithms and Architectures
(SPAA), pages 192-201, 1998.
[Abstract][Postscript]
P. Berenbrink, T. Friedetzky, and A. Steger.
Randomized and adversarial load balancing. In Proc. of the 11th Symp. on Parallel Algorithms and Architectures
(SPAA), pages 175-184, 1999.
[Abstract][Postscript]
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder.
Allocating weighted balls in parallel. Theory of Computing Systems, 32:281-300, 1999.
P. Berenbrink and C. Scheideler.
Locally efficient on-line strategies for routing packets along fixed
paths. In Proc. of the 10th ACM SIAM Symp. on Discrete Algorithms (SODA),
pages 112-121, 1999.
[Postscript]
K. Brockmann and T. Decker.
A parallel tabu search algorithm for short term lot sizing and scheduling
in flexible flow line environments. In Proc. of the 16th International Conference on CAD/CAM, Robotics
and Factories of the Future, pages 843-850, 2000.
[Abstract][Postscript]
R. Butenuth and H.-U. Heiß.
Shared memory programming on PC-based SCI clusters. In Proc. of the SCI Europe, 1998.
[Postscript],
[Slides]
R. Butenuth and H.-U. Heiß.
Interfacing SCI device drivers to linux. In H. Hellwagner and A. Reinefeld, editors, SCI: Scalable Coherent
Interface, volume 1734 of Lecture Notes in Computer Science,
Springer, 1999.
R. Butenuth, H.-U. Heiß, and M. Maier-Stahel.
Monitoring SCI-clusters. In H. Hellwagner and A. Reinefeld, editors, SCI: Scalable Coherent
Interface, volume 1734 of Lecture Notes in Computer Science,
Springer, 1999.
R. Butenuth, H.-U. Heiß, and E. Rehling.
Arminius: Software für Linux-basierte SCI-Cluster. In Proc. of the 2nd Workshop on Cluster Computing, 1999.
R. Butenuth, H.-U. Heiß, and H. Taskin.
SCI for TCP/IP with Linux. In Proc. of the SCI Europe, held as a Conference Stream of EMMSEC
'98, pages 155-158, 1998.
[Slides]
R. Butenuth and H. Taskin.
TCP/IP over SCI under Linux. In H. Hellwagner and A. Reinefeld, editors, SCI: Scalable Coherent
Interface, volume 1734 of Lecture Notes in Computer Science,
Springer, 1999.
A. Czumaj.
Recovery time of dynamic allocation processes. In Proc. of the 10th Symp. on Parallel Algorithms and Architectures
(SPAA), pages 202-211, 1998.
A. Czumaj, F. Meyer auf der Heide, and V. Stemann.
Contention resolution in hashing based shared memory simulations. SIAM Journal on Computing, 29(5):1703-1739, 2000.
T. Decker.
Virtual data space - Load balancing for irregular applications. In Proc. of the Parallel Computing, 2000.
[Abstract][Postscript]
T. Decker and W. Krandick.
Towards a scalable parallel algorithm for polynomial real root isolation. In Proc. of the Workshop Anwendungsbezogene Lastverteilung (ALV'98),
SBF-Bericht Nr. 342/01/98, pages 65-76, TU München, Feb. 1998.
T. Decker and W. Krandick.
Parallel real root isolation using the Descartes method. In Proc. of the 6th International Conference on High Performance
Computing, pages 261-268, 1999.
[Abstract][Postscript]
T. Decker and W. Krandick.
Isoefficiency and the parallel Descartes method. In Proc. of Dagstuhl Seminar "Symbolic Algebraic Methods and Verification
Methods", 2000.
[Abstract][Postscript]
T. Decker, R. Lüling, and S. Tschöke.
A distributed load balancing algorithm for heterogeneous parallel
computing systems. In Proc. of the 1998 Int. Conf. on Parallel and Distributed Processing
Techniques and Applications (PDPTA'98), volume 2, pages 933-940. CSREA
Press, July 1998.
[Abstract][Postscript]
T. Decker, B. Monien and R. Preis.
Towards optimal load balancing topologies. In Proceedings of the 6th EuroPar Conference, A. Bode, T. Ludwig,
W. Karl, and R. Wismüller (eds.), Springer, LNCS 1900, 2000, 277-287.
[Abstract][Postscript]
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M.
Westermann.
Data management in networks: Experimental evaluation of a provably
good strategy. In Proc. of the 11th ACM Symp. on Parallel Algorithms and Architectures
(SPAA), pages 165-174, 1999.
[Abstract][Postscript]
F. Meyer auf der Heide, H. Räcke, and M. Westermann.
Data management in hierarchical bus networks. In Proc. of the 12th ACM Symp. on Parallel Algorithms and Architectures
(SPAA), pages 109-118, 2000.
[Abstract][Postscript]
F. Meyer auf der Heide, B. Vöcking, and M. Westermann.
Provably good and practical strategies for non-uniform data management
in networks. In Proc. of the 7th European Symp. on Algorithms (ESA), pages
89-100, 1999.
[Abstract][Postscript]
F. Meyer auf der Heide, B. Vöcking, and M. Westermann.
Caching in networks. In Proc. of the 11th ACM-SIAM Symp. on Discrete Algorithms (SODA),
pages 430-439, 2000.
[Abstract][Postscript]
C. Scheideler and B. Vöcking.
From static to dynamic routing: Efficient transformations of store-and-forward
protocols. In Proc. of the 31th Symp. on Theory of Computing (STOC), pages
215-224, 1999.
[Abstract][Postscript]
B. Vöcking.
How asymmetry helps load balancing. In Proc. of the 40th IEEE Symp. on Foundations of Computer Science
(FOCS), pages 131-140, 1999.
Y. Azar, E. Cohen, A. Fiat, H. Kaplan and H. Räcke.
Optimal oblivious routing in polynomial time. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pages 383--388, 2003.
[Abstract][Postscript]
M. Bienkowski, M. Korzeniowski and H. Räcke.
A practical algorithm for constructing oblivious routing schemes. In Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003. 24--33.
[Abstract][Postscript]
A. Brinkmann, K. Salzwedel and C. Scheideler.
Compact, adaptive placement schemes for non-uniform distribution requirements. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), August 2002.
[Abstract][Postscript]
T. Fahle and M. Sellmann.
Cost-based filtering for the constrained knapsack problem. Annals of Operations Research, 115:73--93, 2002.
[Abstract][PDF]
T. Fahle, S. Schamberger and M. Sellmann.
Symmetry breaking. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP), pages 93--107, 2001.
[Abstract][Postscript]
C. Haubelt, J. Teich, R. Feldmann and B. Monien.
{SAT}-based techniques in system design. In N. Wehn and D. Verkest, editors, Proceedings of Design, Automation and Test in Europe, pages 1168--1169, Munich, Germany, March 2003. IEEE Computer Society.
[Abstract][PDF]
C. Krick, F. {Meyer auf der Heide}, H. Räcke, B. Vöcking and M. Westermann.
Data management in networks: Experimental evaluation of a provably good strategy. Theory of Computing Systems, 2:217--245, 2002.
[Abstract][Postscript]
C. Krick, H. Räcke and M. Westermann.
Approximation algorithms for data management in networks. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 237--246, 2001.
[Abstract][Postscript]
C. Krick, H. Räcke and M. Westermann.
Approximation algorithms for data management in networks. Theory of Computing Systems, 2003. to appear.
[Abstract][Postscript]
T. Lücking, B. Monien and M. Rode.
On the problem of scheduling flows on distributed networks. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 495--505, 2002.
[Abstract][Postscript]
H. Räcke.
Minimizing congestion in general networks. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 43--52, 2002.
[Abstract][Postscript]
H. Räcke, C. Sohler and M. Westermann.
Online scheduling for sorting buffers. In Proceedings of the 10th European Symposium on Algorithms (ESA), pages 820--832, 2002.
[Abstract][Postscript]
K. Salzwedel.
Algorithmic approaches for storage networks. In Ulrich Meyer, Peter Sanders, and Jop Sibeyn, editors, Algorithms for Memory Hierarchies, volume LNCS 2625 of Lecture Notes in Computer Science, pages 251--272. Springer, 2003.
[Book chapter]
M. Sellmann.
An arc-consistency algorithm for the weighted all different constraint. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP), 2002. 744--749.
N. Sensen.
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. In Proceedings of the 9th European Symposium on Algorithms (ESA), pages 391--403, 2001.
[Abstract][Postscript]
M. Sellmann and T. Fahle.
Coupling variable fixing algorithms for the automatic recording problem. In Proceedings of the 9th European Symposium on Algorithms (ESA), pages 134--145, 2001.
[Abstract][PDF]
M. Sellmann and T. Fahle.
Constraint programming based lagrangian relaxation for the automatic recording problem. Annals of Operations Research, 118:17--33, 2003.
[Abstract][PDF]
M. Sellmann and W. Harvey.
Heuristic constraint propagation. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP), 2002. 738--743.
M. Sellmann, G. Kliewer and A. Koberstein.
Lagrangian cardinality cuts and variable fixing for capacitated network design. In Proceedings of the 10th European Symposium on Algorithms (ESA), 2002. 845--858.
[PDF]
M. Sellmann, N. Sensen and L. Timajev.
Multicommodity flow approximation used for exact graph partitioning. In Proceedings of the 11th European Symposium on Algorithms (ESA), 2003. to appear.
