Tomás Ebenlendr

According to our database, Tomás Ebenlendr authored at least 10 papers between 2004 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2011

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption.

Tomás Ebenlendr, Jirí Sgall

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2009

Semi-Online Preemptive Scheduling: One Algorithm for All Variants.

Tomás Ebenlendr, Jirí Sgall

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput.

Ondrej Zajícek, Jirí Sgall, Tomás Ebenlendr

Proceedings of the Parallel Processing and Applied Mathematics, 2009

Semi-online Preemptive Scheduling: Study of Special Cases.

Tomás Ebenlendr

Proceedings of the Parallel Processing and Applied Mathematics, 2009

2008

A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.

Tomás Ebenlendr, Jirí Sgall

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Graph balancing: a special case of scheduling unrelated parallel machines.

Tomás Ebenlendr, Marek Krcál, Jirí Sgall

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Online Scheduling of Equal-Length Jobs on Parallel Machines.

Jihuan Ding, Tomás Ebenlendr, Jirí Sgall, Guochuan Zhang

Proceedings of the Algorithms, 2007

2006

Preemptive Online Scheduling: Optimal Algorithms for All Speeds.

Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall

Proceedings of the Algorithms, 2006

2005

A Note on Semi-online Machine Covering.

Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004

Optimal and Online Preemptive Scheduling on Uniformly Related Machines.

Tomás Ebenlendr, Jirí Sgall

Proceedings of the STACS 2004, 2004