HEINZ NIXDORF INSTITUTE Paderborn University Theoretical Computer Science AG Meyer auf der Heide

Dr. Brigitte Oesterdiekhoff

Member of the research group:
Theoretical Computer Science: Algorithms, Complexity Theory, Parallel Computing
(1993 - 1998)

EMail: brigitte@upb.de

Publications

• Oesterdiekhoff, Brigitte :
  Periodic comparator networks;
  in TCS: Theoretical Computer Science 245/2 (2000); pp. 175 - 202.
  
  
• Oesterdiekhoff, Brigitte:
  On Periodic Comparator Networks.
  PhD Theses, University of Paderborn, 1998.
  
  
• Kutylowski, M.; Lorys, K.; Oesterdiekhoff, B. :
  
  • Periodic Merging Networks;
    in Proc. 7th ISAAC (1996); pp. 336-345.
  • Full version: Periodic Merging Networks;
    ng> in TOCS: Theory of Computing Systems 31 (1998); pp. 551 - 578
    (TOCS: formerly MST: Mathematical System Theory)
    
  
  
• Oesterdiekhoff, B. :
  On the minimal period of fast periodic sorting networks;
  Technical Report TR-RI-95-167; University of Paderborn; 1995.
  
  
• Kutylowski, M.; Lorys, K.; Oesterdiekhoff, B.; Wanka, R.:
  
  • Fast and Feasible Periodic Sorting Networks of Constant Depth;
    in: Proc. 35th IEEE-FOCS (1994); pp. 369-380.
  • Full version of the first part of this paper:
    Constructing Sorting Networks With Constant Period;
    in: Journal of the ACM (JACM) 45 (2000) pp. 944-967.
    
  
  
• Meyer auf der Heide, F.; Oesterdiekhoff, B.; Wanka, R.:
  Strongly Adaptive Token Distribution;
  in: Proc. 20th International Colloquium on Automata, Languages, and Programming (ICALP) 1993; pp. 398-409.
  Full version appeared in: Algorithmica 15 (1996) 413-427.
  
  
• Oesterdiekhoff, B.:
  Entwurf und Analyse adaptiver Lastbalancierungsverfahren.
  Diploma theses, University of Paderborn, 1992.