Search results
- 1.0387100 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří
Open problems in throughput scheduling.
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin: Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 2-11. Lecture Notes in Computer Science, 7501. ISBN 978-3-642-33089-6.
[20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012]
R&D Projects: GA AV ČR IAA100190902
Keywords : problem complexity * scheduling
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-33090-2_2
Permanent Link: http://hdl.handle.net/11104/0219398File Download Size Commentary Version Access Sgall1.pdf 1 174.5 KB Publisher’s postprint require - 2.0387099 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří
A new analysis of best fit bin packing.
Fun with Algorithms. Heidelberg: Springer, 2012 - (Kranakis, E.; Krizanc, D.; Luccio, F.), s. 315-321. Lecture Notes in Computer Science, 7288. ISBN 978-3-642-30346-3. ISSN 0302-9743.
[6th International Conference on Fun with Algorithms, FUN 2012. Venice (IT), 04.06.2012-06.06.2012]
R&D Projects: GA AV ČR IAA100190902
Keywords : problem complexity * approximation
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-30347-0_31
Permanent Link: http://hdl.handle.net/11104/0219397 - 3.0386905 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, J.
A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
Approximation and Online Algorithms. Heidelberg: Springer, 2012 - (Solis-Oba, R.; Persiano, G.), s. 102-108. Lecture Notes in Computer Science, 7164. ISBN 978-3-642-29115-9.
[9th International Workshop, WAOA 2011. Saarbrücken (DE), 08.09.2011-09.09.2011]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithm analysis * problem complexity * computer science
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-29116-6_9
Permanent Link: http://hdl.handle.net/11104/0219394File Download Size Commentary Version Access Ebenlendr.pdf 2 168.5 KB Publisher’s postprint require - 4.0385834 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Kjos-Hanssen, B. - Taveneaux, A. - Thapen, Neil
How much randomness is needed for statistics?
How the World Computes. Berlin: Springer, 2012 - (Cooper, S.; Dawar, A.; Löwe, B.), s. 395-404. Lecture Notes in Computer Science, 7318. ISBN 978-3-642-30869-7. ISSN 0302-9743.
[CiE 2012. Turing Centerary Conference and Conference on Computability in Europe /8./. Cambridge (GB), 18.06.2012-23.06.2012]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : algorithm analysis and problem complexity * computing * symbolic and algebraic manipulation
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007/978-3-642-30870-3_40
Permanent Link: http://hdl.handle.net/11104/0007491File Download Size Commentary Version Access Thapen1.pdf 0 195.9 KB Author’s postprint require