找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: STACS 88; 5th Annual Symposium Robert Cori,Martin Wirsing Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.Aut

[复制链接]
查看: 46522|回复: 64
发表于 2025-3-21 19:16:05 | 显示全部楼层 |阅读模式
书目名称STACS 88
副标题5th Annual Symposium
编辑Robert Cori,Martin Wirsing
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: STACS 88; 5th Annual Symposium Robert Cori,Martin Wirsing Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.Aut
描述This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.
出版日期Conference proceedings 1988
关键词Algorithms; Automat; Bisimulation; Boolean algebra; Modula; Monoid; Scheduling; automata; complexity; compute
版次1
doihttps://doi.org/10.1007/BFb0035825
isbn_softcover978-3-540-18834-6
isbn_ebook978-3-540-48190-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1988
The information of publication is updating

书目名称STACS 88影响因子(影响力)




书目名称STACS 88影响因子(影响力)学科排名




书目名称STACS 88网络公开度




书目名称STACS 88网络公开度学科排名




书目名称STACS 88被引频次




书目名称STACS 88被引频次学科排名




书目名称STACS 88年度引用




书目名称STACS 88年度引用学科排名




书目名称STACS 88读者反馈




书目名称STACS 88读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:12:50 | 显示全部楼层
978-3-540-18834-6Springer-Verlag Berlin Heidelberg 1988
发表于 2025-3-22 03:41:44 | 显示全部楼层
发表于 2025-3-22 06:27:05 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/860335.jpg
发表于 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 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 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.
发表于 2025-3-23 09:35:06 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-8 04:15
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表