Thomas Erlebach

  Prof. Dr. Thomas Erlebach
  TIK Institute, ETH Zürich
  Gloriastr. 35
  CH-8092 Zürich
  Phone: +(41)-1-632-7050
  FAX: +(41)-1-632-1036
  Email: erlebach@tik.ee.ethz.ch
  WWW: http://www.tik.ee.ethz.ch/~erlebach

Dissertation

• Scheduling Connections in Fast Networks (gzipped ps-file, 582kB)

Research Interests

• call-scheduling, call control and virtual circuit routing in fast networks and all-optical networks
• approximation algorithms for combinatorial optimization problems
• efficient algorithms, graph algorithms
• on-line scheduling of parallel jobs
• parallel algorithms, parallel programming environments

Algorithm Animation

• Student projects on animation of graph algorithms.

Publications on Call-Scheduling (up to 1999)

• Thomas Erlebach and Klaus Jansen
  Scheduling of Virtual Connections in Fast Networks (gzipped ps-file)
  Proceedings of the 4th Parallel Systems and Algorithms Workshop (PASA'96)
  World Scientific Publishing, 1997, pp. 13-32
• Thomas Erlebach and Klaus Jansen
  Call Scheduling in Trees, Rings and Meshes (gzipped ps-file)
  Proceedings of the 30th Hawaii International Conference on System Sciences (HICSS-30), Vol. 1
  IEEE Computer Society Press, 1997, pp. 221-222
• Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, and Pino Persiano
  An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks (gzipped ps-file)
  Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location (April 28-30, 1997)
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 40, American Mathematical Society, 1998, pp. 117-129
• Christos Kaklamanis, Pino Persiano, Thomas Erlebach, and Klaus Jansen
  Constrained Bipartite Edge Coloring with Applications to Wavelength Routing (gzipped ps-file)
  Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97)
  LNCS 1256, Springer Verlag, 1997, pp. 493-504
• Thomas Erlebach and Klaus Jansen
  Off-line and On-line Call-Scheduling in Stars and Trees (gzipped ps-file)
  Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'97)
  LNCS 1335, Springer Verlag, 1997, pp. 199-213
• Thomas Erlebach and Klaus Jansen
  Maximizing the Number of Connections in Optical Tree Networks
  Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC'98)
  LNCS 1533, Springer Verlag, 1998, pp. 179-188.
• Thomas Erlebach and Klaus Jansen
  Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks (gzipped ps-file)
  Proceedings of the 2nd Workshop on Algorithm Engineering (WAE'98)
  Technical Report MPI-I-98-1-019, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 13-24.
• Thomas Erlebach
  Maximum Weight Edge­Disjoint Paths in Bidirected Trees
  Communication and Data Management in Large Networks. Workshop of INFORMATIK'99, 1999, pp. 13-19.
• Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
  Optimal wavelength routing on directed fiber trees
  Theoretical Computer Science (221) 1-2 (1999), pp. 119-137.

Other Publications (up to 1999)

• Thomas Erlebach
  APERITIF - Automatic Parallelization of Divide and Conquer Algorithms
  Diplomarbeit, 1994.
• Stefan Bischof and Thomas Erlebach
  Classification and Survey of Strategies
  In: Thomas Schnekenburger and Georg Stellner (Eds.) Dynamic Load Distribution for Parallel Applications, Teubner-Texte zur Informatik, 1997.
  
• Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, and Thomas Zeugmann
  Efficient Learning of One-Variable Pattern Languages from Positive Data
  Technical Report DOI-TR-128, Department of Informatics, Kyushu University, Dec. 12, 1996
• Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, and Thomas Zeugmann
  Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
  Proceedings of the 8th International Workshop on Algorithmic Learning Theory (ALT'97)
  LNCS 1316, Springer Verlag, 1997, pp. 260-276.
• Stefan Bischof, Ralf Ebner and Thomas Erlebach
  Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
  Proceedings of the 4th International Euro-Par Conference on Parallel Processing (EURO-PAR'98)
  LNCS 1470, Springer-Verlag, 1998, pp. 383-389
• Stefan Bischof, Ralf Ebner and Thomas Erlebach
  Parallel Load Balancing for Problems with Good Bisectors
  Proceedings of the 13th Merged International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP'99), IEEE, 1999, pp. 531-538.
• Ralf Ebner, Thomas Erlebach, Claudia Gold, Clemens Harlfinger, Roland Wismüller:
  A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing
  PASA'99 - 5. Workshop Parallele Systeme und Algorithmen, in W. Erhard et al. (Hrsg.): Workshops zur Architektur von Rechensystemen. Berichte zur Rechnerarchitektur, Universität Jena, 1999, pp. 155-162.

I have a Personal Homepage, too!