commotion 发表于 2025-3-21 19:16:05

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

传授知识 发表于 2025-3-21 21:12:50

978-3-540-18834-6Springer-Verlag Berlin Heidelberg 1988

floodgate 发表于 2025-3-22 03:41:44

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

带子 发表于 2025-3-22 06:27:05

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/860335.jpg

galley 发表于 2025-3-22 09:15:17

https://doi.org/10.1007/BFb0035825Algorithms; Automat; Bisimulation; Boolean algebra; Modula; Monoid; Scheduling; automata; complexity; compute

最后一个 发表于 2025-3-22 15:53:30

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

conifer 发表于 2025-3-22 19:08:07

Maintaining range trees in secondary memory, memory. To this end, we have to partition range trees into parts that can be stored in consecutive blocks in secondary memory. A number of partition schemes will be presented that limit the part sizes and the number of disk accesses necessary for performing updates and queries. Matching lower bounds will be proven as well.

牛马之尿 发表于 2025-3-22 23:21:08

http://reply.papertrans.cn/87/8604/860335/860335_8.png

Peculate 发表于 2025-3-23 01:47:25

,The power of polynomial size Ω-branching programs, Ω-branching programs will be completely classified. Beside of identifying a new class .. = ../. between . and . new characterizations of such fundamental complexity classes, like . and . are obtained.

motor-unit 发表于 2025-3-23 09:35:06

http://reply.papertrans.cn/87/8604/860335/860335_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: STACS 88; 5th Annual Symposium Robert Cori,Martin Wirsing Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.Aut