Search results
- 1.0447630 - MÚ 2016 RIV DE eng C - Conference Paper (international conference)
Bottesch, R. - Gavinsky, Dmitry - Klauck, H.
Equality, Revisited.
Mathematical Foundations of Computer Science 2015. Berlin: Springer, 2015 - (Italiano, G.; Pighizzini, G.; Sannella, D.), s. 127-138. Lecture Notes in Computer Science, vol. 9235. ISBN 978-3-662-48053-3.
[International Symposium of Mathematical Foundations of Computer Science 2015, MFCS 2015. Milan (IT), 28.08.2015-28.08.2015]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : equality * complexity * algorithm analysis
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007/978-3-662-48054-0_11
Permanent Link: http://hdl.handle.net/11104/0249435File Download Size Commentary Version Access Gavinsky1.pdf 1 222 KB Publisher’s postprint require - 2.0387295 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Epstein, L. - Jeż, Łukasz - Sgall, J. - van Stee, R.
Online scheduling of jobs with fixed start times on related machines.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Berlin: Springer, 2012 - (Gupta, A.; Jansen, K.; Rolim, J.; Servedio, R.), s. 134-145. Lecture Notes in Computer Science, 7408. ISBN 978-3-642-32511-3.
[15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012. Cambridge (US), 15.08.2012-17.08.2012]
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online scheduling * algorithm analysis
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-32512-0_12
Permanent Link: http://hdl.handle.net/11104/0219399 - 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