Search results
- 1.0334971 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, Jiří
A lower bound for scheduling of unit jobs with immediate decision on parallel machines.
[Dolní odhad pro rozhodování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.]
Approximation and online algorithms. Berlin: Springer, 2009 - (Bampis, E.; Skutella, M.), s. 43-52. Lecture notes in computer science, 5426. ISBN 978-3-540-93979-5.
[6th International Workshop on Approximation and Online Algorithms. Karlsruhe (DE), 18.09.2008-19.09.2008]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0179571File Download Size Commentary Version Access Sgall.pdf 1 2.1 MB Author’s postprint open-access - 2.0334967 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, Jiří
Semi-online preemptive scheduling: one algorithm for all variants.
[Semi-online preemptivní rozvrhování: jeden algoritmus pro všechny varianty.]
26th International Symposium on Theoretical Aspects of Computer Science. Leibniz: Schloss Dagstuhl, 2009 - (Albers, S.; Marion, J.), s. 349-360. ISBN 978-3-939897-09-5.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg (DE), 26.02.2009-28.02.2009]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0179568File Download Size Commentary Version Access Ebenlendr2.pdf 1 253.6 KB Author’s postprint require - 3.0318586 - MÚ 2009 RIV US eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Krčál, Marek - Sgall, Jiří
Graph balancing: A special case of scheduling unrelated parallel machines.
[Vyvažování grafů: Speciální případ rozvrhování nezávislých paralelních počítačů.]
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. San Francisco: ACM-SIAM, 2008, s. 483-490. ISBN 978-0-89871-647-4.
[Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)/10./. San Francisco (US), 20.01.2008-22.01.2008]
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : graph * graph balancing * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0167959 - 4.0096096 - MÚ 2008 RIV DE eng C - Conference Paper (international conference)
Ding, J. - Ebenlendr, Tomáš - Sgall, Jiří - Zhang, G.
Online scheduling of equal-length jobs on parallel machines.
[Online rozhodování stejně dlouhých úloh na paralelních počítačích.]
Proceedings of the 15th European Symposium on Algorithms (ESA). Berlin: Springer, 2007, s. 427-438. Lecture Notes in Computer Science, 4698. ISBN 978-3-540-75519-7.
[European Symposium on Algorithms /15./. Eilat (IL), 08.10.2007-10.10.2007]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : Online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0155538File Download Size Commentary Version Access Ebenlendr.pdf 1 412.5 KB Publisher’s postprint require - 5.0090045 - MÚ 2008 RIV DE eng C - Conference Paper (international conference)
Buhrman, H. - Christandl, M. - Koucký, Michal - Lotker, Z. - Patt-Shamir, B. - Vereshchagin, N.K.
High Entropy Random Selection Protocols.
[Protokoly pro výběr náhodného řetězce s velkou entropií.]
Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007, and 11th International Workshop on Randomization and Computation, RANDOM 2007, RANDOM-APPROX 2007. Berlin: Springer-Verlag, 2007 - (Charikar, M.; Jansen, K.; Reingold, O.; Rolim, J.), s. 366-379. Lecture Notes in Computer Science, 4627. ISBN 978-3-540-74207-4.
[International Workshop on Approximation Algorithms for Combinatorial Optimization Problems/10./, and International Workshop on Randomization and Computation/11./, RANDOM-APPROX 2007. Princeton (US), 20.08.2007-22.08.2007]
R&D Projects: GA ČR GA201/05/0124; GA ČR GP201/07/P276
Institutional research plan: CEZ:AV0Z10190503
Keywords : random string selection * cryptography * Kakeya problem
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0151067File Download Size Commentary Version Access Koucky.pdf 1 445.5 KB Publisher’s postprint require - 6.0089758 - MÚ 2008 RIV RU eng C - Conference Paper (international conference)
Buhrman, H. - Fortnow, L. - Koucký, Michal - Rogers, J.D. - Vereshchagin, N.K.
Inverting Onto Functions and Polynomial Hierarchy.
[Invertování projektivních funkcí a polynomiální hierarchie.]
Proceedings of International Computer Science Symposium in Russia, CSR 2007. Berlin: Springer-Verlag, 2007 - (Diekert, V.; Volkov, M.; Voronkov, A.), s. 92-103. Lecture Notes in Computer Science, 4649. ISBN 978-3-540-74509-9.
[International Computer Science Symposium in Russia, CSR 2007. Jekaterinburg (RU), 03.09.2007-07.09.2007]
R&D Projects: GA ČR GA201/05/0124; GA ČR GP201/07/P276
Institutional research plan: CEZ:AV0Z10190503
Keywords : one-way functions * polynomial hierarchy * Kolmogorov generic oracles
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0150859File Download Size Commentary Version Access Koucky1.pdf 1 211.9 KB Publisher’s postprint require - 7.0089749 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Koucký, Michal
Circuit complexity of regular languages.
[Obvodová složitost regulárních jazyků.]
proceedings of the 3rd Conference on Computability in Europe, CiE 2007. Heidelberg: Springer-Verlag, 2007 - (Cooper, S.; Loewe, B.; Sorbi, A.), s. 426-435. ISBN 978-3-540-73000-2.
[Conference on Computability in Europe/3./. Siena (IT), 18.06.2007-23.06.2007]
R&D Projects: GA ČR GA201/05/0124; GA ČR GP201/07/P276
Institutional research plan: CEZ:AV0Z10190503
Keywords : regular languages * circuit complexity
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0150854File Download Size Commentary Version Access Koucky3.pdf 1 358.1 KB Publisher’s postprint require - 8.0084614 - MÚ 2008 RIV DE eng C - Conference Paper (international conference)
Chattopadhyay, A. - Koucký, Michal - Krebs, A. - Szegedy, M. - Tesson, P. - Thérien, D.
Languages with Bounded Multiparty Communication Complexity.
[Jazyky s omezenou komunikační složitostí pro více hráčů.]
Proceeding of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2007. Berlin: Springer-Verlag, 2007 - (Thomas, W.; Weil, P.), s. 500-511. Lecture Notes in Computer Science, 4393. ISBN 978-3-540-70917-6.
[Annual Symposium on Theoretical Aspects of Computer Science (STACS). Aachen (DE), 22.02.2007-24.02.2007]
R&D Projects: GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : communication complexity * codes * Ramsey theory
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0147333File Download Size Commentary Version Access Koucky2.pdf 1 498.8 KB Publisher’s postprint require - 9.0076019 - MÚ 2007 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Jawor, W. - Sgall, Jiří
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
[Preemptivní online rozvrhování: Optimální algoritmy pro všechny rychlosti.]
Proceedings of the 14th European Symposium on Algorithms (ESA). Berlin: Springer, 2006, s. 327-339. Lecture Notes in Computer Science, 4168. ISBN 3-540-38875-3.
[European Symposium on Algorithms (ESA)/14./. Zurich (CH), 11.09.2006-13.09.2006]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR(CZ) GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0143228File Download Size Commentary Version Access Ebenlendr1.pdf 1 539.4 KB Publisher’s postprint require - 10.0041413 - MÚ 2007 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Noga, E. J. - Sgall, Jiří - Woeginger, G.
A note on semi-online machine covering.
[O semi-online pokrývání počítačů.]
Proceedings of the 3rd Workshop on Approximation and Online Algorithms (WAOA). Berlin: Springer, 2006 - (Erlebach, T.; Persinao, G.), s. 110-118. Lecture Notes in Computer Sciences, 3879. ISBN 3-540-32207-8.
[Workshop on Approximation and Online Algorithms (WAOA)/3./. Palma de Mallorca (ES), 06.10.2005-07.10.2005]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR(CZ) GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0134885File Download Size Commentary Version Access Ebenlendr.pdf 1 181.3 KB Publisher’s postprint require