Search results
- 1.0424763 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Bienkowski, M. - Byrka, J. - Chrobak, M. - Jeż, Ł. - Sgall, Jiří - Stachowiak, G.
Online control message aggregation in chain networks.
Algorithms and Data Structures. Berlin: Springer, 2013 - (Dehne, F.; Solis-Oba, R.; Sack, J.), s. 133-145. Lecture Notes in Computer Science, 8037. ISBN 978-3-642-40103-9. ISSN 0302-9743.
[International Symposium, WADS 2013, /13./. London (CA), 12.08.2013-14.08.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Keywords : chain networks * control messages * control packets
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-40104-6_12
Permanent Link: http://hdl.handle.net/11104/0230786File Download Size Commentary Version Access Sgall1.pdf 2 263.9 KB Publisher’s postprint require - 2.0370314 - MÚ 2012 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří - Jeż, Łukasz
Better bounds for incremental frequency allocation in bipartite graphs.
Algorithms - ESA 2011. Berlin: Springer, 2011 - (Demetrescu, C.; Halldórsson, M.), s. 251-262. Lecture Notes in Computer Science, 6942. ISBN 978-3-642-23718-8.
[19th Annual European Symposium. Saarbrücken (DE), 05.09.2011-09.09.2011]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : asymptotic competitive ratio * bipartite graphs * different frequency
Subject RIV: BA - General Mathematics
http://www.springerlink.com/content/h25t5313l2u32n62/
Permanent Link: http://hdl.handle.net/11104/0204153 - 3.0370294 - MÚ 2012 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří - Woeginger, G. J.
Two-bounded-space bin packing revisited.
Algorithms - ESA 2011. Berlin: Springer, 2011 - (Demetrescu, C.; Halldórsson, M.), s. 263-274. Lecture Notes in Computer Science, 6942. ISBN 978-3-642-23718-8.
[19th Annual European Symposium. Saarbrücken (DE), 05.09.2011-09.09.2011]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Keywords : bin packing * bounded space * approximation algorithms
Subject RIV: BA - General Mathematics
http://www.springerlink.com/content/98t4272tt2216574/
Permanent Link: http://hdl.handle.net/11104/0204137File Download Size Commentary Version Access Sgall1.pdf 2 228 KB Publisher’s postprint require - 4.0338986 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří
Three results on frequency assignment in linear cellular networks.
Algorithmic Aspects in Information and Management. Berlin: Springer, 2009 - (Goldbert, A.; Zhou, Y.), s. 129-139. Lecture Notes in Computer Science, 5564. ISBN 978-3-642-02157-2.
[5th International Conference on Algorithmic Aspects in Information and Management. San Francisco (US), 15.06.2009-17.06.2009]
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Keywords : frequency assignment * approximation algorithms * online algorithms
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0182622File Download Size Commentary Version Access Sgall2.pdf 1 192.9 KB Author’s postprint open-access - 5.0175345 - MU-W 20030097 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří
Analysis of the { Harmonic } algorithm for three servers.
Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science. Berlin: Springer, 2003, s. 247-259. Lecture Notes in Computer Science., 2607.
[Annual Symposium on Theoretical Aspects of Computer Science/20./. Berlin (DE), 27.02.2003-01.03.2003]
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476; GA AV ČR IAA1019901
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : online algorithms * server problem * random walk
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072329 - 6.0175226 - MU-W 20020114 RIV ES eng C - Conference Paper (international conference)
Chrobak, M. - Epstein, L. - Noga, J. - Sgall, Jiří - van Stee, R. - Tichý, Tomáš - Vakhania, N.
Preemptive scheduling in overloaded systems.
Proceedings of the 29th International Colloquium on Automata, Languages, and Programming. Berlin: SpringerVerlag, 2002, s. 800-811.
[International Colloquium on Automata, Languages, and Programming/29./. Malaga (ES), 08.07.2002-13.07.2002]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : scheduling * online algorithms * benefit
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072211 - 7.0174826 - MU-W 200020 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Chrobak, M.
The weighted 2-server problem.
3-540-67141-2. In: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computing Science. Berlin: SpringerVerlag, 2000, s. 593-604. Lecture Notes in Computer Science., 1770.
[Symposium on Theoretical Aspects of Computer Science. Lille (FR), 17.02.2000-19.02.2000]
R&D Projects: GA AV ČR IAA1019901; GA ČR GA201/97/P038; GA MŠMT ME 103
Institutional research plan: CEZ:AV0Z1019905; CEZ:A05/98:Z1-019-9ii
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0071825 - 8.0106923 - MU-W 20040130 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Chrobak, M. - Jawor, W. - Tichý, Tomáš
Improved online algorithms for buffer management in QoS switches.
[Zlepšené online algoritmy pro správu bufferů v QoS hradlech.]
Proceedings of the 12th European Symposium on Algorithms. Berlin: Springer, 2004, s. 204-215.
[Annual European Symposium/12./. Bergen (NO), 14.09.2004-17.09.2004]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905
Keywords : scheduling * unit jobs * deadlines
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0014095 - 9.0106922 - MU-W 20040129 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Chrobak, M. - Jawor, W. - Tichý, Tomáš
Online scheduling of equal-length jobs: Randomization and restarts help.
[Online rozvrhování úloh stejné délky.]
Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP). Berlin: Springer, 2004, s. 358-370.
[International Colloquium on Automata, Languages, and Programming/31./. Turku (FI), 12.07.2004-16.07.2004]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905
Keywords : online scheduling * deadlines * randomization
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0014094 - 10.0106921 - MU-W 20040128 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Kolman, P. - Chrobak, M.
The greedy algorithm for the minimum common string partition problem.
[Hladový algoritmus pro minimální společné rozdělení řetízků.]
Proceedings of the APPROX. Berlin: Springer, 2004, s. 84-95.
[Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems/7./, APPROX 2004, and International Workshop on Randomization and Computation/8./, RANDOM 2004. Cambridge (US), 22.08.2004-24.08.2004]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905
Keywords : string algorithms * approximation algorithms
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0014093