[2004] [2003] [2002] [2001] [2000] 1999 [1998] [1997] [1996] [1995] [1994] [1993] [1992]

• Matthias Fischer, Tamás Lukovszki, Martin Ziegler
  Partitioned Neighborhood Spanners of Minimal Outdegree
  In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), pages 47-50, 1999;
  • Abstract
  • Paper  (full version):     Compressed Postscript     PDF
  • Paper (extended abtract):     Compresed Postscript     PDF


• Christian Sohler
  Fast Reconstruction of Delaunay Triangulations
  In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), pages 136-141, 1999

Compressed Postscript


• Ulrich Rehberg, Klaus Schröder
  Almost Optimal Schedules with a Simple Protocol
  In: ARCS99, Architektur von Rechen-Systemen 1999, pages 219-228



• Christian Sohler
  Generating Random Star-Shaped Polygons
  In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), pages 174-177, 1999

Compressed Postscript


• Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann.
  Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
  In: Proc. of the 11th ACM SPAA (Saint-Malo), pp. 165-174, 1999.
  Abstract or compressed postscript.



• Berenbrink, P.; Scheideler, C.:
  Locally Efficient On-Line Strategies for Routing Packets along Fixed Paths (Extended Abstract)
  In: Proc. 10th ACM-SIAM Symposium on Discrete ALgorithms (SODA); pp. 112-121; 1999.
  compressed postscript
  


• Scheideler, C.; Vöcking, B.:
  From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols (Full Version)
  Extended Abstract appeared in: Proc. 31 ACM Symposium on Theory of Computing (STOC), pp. 215-224, 1999.
  compressed postscript
  


• Berenbrink, P.; Riedel, M.; Scheideler, C.:
  Simple Competitive Request Scheduling Strategies (Extended Abstract)
  In: Proc. 11 ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1999.
  compressed Postscript
  


• Berenbrink, P.; Brinkmann, A.; Scheideler, C.:
  Design of the PRESTO Multimedia Storage Network (Extended Abstract)
  In: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999.
  compressed postscript
  


• Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann.
  Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.
  In: Proc. of the 7th ESA (Prague), pp. 89-100, 1999.
  Abstract or compressed postscript.
  


• P. Berenbrink, F. Meyer auf der Heide, K. Schröder.
  Allocating Weighted Jobs in Parallel.
  In Theory of Computing Systems, 32:281-300, 1999.
  


• O. Bonorden, B. Juurlink, I. von Otte, I. Rieping
  The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
  in Proc. of 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP), San Juan, Puerto Rico, April 12 - April 16, 1999
  Abstract, compressed postscript.
  


• O. Bonorden, N. Hüppelshäuser, B. Juurlink, I. Rieping
  PUB-Library, Release 6.0, January 1999, User Guide and Function Reference
  compressed Postscript or HTML-Documentation.
  


• Tamás Lukovszki
  New Results on Geometric Spanners and Their Applications
  PhD Thesis, University of Paderborn, June 1999.
  


• Tamás Lukovszki
  New Results on Fault Tolerant Geometric Spanners
  In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS, Springer Verlag, pages 193-204, 1999;
  Abstract or compressed postscript
  ©Springer Verlag
  


• S. Vempala and B. Vöcking.
  Approximating Multicast Congestion.
  To Appear: Proc. 10th ISAAC (Chennai, India, 1999).
  Abstract or compressed postsript.
  


• M. Mitzenmacher and B. Vöcking.
  The Asymptotics of Selecting the Shortest of Two, Improved.
  In: Proc. 37th Allerton Conf. on Communication, Control, and Computing (Urbana, Illinoi 1999).
  Full version: Technical Report, Harvard University, TR-08-99.
  Abstract or compressed postsript or compressed postsript (full version).
  


• B. Vöcking.
  How Asymmetry Helps Load Balancing.
  In: Proc. 40th FOCS (New York, 1999); pp. 131-140.
  Abstract or compressed postsript.
  


• Friedhelm Meyer auf der Heide and Berthold Vöcking.
  Shortest-Path Routing in Arbitrary Networks.
  Journal of Algorithms, Vol. 31, No. 1, pp.105-131, 1999.
  Abstract or compressed postsript.
  


• M. Crochemore, A. Czumaj, L. Gasieniec, T. Lecroq, W. Plandowski, and W. Rytter
  Fast Practical Multi-Pattern Matching
  Information Processing Letters, Vol. 71, No. 3-4, pages 107-113, August 27, 1999.
  


• A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons, P. Leng, W. Rytter and M. Zito
  Efficient Web Searching Using Temporal Factors
  Proceedings of the 6th Workshop on Algorithms and Data Structures (WADS), pages 294-305, Vancouver, Canada, August 11 - August 14, 1999, volume 1663 of Lecture Notes in Computer Science edited by F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia, Springer-Verlag, Berlin.
  


• B. S. Chlebus, A. Czumaj, L. Gasieniec, M. Kowaluk, and W. Plandowski
  Algorithms for the Parallel Alternating Direction Access Machine
  Abstract
  To appear in Theoretical Computer Science, February 1999.
  


• A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys
  Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes ©
  Abstract or compressed postscript
  


• A. Czumaj and A. Lingas
  On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem ©
  Abstract or compressed postscript