Search results
- 1.0369986 - MÚ 2012 RIV GB eng J - Journal Article
Alon, N. - Avin, Ch. - Koucký, Michal - Kozma, G. - Lotker, Z. - Tuttle, M.R.
Many random walks are faster than one.
Combinatorics Probability & Computing. Roč. 20, č. 4 (2011), s. 481-502. ISSN 0963-5483. E-ISSN 1469-2163
R&D Projects: GA ČR GP201/07/P276; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : multiple random walks * parallel random walks
Subject RIV: BA - General Mathematics
Impact factor: 0.778, year: 2011
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8280727
Permanent Link: http://hdl.handle.net/11104/0203914File Download Size Commentary Version Access Koucky1.pdf 2 300.4 KB Author’s postprint require - 2.0334960 - MÚ 2010 RIV US eng J - Journal Article
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.]
Algorithmica. Roč. 53, č. 4 (2009), s. 504-522. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : anline algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.917, year: 2009
Permanent Link: http://hdl.handle.net/11104/0179564File Download Size Commentary Version Access Ebenlendr1.pdf 1 435.2 KB Publisher’s postprint require - 3.0318591 - MÚ 2009 RIV NL eng J - Journal Article
Král´, D. - Tichý, T. - Sgall, Jiří
Randomized Strategies for the Plurality Problem.
[Pravděpodobnostní strategie pro problém plurality.]
Discrete Applied Mathematics. Roč. 156, č. 17 (2008), s. 3305-3311. ISSN 0166-218X. E-ISSN 1872-6771
R&D Projects: GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : concrete complexity * randomized algorithms
Subject RIV: BA - General Mathematics
Impact factor: 0.783, year: 2008
Permanent Link: http://hdl.handle.net/11104/0167963File Download Size Commentary Version Access Sgall1.pdf 1 413.1 KB Publisher’s postprint require - 4.0318590 - MÚ 2009 RIV US eng J - Journal Article
Bruhn, H. - Černý, J. - Hall, A. - Kolman, P. - Sgall, Jiří
Single source multiroute flows and cuts on uniform capacity networks.
[Multikomoditní toky a řezy v sítích s uniformní kapacitou a jedním zdrojem.]
Theory of Computing. Roč. 4, č. 1 (2008), s. 1-20. ISSN 1557-2862. E-ISSN 1557-2862
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : graphs * multi-route flow * paths
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0167962File Download Size Commentary Version Access Sgall.pdf 1 307.8 KB Publisher’s postprint open-access - 5.0318538 - MÚ 2009 RIV US eng J - Journal Article
Gál, A. - Koucký, Michal - McKenzie, P.
Incremental Branching Programs.
[Inkrementální rozhodovací programy.]
Theory of Computing Systems. Roč. 43, č. 2 (2008), s. 159-184. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GP201/07/P276; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : branching programs * models of computation * lower bounds
Subject RIV: BA - General Mathematics
Impact factor: 0.766, year: 2008
Permanent Link: http://hdl.handle.net/11104/0167927File Download Size Commentary Version Access Koucky4.pdf 1 444.2 KB Publisher’s postprint require - 6.0098856 - MÚ 2008 RIV US eng J - Journal Article
Krajíček, Jan
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.
[Exponenciální spodní odhad pro důkazový systém založený na uspořádaných binárních rozhodovacích stromech.]
Journal of Symbolic Logic. Roč. 73, č. 1 (2008), s. 227-237. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA AV ČR IAA1019401; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : OBDD * feasible interpolation
Subject RIV: BA - General Mathematics
Impact factor: 0.439, year: 2008
Permanent Link: http://hdl.handle.net/11104/0157662File Download Size Commentary Version Access Krajicek.pdf 1 812.4 KB Publisher’s postprint require - 7.0097689 - MÚ 2008 RIV US eng J - Journal Article
Chrobak, M. - Jawor, W. - Sgall, Jiří - Tichý, Tomáš
Improved online algorithms for buffer management in QoS switches.
[Zlepšený online algoritmus pro zpracování front QoS jednotkách.]
ACM Transactions on Algorithms. Roč. 4, č. 3 (2007), s. 1-19. ISSN 1549-6325. E-ISSN 1549-6333
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: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0156777File Download Size Commentary Version Access Sgall1.pdf 1 3.9 MB Author’s postprint require - 8.0096123 - MÚ 2008 RIV US eng J - Journal Article
Chrobák, M. - Jawor, W. - Sgall, Jiří - Tichý, Tomáš
Online scheduling of equal-length jobs: Randomization and restarts help.
[Online rozvrhování úloh stejné délky: Náhodnost a restarty pomáhají.]
Siam Journal on Computing. Roč. 36, č. 6 (2007), s. 1709-1728. ISSN 0097-5397. E-ISSN 1095-7111
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: BA - General Mathematics
Impact factor: 1.310, year: 2007
Permanent Link: http://hdl.handle.net/11104/0155562File Download Size Commentary Version Access Sgall2.pdf 1 363.8 KB Publisher’s postprint require - 9.0088021 - MÚ 2008 RIV US eng J - Journal Article
Cook, S. - Krajíček, Jan
Consequences of the Provability of $NP /subseteq P/poly$.
[Důsledky dokazatelnosti $NP /subseteq P /poly $.]
Journal of Symbolic Logic. Roč. 72, č. 4 (2007), s. 1353-1371. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA AV ČR IAA1019401; GA ČR GA201/05/0124; GA MŠMT LC505
Institutional research plan: CEZ:AV0Z10190503
Keywords : computational complexity * proof complexity * bounded arithmetic
Subject RIV: BA - General Mathematics
Impact factor: 0.609, year: 2007
Permanent Link: http://hdl.handle.net/11104/0149701File Download Size Commentary Version Access Krajicek1.pdf 1 1.5 MB Publisher’s postprint require - 10.0087421 - MÚ 2008 RIV US eng J - Journal Article
Krajíček, Jan - Skelley, A. - Thapen, Neil
NP search problems in low fragments of bounded arithmetic.
[NP vyhledávací problémy v slabých fragmentech omezené aritmetiky.]
Journal of Symbolic Logic. Roč. 72, č. 2 (2007), s. 649-672. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA AV ČR IAA1019401; GA ČR GA201/05/0124; GA MŠMT LC505
Institutional research plan: CEZ:AV0Z10190503
Keywords : search problems * bounded arithmetic
Subject RIV: BA - General Mathematics
Impact factor: 0.609, year: 2007
Permanent Link: http://hdl.handle.net/11104/0149269File Download Size Commentary Version Access Krajicek2.pdf 1 2.1 MB Publisher’s postprint require