![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Tomás Ebenlendr
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
- [j5]Tomás Ebenlendr, Jirí Sgall
:
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption. Theory Comput. Syst. 56(1): 73-81 (2015) - 2014
- [j4]Tomás Ebenlendr, Marek Krcál, Jirí Sgall
:
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. Algorithmica 68(1): 62-80 (2014) - 2011
- [j3]Tomás Ebenlendr, Jirí Sgall
:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. Theory Comput. Syst. 48(3): 577-613 (2011) - 2009
- [j2]Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
:
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. Algorithmica 53(4): 504-522 (2009) - [j1]Tomás Ebenlendr, Jirí Sgall
:
Optimal and online preemptive scheduling on uniformly related machines. J. Sched. 12(5): 517-527 (2009)
Conference and Workshop Papers
- 2011
- [c10]Tomás Ebenlendr, Jirí Sgall
:
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. WAOA 2011: 102-108 - 2009
- [c9]Tomás Ebenlendr:
Semi-online Preemptive Scheduling: Study of Special Cases. PPAM (2) 2009: 11-20 - [c8]Ondrej Zajícek, Jirí Sgall
, Tomás Ebenlendr:
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. PPAM (2) 2009: 52-61 - [c7]Tomás Ebenlendr, Jirí Sgall:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. STACS 2009: 349-360 - 2008
- [c6]Tomás Ebenlendr, Marek Krcál, Jirí Sgall:
Graph balancing: a special case of scheduling unrelated parallel machines. SODA 2008: 483-490 - [c5]Tomás Ebenlendr, Jirí Sgall
:
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. WAOA 2008: 43-52 - 2007
- [c4]Jihuan Ding, Tomás Ebenlendr, Jirí Sgall
, Guochuan Zhang
:
Online Scheduling of Equal-Length Jobs on Parallel Machines. ESA 2007: 427-438 - 2006
- [c3]Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
:
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. ESA 2006: 327-339 - 2005
- [c2]Tomás Ebenlendr, John Noga, Jirí Sgall
, Gerhard J. Woeginger:
A Note on Semi-online Machine Covering. WAOA 2005: 110-118 - 2004
- [c1]Tomás Ebenlendr, Jirí Sgall:
Optimal and Online Preemptive Scheduling on Uniformly Related Machines. STACS 2004: 199-210
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint