Titlebook: STACS 2000; 17th Annual Symposiu Horst Reichel,Sophie Tison Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Automat.algo

burgeon

書目名稱STACS 2000影響因子(影響力)




書目名稱STACS 2000影響因子(影響力)學(xué)科排名




書目名稱STACS 2000網(wǎng)絡(luò)公開度




書目名稱STACS 2000網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱STACS 2000被引頻次




書目名稱STACS 2000被引頻次學(xué)科排名




書目名稱STACS 2000年度引用




書目名稱STACS 2000年度引用學(xué)科排名




書目名稱STACS 2000讀者反饋




書目名稱STACS 2000讀者反饋學(xué)科排名

Credence

https://doi.org/10.1007/3-540-46541-3Automat; algorithms; automata; complexity; computer; computer science; data structures; formal language; for

繁忙

Ambiguous

STACS 2000978-3-540-46541-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

佛刊

0302-9743 Overview: Includes supplementary material: 978-3-540-67141-1978-3-540-46541-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

不如屎殼郎

眼界

編輯才信任

Binary Exponential Backoff Is Stable for High Arrival Rates,Goodman, Greenberg, Madras and March gave a lower bound of . . for the maximum arrival rate for which the .-user binary exponential backoff protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most . .. We improve the lower bound, showing that the protocol is stable for arrival rates up to .(. .).

縫紉

Horst Reichel,Sophie TisonIncludes supplementary material:

祖?zhèn)?/a>