Search results

  1. 1.
    0510355 - ÚI 2021 RIV US eng J - Journal Article
    Ralaivaosaona, D. - Šileikis, Matas - Wagner, S.
    A Central Limit Theorem for Almost Local Additive Tree Functionals.
    Algorithmica. Roč. 82, č. 3 (2020), s. 642-679. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA ČR GJ16-07822Y
    Institutional support: RVO:67985807
    Keywords : Galton–Watson trees * Additive functional * Almost local * Central limit theorem
    OECD category: Pure mathematics
    Impact factor: 0.791, year: 2020
    Method of publishing: Limited access
    http://dx.doi.org/10.1007/s00453-019-00622-4
    Permanent Link: http://hdl.handle.net/11104/0300877
     
     
  2. 2.
    0478948 - ÚI 2018 US eng J - Journal Article
    Claverol, M. - Khramtcova, E. - Papadopoulou, E. - Saumell, Maria - Seara, C.
    Stabbing Circles for Sets of Segments in the Plane.
    Algorithmica. Roč. 80, č. 3 (2018), s. 849-884. ISSN 0178-4617. E-ISSN 1432-0541
    Keywords : Cluster Voronoi diagrams * Farthest-color Voronoi diagram * Hausdorff Voronoi diagram * Stabbing circle * Stabbing line segments * Voronoi diagram
    Subject RIV: BA - General Mathematics
    Impact factor: 0.882, year: 2018
    Permanent Link: http://hdl.handle.net/11104/0274989
     
     
  3. 3.
    0478252 - ÚI 2018 US eng J - Journal Article
    Klavík, P. - Kratochvíl, J. - Otachi, Y. - Rutter, I. - Saitoh, T. - Saumell, Maria - Vyskočil, T.
    Extending Partial Representations of Proper and Unit Interval Graphs.
    Algorithmica. Roč. 77, č. 4 (2017), s. 1071-1104. ISSN 0178-4617. E-ISSN 1432-0541
    Keywords : recognition * algorithms * semiorder * Intersection representation * Partial representation extension * Bounded representations * Restricted representation * Proper interval graph * Unit interval graph * Linear programming
    Impact factor: 0.667, year: 2017
    Permanent Link: http://hdl.handle.net/11104/0274910
     
     
  4. 4.
    0465743 - MÚ 2017 RIV US eng J - Journal Article
    Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
    Towards a reverse Newman’s theorem in interactive information complexity.
    Algorithmica. Roč. 76, č. 3 (2016), s. 749-781. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA AV ČR IAA100190902
    Institutional support: RVO:67985840
    Keywords : communication complexity * information complexity * information theory
    Subject RIV: BA - General Mathematics
    Impact factor: 0.735, year: 2016
    http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
    Permanent Link: http://hdl.handle.net/11104/0264183
    FileDownloadSizeCommentaryVersionAccess
    Koucky.pdf4630.8 KBPublisher’s postprintrequire
     
     
  5. 5.
    0457321 - MÚ 2016 RIV US eng J - Journal Article
    Epstein, L. - Jeż, Łukasz - Sgall, J. - van Stee, R.
    Online scheduling of jobs with fixed start times on related machines.
    Algorithmica. Roč. 74, č. 1 (2016), s. 156-176. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : online scheduling * online algorithms * related machines
    Subject RIV: BA - General Mathematics
    Impact factor: 0.735, year: 2016
    http://link.springer.com/article/10.1007%2Fs00453-014-9940-2
    Permanent Link: http://hdl.handle.net/11104/0257713
    FileDownloadSizeCommentaryVersionAccess
    Jez.pdf1563.7 KBPublisher’s postprintrequire
     
     
  6. 6.
    0424769 - MÚ 2014 RIV US eng J - Journal Article
    Ebenlendr, Tomáš - Krčál, M. - Sgall, J.
    Graph balancing: a special case of scheduling unrelated parallel machines.
    Algorithmica. Roč. 68, č. 1 (2014), s. 62-80. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA ČR GBP202/12/G061; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
    Institutional support: RVO:67985840
    Keywords : approximation algorithms * weighted outdegree * orientation
    Subject RIV: BA - General Mathematics
    Impact factor: 0.791, year: 2014
    http://link.springer.com/article/10.1007%2Fs00453-012-9668-9
    Permanent Link: http://hdl.handle.net/11104/0230789
    FileDownloadSizeCommentaryVersionAccess
    Ebenlendr.pdf1644.3 KBPublisher’s postprintrequire
     
     
  7. 7.
    0397213 - MÚ 2014 RIV US eng J - Journal Article
    Jeż, Łukasz
    A universal randomized packed scheduling algorithm.
    Algorithmica. Roč. 67, č. 4 (2013), s. 498-515. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA AV ČR IAA100190902
    Institutional support: RVO:67985840
    Keywords : online algorithms * competitive analysis * adaptive adversary
    Subject RIV: BA - General Mathematics
    Impact factor: 0.567, year: 2013
    http://link.springer.com/article/10.1007%2Fs00453-012-9700-0
    Permanent Link: http://hdl.handle.net/11104/0224827
    FileDownloadSizeCommentaryVersionAccess
    Jez2.pdf2658.1 KBPublisher’s postprintopen-access
     
     
  8. 8.
    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/0179564
    FileDownloadSizeCommentaryVersionAccess
    Ebenlendr1.pdf1435.2 KBPublisher’s postprintrequire
     
     
  9. 9.
    0175116 - MU-W 20025167 RIV US eng J - Journal Article
    Avidor, A. - Azar, Y. - Sgall, Jiří
    Ancient and new algorithms for load balancing in the Lp norm.
    Algorithmica. Roč. 29, č. 3 (2001), s. 422-441. ISSN 0178-4617. E-ISSN 1432-0541
    R&D Projects: GA AV ČR IAA1019602
    Keywords : online algorithms%scheduling
    Subject RIV: BA - General Mathematics
    Impact factor: 0.477, year: 2001
    Permanent Link: http://hdl.handle.net/11104/0072105
    FileDownloadSizeCommentaryVersionAccess
    Sgall.pdf1160.9 KBPublisher’s postprintrequire
     
     
  10. 10.
    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
     
     


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