A constant-competitive algorithm for online OVSF code assignment

From MaRDI portal


DOI10.1007/S00453-008-9241-8MaRDI QIDQ848939zbMATH OpenOpenAlexFDO

Authors Hing-Fung Ting, Yong Zhang, Francis Y. L. Chin

Publication date 23 February 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9241-8


zbMATH Keywords

online algorithmslower boundscompetitive analysiswideband code-division multiple-access

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Parallel algorithms in computer science (68W10)



Recommendations


Cites work


Cited in
(11)


Describes a project that uses

Uses Software





This page was built for publication: A constant-competitive algorithm for online OVSF code assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848939)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_constant-competitive_algorithm_for_online_OVSF_code_assignment&oldid=64830396"
Powered by MediaWiki