After a study of computer science and mechanical engineering at University of Paderborn I completed a MS of computer science in 1996.
I subsequently joined a PhD programme (Graduate College supported by German Research Foundation DFG) at Heinz Nixdorf Institute.
Additional, I became a member of the research group Parallel Computing, AG Monien. At that time I was working in the following fields.

Active research interests:

• competitive analysis
  • my personal bibliography is available as bib-file (bz2-ziped), or
  • have a look on the bibliography by Marek Chrobak and John Noga (bib-file)
• online deadline scheduling under resource constraints
  • a compact survey of the notation of the widely used classification/ coding scheme for deterministic scheduling problems is available as a ps.bz2-file.

Main interests:

• parallel algorithms
• graph theory

After completing the PhD, I started a career in industry in 2000.
You may contact me via e-mail to 'barcom' at my domain Marco-Riedel.de
Results of my academic work can be found in the following publications.

Publication List

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstracts include BibTeX references. Postscript files are bz2-ziped.

• Burkhard Monien, Petra Berenbrink, Reinhard Lüling, and Marco Riedel. Online scheduling of continuous media streams. In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential-Theory-Cognition, LNCS 1337, pages 313-320. Springer-Verlag, Berlin-Heidelberg-New York, 1997.
  abstract, postscript, © Springer-Verlag LNCS 1337

• Marco Riedel. Online Request Server Matching. Technical Report tr-ri-98-195, University of Paderborn, Germany, April 1998.
  abstract, postscript

• Marco Riedel. Online Matching for Scheduling Problems. In C. Meinel, and S. Tison, editors, Proceedings of the 16^th Symposium on Theoretical Aspects in Computer Science - STACS '99, (Trier, Germany, March 4-6, 1999) LNCS 1563, pages 571-580. Springer-Verlag, Berlin-Heidelberg-New York, 1999.
  abstract, postscript, © Springer-Verlag LNCS 1563
  full version is: Technical Report tr-ri-98-195, see above

• Petra Berenbrink, Marco Riedel, and Christian Scheideler. Simple Competitive Request Scheduling Strategies. Proceedings of the Eleventh ACM Symposium on Parallel Algorithms and Architectures, (Saint-Malo, France, June 27-30, 1999) pages 33-42. ACM Press, New York, 1999.
  abstract, postscript, © ACM

• Marco Riedel. Online Request Server Matching.
  In Journal of Theoretical Computer Science, 268(1):145-160, October 2001.
  abstract, postscript (preprint), TCS at Elsevier

• PhD Thesis (in German)
  Marco Riedel. Online-Planungsprobleme mit Fristen : Algorithmendesign und Analysen. Paderborn, Universität-GH, Dissertation, 2000. Online-Publikation
  available in PDF format via server of Paderborn University Library, server of "Die Deutsche Bibliothek"

back to home page

last modified Oct. 1^st, 2003 by Marco Riedel