Tomás Ebenlendr

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

Collaborative distances:

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

2015

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

Tomás Ebenlendr, Jirí Sgall

Theory Comput. Syst., 2015

2014

Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines.

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

Algorithmica, 2014

2011

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

Tomás Ebenlendr, Jirí Sgall

Theory Comput. Syst., 2011

2009

Optimal and online preemptive scheduling on uniformly related machines.

Tomás Ebenlendr, Jirí Sgall

J. Sched., 2009

Preemptive Online Scheduling: Optimal Algorithms for All Speeds.

Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall

Algorithmica, 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

2007

Online Scheduling of Equal-Length Jobs on Parallel Machines.

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

Proceedings of the Algorithms, 2007

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