burgeon 发表于 2025-3-21 16:05:24

书目名称STACS 2000影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0860323<br><br>        <br><br>书目名称STACS 2000读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0860323<br><br>        <br><br>

Credence 发表于 2025-3-21 22:38:18

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

繁忙 发表于 2025-3-22 01:32:14

http://reply.papertrans.cn/87/8604/860323/860323_3.png

Ambiguous 发表于 2025-3-22 05:01:39

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

佛刊 发表于 2025-3-22 11:45:53

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

不如屎壳郎 发表于 2025-3-22 16:34:19

http://reply.papertrans.cn/87/8604/860323/860323_6.png

眼界 发表于 2025-3-22 19:34:23

http://reply.papertrans.cn/87/8604/860323/860323_7.png

编辑才信任 发表于 2025-3-23 01:03:20

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 .(. .).

缝纫 发表于 2025-3-23 01:53:04

Horst Reichel,Sophie TisonIncludes supplementary material:

祖传 发表于 2025-3-23 06:37:56

http://reply.papertrans.cn/87/8604/860323/860323_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: STACS 2000; 17th Annual Symposiu Horst Reichel,Sophie Tison Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Automat.algo