Mgr. Tomáš Ebenlendr, Ph.D. - curriculum vitae
Personal informations
Born: 16th December 1978
Address: Tetínská 17, Praha 5, Radlice
Phone: 608567574
E-mail: ebik@ucw.cz
Education
Ph.D. study
Years: 2004–2011
Institutes: Institute of Mathematics of Academy of Sciences of CR (MU AV CR)
Institute for Theoretical Computer Science (ITI)
Department: Mathematical Logic, Algebra and Theoretical Computer Science (MLATCS)
Thesis: Combinatorial algorithms for online problems: Semi-online scheduling on related machines
Branch: I4 - Discrete Models and Algorithms
Mgr. study
Years: 1997–2004
Institute: Mathematical-physical Faculty of Charles University (MFF UK)
Department: Department of Applied Mathematics (KAM)
Thesis: Online scheduling on machines with different speeds
Branch: Computer Sciences: Discrete mathematics and optimisation
High school
Years: 1990–1997
Institute: Masaryk Grammar School, Pilsen
Branch: Mathematics / General education / Mathematics - Physics
Research activities
Talks at international conferences
200421st Symp. on Theoretical Aspects of Computer Science (STACS)
2005ALGO, talk at 3rd International Workshop in Approximation and Online Algorithms (WAOA)
2006ALGO, talk at 14th European Symp. on Algorithms (ESA)
2007Workshop on Models and Algorithms for Planning and Scheduling (MAPSP)
2007ALGO, talk at 15th European Symp. on Algorithms (ESA)
2008ALGO, talk at 6rd International Workshop in Approximation and Online Algorithms (WAOA)
2009Workshop on Models and Algorithms for Planning and Scheduling (MAPSP)
20098th Parallel Processing and Applied Mathematics (PPAM)
2011Workshop on Models and Algorithms for Planning and Scheduling (MAPSP)
Publications
  1. Tomáš Ebenlendr and Jiří Sgall. Optimal and online preemptive scheduling on uniformly related machines. In Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS), volume 2996 of Lecture Notes in Comput. Sci., pages 199–210, Springer, 2004.
    Journal version appeared as [8].
  2. Tomáš Ebenlendr, Wojciech Jawor and Jiří Sgall. Preemptive online scheduling: Optimal algorithms for all speeds. In Proc. 14th European Symp. on Algorithms (ESA), volume 4168 of Lecture Notes in Comput. Sci, pages 327–339, Springer, 2006.
    Journal version appeared as [7].
  3. Tomáš Ebenlendr, John Noga, Jiří Sgall and Gerhard Woeginger. A note on semi-online machine covering. In Proc. 3rd International Workshop in Approximation and Online Algorithms, volume 3879 of Lecture Notes in Comput. Sci, pages 110–118, Springer, 2006.
  4. Jihuan Ding, Tomáš Ebenlendr, Jiří Sgall and Guochuan Zhang. Online scheduling of equal-length jobs on parallel machines. In Proc. 15th European Symp. on Algorithms (ESA), volume 4698 of Lecture Notes in Comput. Sci, pages 427–438, Springer, 2007.
  5. Tomáš Ebenlendr, Wojciech Jawor and Jiří Sgall. Optimal preemtive online scheduling for all speeds. In Proc. 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Koc University, 2007.
    Only an abstract, the full version appeared as [7].
  6. Tomáš Ebenlendr, Marek Krčál and Jiří Sgall. Graph balancing: a special case of scheduling unrelated parallel machines. In Proc. 19th Symp. on Discrete Algorithms (SODA), 483–490, ACM/SIAM,, 2008.
    Journal version will appear as [16].
  7. Tomáš Ebenlendr, Wojciech Jawor and Jiří Sgall. Preemptive online scheduling: Optimal algorithms for all speeds. Algorithmica, 53:504–522, 2009.
  8. Tomáš Ebenlendr and Jiří Sgall. Optimal and online preemptive scheduling on uniformly related machines. Journal of Scheduling, 12:517–527, 2009.
  9. Tomáš Ebenlendr and Jiří Sgall. Semi-online preemptive scheduling: One algorithm for all variants. In Proc. 26th Symp. on Theoretical Aspects of Computer Science (STACS), volume 3 of LIPIcs, pages 346–360, Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, Germany, 2009.
    Journal version appeared as [13].
  10. Tomáš Ebenlendr and Jiří Sgall. A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. In Proc. 6th International Workshop in Approximation and Online Algorithms, volume 5426 of Lecture Notes in Comput. Sci, pages 43–52, Springer, 2009.
  11. Tomáš Ebenlendr and Jiří Sgall. Semi-online preemptive scheduling: One algorithm for all variants. In Proc. 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), volume WP 09-11 of CTIT proceedings, pages 61–64, University of Twente, 2009.
    Journal version appeared as [13].
  12. Tomáš Ebenlendr and Jiří Sgall. A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. In Proc. 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), volume WP 09-11 of CTIT proceedings, pages 183–185, University of Twente, 2009.
    Only an abstract, the full version appeared as [10].
  13. Tomáš Ebenlendr and Jiří Sgall. Semi-online preemptive scheduling: One algorithm for all variants. Theory of Computing Systems, 1–37, 2010.
  14. Tomáš Ebenlendr. Semi-online Preemptive Scheduling: Study of Special Cases. In Proc. 8th Parallel Processing and Applied Mathematics, volume 6068 of Lecture Notes in Comput. Sci, pages 11–20, Springer, 2010.
  15. Tomáš Ebenlendr and Jiří Sgall. A lower bound on deterministic online algorithms for scheduling on related machines without preemption. In Proc. 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), volume 2011-525 of ITI Series, pages 82–84, ITI - Charles University, 2011.
    Only an abstract, the full version will appear as [17].
  16. Tomáš Ebenlendr, Marek Krčál and Jiří Sgall. Graph balancing: a special case of scheduling unrelated parallel machines. To appear in Algorithmica, 2012.
  17. Tomáš Ebenlendr and Jiří Sgall. A lower bound on deterministic online algorithms for scheduling on related machines without preemption. To appear in Proc. 9th International Workshop in Approximation and Online Algorithms, volume ? of Lecture Notes in Comput. Sci, Springer, 2012.
Practical experience
Teaching
2003–2007 Supervisor of referrative seminar Linux.
Jobs
2007–2010 Jyxo s r.o., deployment and maintaining software on linux platform.
since 2011 Centrum Holdings s r.o., software developer, language C.