Search results
- 1.0353760 - MÚ 2011 RIV GB eng C - Conference Paper (international conference)
Krajíček, Jan
A proof complexity generator.
Logic, Methodology and Philosophy of Science. London: College Publications, 2009 - (Glymour, C.; Wang, W.; Westerstahl, D.), s. 185-190. ISBN 978-1-904987-45-1.
[International Congress in Logic, Methodology and Philosophy of Science /13./. Beijing (CN), 09.08.2007-15.08.2007]
R&D Projects: GA AV ČR IAA1019401; GA MŠMT LC505
Keywords : proof complexity * hard tatologies
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0192913File Download Size Commentary Version Access Krajicek1.pdf 1 98.2 KB Author’s postprint open-access - 2.0351064 - MÚ 2011 RIV GB eng C - Conference Paper (international conference)
Čačić, V. - Pudlák, Pavel - Restall, G. - Urquhart, A. - Visser, A.
Decorated linear order types and the theory of concatenation.
Logic Colloquium 2007. Cambridge: Cambridge University Press, 2010 - (Delon, F.; Kohlenbach, U.; Maddy, P.; Stephan, F.), s. 1-13. ISBN 978-0-521-76065-2.
[Logic Colloquium 2007. Wroclaw (PL), 14.07.2007-19.07.2007]
R&D Projects: GA AV ČR IAA1019401; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : linear order * theory of concatenation
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0190897File Download Size Commentary Version Access Pudlak1.pdf 1 220.6 KB Author’s postprint open-access - 3.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 - 4.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 - 5.0321926 - MÚ 2009 RIV US eng C - Conference Paper (international conference)
Gavinsky, D. - Pudlák, Pavel
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity.
[Exponenciální separace kvantové a klasické neinteraktivní vícestranné komunikační složitosti.]
23rd Annual IEEE Conference on Computational Complexity. Maryland: IEEE Computer Society, 2008, s. 332-339. ISBN 978-0-7695-3169-4.
[Annual IEEE Conference on Computational Complexity/23./. College Park (US), 23.06.2008-26.06.2008]
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : communication complexity * quantum computations * extremal graphs
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0170325File Download Size Commentary Version Access Pudlak.pdf 1 1.1 MB Author’s postprint open-access - 6.0321832 - MÚ 2009 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel
Twelve Problems in Proof Complexity.
[Dvanáct problémů v důkazové složitosti.]
Computer Science - Theory and Applications. Berlin: Springer, 2008 - (Hirsch, E.; Razborov, A.; Semenov, A.; Slissenko, A.), s. 11-27. ISBN 978-3-540-79708-1.
[International Computer Science Symposium in Russia, CSR 2008/3./. Moskva (RU), 07.06.2008-12.06.2008]
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : computational complexity * bounded arithmetic * propositional calculus
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0170258File Download Size Commentary Version Access Pudlak2.pdf 1 449.5 KB Publisher’s postprint require - 7.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 - 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