Search results
- 1.0175447 - MU-W 20030142 RIV CZ eng V - Research Report
Bartal, Y. - Chin, F. Y. L. - Chrobak, M. - Fung, S. P. Y. - Jawor, W. - Lavi, R. - Sgall, Jiří - Tichý, Tomáš
Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172.
Praha: Charles University, 2003. 25 s.
R&D Projects: GA MŠMT LN00A056; GA MŠMT ME 476; GA ČR GA201/01/1195; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : scheduling problem * quality-of-service applications
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072430 - 2.0175446 - MU-W 20030199 RIV SIGLE CZ eng V - Research Report
Ebenlendr, T. - Sgall, Jiří
Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171.
Praha: Charles University, 2003. 21 s.
R&D Projects: GA MŠMT LN00A056; GA MŠMT ME 476; GA ČR GA201/01/1195; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : online scheduling * preemption * uniformly related machines
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072429 - 3.0175445 - MU-W 20030198 RIV CZ eng V - Research Report
Král, D. - Sgall, Jiří
Coloring graphs from lists with bounded size of their union. KAM-DIMATIA. Series 2003-641 and ITI Series 2003-156.
Praha: Charles University, 2003. 12 s. KAM-DIMATIA.
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : graph coloring * list coloring
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072428 - 4.0175230 - MU-W 20020118 RIV CZ eng V - Research Report
Král, D. - Majerech, V. - Sgall, Jiří - Tichý, Tomáš - Woeginger, G.
It is tough to be a plumber.
Praha: Charles University, 2002. 18 s.
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : combinatorial games * computational complexity
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072215 - 5.0175229 - MU-W 20020117 RIV CZ eng V - Research Report
Sgall, Jiří
Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences ).
Praha: Charles University, 2002. 30 s.
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : computational complexity * approximation algorithms
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072214 - 6.0175228 - MU-W 20020116 RIV CZ eng V - Research Report
Chrobak, M. - Sgall, Jiří
Analysis of the Harmonic algorithm for three servers.
Praha: Charles University, 2002. 19 s.
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : online algorithms * k-server problem * random walks
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072213 - 7.0175120 - MU-W 20025171 RIV US eng V - Research Report
Chrobak, A. - Sgall, Jiří
Algorithms for testing fault-tolerance of sequenced jobs. Technical Report UCR-CS-00-06.
California: UC Riverside, 2000. 11 s.
R&D Projects: GA AV ČR IAA1019901; GA ČR GA201/97/P038
Keywords : sequenced jobs%problem of testing
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072109 - 8.0174672 - MU-W 990004 RIV CZ eng V - Research Report
Seiden, S. - Sgall, Jiří - Woeginger, G.W.
Semi-online scheduling with decreasing job sizes.
Praha: Charles University, 1998. 15 s. Technical Report KAM-DIMATIA, 98-410.
R&D Projects: GA AV ČR IAA1019602; GA ČR GA201/97/P038; GA MŠMT ME 103
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0071675 - 9.0174671 - MU-W 990003 RIV CZ eng V - Research Report
Epstein, L. - Sgall, Jiří
Approximation schemes for scheduling on uniformly related and identical parallel machines.
Praha: Charles University, 1998. 19 s. Technical Report KAMDIMATIA, Series 98-414.
R&D Projects: GA AV ČR IAA1019602; GA ČR GA201/97/P038
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0071674 - 10.0174477 - MU-W 970118 DE eng V - Research Report
Impagliazzo, R. - Pudlák, Pavel - Sgall, Jiří
Lower bounds for the polynomial calculus and the groebner basis algorithm.
Trier: Electronic Colloquium on Computational Complexity, 1997. 12 s.
R&D Projects: GA AV ČR IAA1019602
Permanent Link: http://hdl.handle.net/11104/0071483