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.0424750 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Dósa, G. - Sgall, Jiří
First Fit bin packing: a tight analysis.
30th International Symposium on Theoretical Aspects of Computer Science. Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2013 - (Portier, N.; Wilke, T.), s. 538-549. Leibniz International Proceedings in Informatics, 20. ISBN 978-3-939897-50-7. ISSN 1868-8969.
[International Symposium on Theoretical Aspects of Computer Science (STACS 2013), /30./. Kiel (DE), 27.02.2013-02.03.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Keywords : First Fit * bin packing * online algorithms
Subject RIV: BA - General Mathematics
http://drops.dagstuhl.de/opus/volltexte/2013/3963/
Permanent Link: http://hdl.handle.net/11104/0230778File Download Size Commentary Version Access Sgall.pdf 1 585.7 KB Publisher’s postprint open-access - 3.0422288 - MÚ 2014 RIV US eng C - Conference Paper (international conference)
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman's theorem in interactive information complexity.
IEEE Conference on Computational Complexity 2013. Washington: IEEE, 2013, s. 24-33. ISBN 978-1-4673-6466-9.
[IEEE Conference on Computational Complexity 2013. Palo Alto (US), 05.06.2013-07.06.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : comlexity theory * communication complexity * interactive information complexity
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746
Permanent Link: http://hdl.handle.net/11104/0228474File Download Size Commentary Version Access Koucky1.pdf 1 260.9 KB Publisher’s postprint require - 4.0422140 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel
On extracting computations from propositional proofs.
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Wadem: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2010 - (Lodaya, K.; Mahajan, M.), s. 30-41. Leibniz International Proceedings in Informatics, vol. 8. ISBN 978-3-939897-23-1.
[International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), /30./. Chennai (IN), 15.12.2010-16.12.2010]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : proof complexity * propositional tautology * boolean circuits
Subject RIV: BA - General Mathematics
http://drops.dagstuhl.de/opus/volltexte/2010/2851/
Permanent Link: http://hdl.handle.net/11104/0228350File Download Size Commentary Version Access Pudlak2.pdf 1 424.5 KB Publisher’s postprint open-access - 5.0422131 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Beckmann, A. - Pudlák, Pavel - Thapen, Neil
Parity games and propositional proofs.
Mathematical Foundations of Computer Science 2013. Berlin: Springer, 2013 - (Chatterjee, K.; Sgall, J.), s. 111-122. Lecture Notes in Computer Science, 8087. ISBN 978-3-642-40312-5.
[International Symposium on Mathematical Foundations of Computer Science 2013 /38./. Klosterneuburg (AT), 26.08.2013-30.08.2013]
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : resolution proof systems * parity games * game equivalent to resolution
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-40313-2_12
Permanent Link: http://hdl.handle.net/11104/0228345File Download Size Commentary Version Access Pudlak1.pdf 1 214.5 KB Publisher’s postprint require - 6.0395529 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Lauria, Massimo - Pudlák, Pavel - Thapen, Neil - Rödl, V.
The complexity of proving that a graph is Ramsey.
Automata, Languages, and Programming. Part I. Berlin: Springer, 2013 - (Fomin, F.; Freivalds, R.; Kwiatkowska, M.; Peleg, D.), s. 684-695. Lecture Notes in Computer Science, 7965. ISBN 978-3-642-39205-4.
[International Colloquium, ICALP 2013 /40./. Riga (LT), 08.07.2013-12.07.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : CNF formulas * independent set * lower bounds
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-39206-1_58
Permanent Link: http://hdl.handle.net/11104/0223541File Download Size Commentary Version Access Pudlak.pdf 5 224.2 KB Publisher’s postprint require - 7.0395301 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Bulánek, Jan - Koucký, Michal - Saks, M.
On randomized online labeling with polynomially many labels.
Automata, Languages, and Programming. Part I. Berlin: Springer, 2013 - (Fomin, F.; Freivalds, R.; Kwiatkowska, M.; Peleg, D.), s. 291-302. Lecture Notes in Computer Science, 7965. ISBN 978-3-642-39205-4.
[International Colloquium, ICALP 2013 /40./. Riga (LT), 08.07.2013-12.07.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online labeling * complexity
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-39206-1_25
Permanent Link: http://hdl.handle.net/11104/0223374File Download Size Commentary Version Access Bulanek1.pdf 1 221.1 KB Publisher’s postprint require - 8.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 - 9.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 - 10.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