文献
J-GLOBAL ID:202202212558584506
整理番号:22A0797076
いくつかの非正準プレフィックスフリー符号の効率的でコンパクトな表現【JST・京大機械翻訳】
Efficient and compact representations of some non-canonical prefix-free codes
著者 (10件):
Farina Antonio
(Universidade da Coruna and Centro de Investigacion CITIC, A Coruna, Spain)
,
Gagie Travis
(Dalhousie University, Canada)
,
Gagie Travis
(Center for Biotechnology and Bioengineering (CeBiB), Chile)
,
Grabowski Szymon
(Institute of Applied Computer Science, Lodz University of Technology, Poland)
,
Manzini Giovanni
(Department of Computer Science, University of Pisa, Italy)
,
Manzini Giovanni
(IIT-CNR, Pisa, Italy)
,
Navarro Gonzalo
(Center for Biotechnology and Bioengineering (CeBiB), Chile)
,
Navarro Gonzalo
(Millennium Institute for Foundational Research on Data (IMFD), Chile)
,
Navarro Gonzalo
(Department of Computer Science, University of Chile, Chile)
,
Ordonez Alberto
(Pinterest Inc., CA, USA)
資料名:
Theoretical Computer Science
(Theoretical Computer Science)
巻:
907
ページ:
11-25
発行年:
2022年
JST資料番号:
T0022A
ISSN:
0304-3975
CODEN:
TCSDIQ
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)