Zobrazeno 1 - 10
of 211
pro vyhledávání: '"Parallel complexity"'
Autor:
Abu-Khzam, Faisal N. a, ⁎, Li, Shouwei b, 1, Markarian, Christine c, Meyer auf der Heide, Friedhelm b, 1, Podlipyan, Pavel b, 1
Publikováno v:
In Theoretical Computer Science 27 September 2019 786:2-12
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Sergio De Agostino
Publikováno v:
Algorithms, Vol 4, Iss 3, Pp 183-199 (2011)
We present a survey of results concerning Lempel–Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms wi
Externí odkaz:
https://doaj.org/article/e881ea9e6e7b4076b7509406db0261ed
Publikováno v:
In Theoretical Computer Science 2010 411(25):2359-2367
Autor:
Robert G. Roeder
Publikováno v:
Nat Struct Mol Biol
The landmark 1969 discovery of nuclear RNA polymerases I, II and III in diverse eukaryotes represented a major turning point in the field that, with subsequent elucidation of the distinct structures and functions of these enzymes, catalyzed an avalan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8ed40126d1dbd1ba7795714253318e1
https://doi.org/10.1038/s41594-019-0287-x
https://doi.org/10.1038/s41594-019-0287-x
Publikováno v:
In Theoretical Computer Science 2009 410(24):2308-2315
Autor:
Kindervater, G. A. P., Lenstra, J. K.
Publikováno v:
Operations Research, 1989 Nov 01. 37(6), 985-990.
Externí odkaz:
https://www.jstor.org/stable/171480
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mattes, Caroline, Weiß, Armin
Power circuits have been introduced in 2012 by Myasnikov, Ushakov and Won as a data structure for non-elementarily compressed integers supporting the arithmetic operations addition and (x,y) ↦ x⋅2^y. The same authors applied power circuits to giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::070a45f803e6f34771ad8c0972cb1d65
http://arxiv.org/abs/2102.09921
http://arxiv.org/abs/2102.09921
Autor:
Ghosh, Sumanta, Gurjar, Rohit
We study the matroid intersection problem from the parallel complexity perspective. Given two matroids over the same ground set, the problem asks to decide whether they have a common base and its search version asks to find a common base, if one exis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc45036f31f91089b989b39d2ce71f4b