The SCEAS System
Navigation Menu

Search the dblp DataBase


Tomás Ebenlendr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
    Preemptive Online Scheduling: Optimal Algorithms for All Speeds. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:327-339 [Conf]
  2. Tomás Ebenlendr, Jiri Sgall
    Optimal and Online Preemptive Scheduling on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:199-210 [Conf]
  3. Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
    A Note on Semi-online Machine Covering. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:110-118 [Conf]
  4. Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, Guochuan Zhang
    Online Scheduling of Equal-Length Jobs on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:427-438 [Conf]

  5. Semi-online Preemptive Scheduling: Study of Special Cases. [Citation Graph (, )][DBLP]

  6. Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. [Citation Graph (, )][DBLP]

  7. Graph balancing: a special case of scheduling unrelated parallel machines. [Citation Graph (, )][DBLP]

  8. Semi-Online Preemptive Scheduling: One Algorithm for All Variants. [Citation Graph (, )][DBLP]

  9. A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. [Citation Graph (, )][DBLP]

  10. Preemptive Online Scheduling: Optimal Algorithms for All Speeds. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002