Search results

  1. 1.
    0175434 - MU-W 20030188 RIV NL eng J - Journal Article
    Gál, A. - Pudlák, Pavel
    A note on monotone complexity and the rank of matrices.
    Information Processing Letters. Roč. 87, č. 6 (2003), s. 321-326. ISSN 0020-0190. E-ISSN 1872-6119
    R&D Projects: GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT LN00A056
    Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
    Keywords : computational complexity * lower bounds * span programs
    Subject RIV: BA - General Mathematics
    Impact factor: 0.473, year: 2003
    Permanent Link: http://hdl.handle.net/11104/0072417
    FileDownloadSizeCommentaryVersionAccess
    Pudlak1.pdf198.6 KBPublisher’s postprintrequire
     
     
  2. 2.
    0175332 - MU-W 20030084 RIV US eng J - Journal Article
    Chrobak, M. - Epstein, L. - Noga, J. - Sgall, Jiří - van Stee, R. - Tichý, Tomáš - Vakhania, N.
    Preemptive scheduling in overloaded systems.
    Journal of Computer and System Sciences. Roč. 67, č. 1 (2003), s. 183-197. ISSN 0022-0000. E-ISSN 1090-2724
    R&D Projects: GA ČR GA201/01/1195; GA MŠMT ME 476; GA AV ČR IAA1019901; GA MŠMT LN00A056
    Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
    Keywords : scheduling * online algorithms * benefit
    Subject RIV: BA - General Mathematics
    Impact factor: 0.795, year: 2003
    Permanent Link: http://hdl.handle.net/11104/0072316
    FileDownloadSizeCommentaryVersionAccess
    Sgall.pdf1214.5 KBPublisher’s postprintrequire
     
     
  3. 3.
    0175225 - MU-W 20020113 RIV CH eng J - Journal Article
    Edmonds, J. - Impagliazzo, R. - Rudich, S. - Sgall, Jiří
    Communication complexity towards lower bounds on circuit depth.
    Computational Complexity. Roč. 10, č. 3 (2001), s. 210-246. ISSN 1016-3328. E-ISSN 1420-8954
    R&D Projects: GA AV ČR IAA1019602; GA AV ČR IAA1019901; GA ČR GA201/97/P038; GA ČR GA201/01/1195; GA MŠMT ME 103
    Keywords : communication complexity%lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.448, year: 2001
    Permanent Link: http://hdl.handle.net/11104/0072210
    FileDownloadSizeCommentaryVersionAccess
    Sgall1.pdf1556.3 KBPublisher’s postprintrequire
     
     
  4. 4.
    0175113 - MU-W 20025164 RIV HU eng J - Journal Article
    Woeginger, G. J. - Sgall, Jiří
    The complexity of coloring graphs without long induced paths.
    Acta Cybernetica. Roč. 15, č. 1 (2001), s. 107-117. ISSN 0324-721X
    R&D Projects: GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT LN00A056
    Keywords : graph coloring%chromatic number%computational complexity
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0072102
    FileDownloadSizeCommentaryVersionAccess
    Sgall4.pdf11.2 MBPublisher’s postprintrequire
     
     
  5. 5.
    0106943 - MU-W 20040150 RIV US eng J - Journal Article
    Epstein, L. - Sgall, Jiří
    Approximation schemes for scheduling on uniformly related and identical parallel machines.
    [Aproximační schémata pro rozvrhování na uniformních počítačích.]
    Algorithmica. Roč. 39, č. 1 (2004), s. 43-57. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA AV ČR IAA1019401; GA ČR GA201/01/1195
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : scheduling
    Subject RIV: BA - General Mathematics
    Impact factor: 0.923, year: 2004
    Permanent Link: http://hdl.handle.net/11104/0014115
    FileDownloadSizeCommentaryVersionAccess
    Sgall1.pdf1169.2 KBPublisher’s postprintrequire
     
     
  6. 6.
    0106941 - MU-W 20040148 RIV NL eng J - Journal Article
    Majerech, V. - Sgall, Jiří - Tichý, Tomáš - Woeginger, G. - Král ´, D.
    It is tough to be a plumber.
    [Je těžké být instalatérem.]
    Theoretical Computer Science. Roč. 313, č. 3 (2004), s. 473-484. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : combinatorial games * computational complexity
    Subject RIV: BA - General Mathematics
    Impact factor: 0.676, year: 2004
    Permanent Link: http://hdl.handle.net/11104/0014113
    FileDownloadSizeCommentaryVersionAccess
    Sgall4.pdf1242.2 KBPublisher’s postprintrequire
     
     
  7. 7.
    0106940 - MU-W 20040147 RIV NL eng J - Journal Article
    Sgall, Jiří - de Paepe, W. E. - Sitters, R. A. - Stougie, L.
    Computer-aided complexity classification of dial-a-ride problems.
    [Počítačově asistovaná klasifikace dial-a-ride problémů.]
    INFORMS Journal on Computing. Roč. 16, č. 2 (2004), s. 120-132. ISSN 1091-9856. E-ISSN 1526-5528
    R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : vehicle routing * dial-a-ride * computational complexity
    Subject RIV: BA - General Mathematics
    Impact factor: 1.522, year: 2004
    Permanent Link: http://hdl.handle.net/11104/0014112
     
     
  8. 8.
    0106920 - MU-W 20040127 RIV NL eng J - Journal Article
    Chrobak, M. - Sgall, Jiří
    The weighted 2-server problem.
    [Vážený problém 2 serverů.]
    Theoretical Computer Science. Roč. 324, 2-3 (2004), s. 289-319. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA MŠMT ME 103; GA MŠMT ME 476; GA ČR GA201/01/1195; GA MŠMT LN00A056; GA AV ČR IAA1019901; GA AV ČR IAA1019401
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : online algorithms * k-server problem
    Subject RIV: BA - General Mathematics
    Impact factor: 0.676, year: 2004
    Permanent Link: http://hdl.handle.net/11104/0014092
    FileDownloadSizeCommentaryVersionAccess
    Sgall3.pdf1317 KBPublisher’s postprintrequire
     
     
  9. 9.
    0106913 - MU-W 20040120 RIV SK eng J - Journal Article
    Ilucová, Lucia - Saxl, Ivan
    Improved grain size estimation: w-s diagram.
    [Zlepšené odhady velikosti zrna: WS diagram.]
    Acta Metallurgica Slovaca. Roč. 10, - (2004), s. 152-163. ISSN 1335-1532
    R&D Projects: GA ČR GA201/01/1195
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : grain size estimation * profile count * intercept count
    Subject RIV: BE - Theoretical Physics
    Permanent Link: http://hdl.handle.net/11104/0014085
     
     
  10. 10.
    0106818 - MU-W 20040025 RIV NL eng J - Journal Article
    Tichý, Tomáš
    Randomized On-line Scheduling on 3 processors.
    [Pravděpodobnostní rozvrhování na 3 počítačích.]
    Operations Research Letters. Roč. 32, č. 2 (2004), s. 152-158. ISSN 0167-6377. E-ISSN 1872-7468
    R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476
    Institutional research plan: CEZ:AV0Z1019905
    Keywords : scheduling * makespan * competitive analysis
    Subject RIV: BA - General Mathematics
    Impact factor: 0.597, year: 2004
    Permanent Link: http://hdl.handle.net/11104/0013992
    FileDownloadSizeCommentaryVersionAccess
    Tichy.pdf1207.3 KBPublisher’s postprintrequire
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.