找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: STACS 94; 11th Annual Symposiu Patrice Enjalbert,Ernst W. Mayr,Klaus W. Wagner Conference proceedings 1994 Springer-Verlag Berlin Heidelber

[复制链接]
查看: 37848|回复: 61
发表于 2025-3-21 18:51:38 | 显示全部楼层 |阅读模式
书目名称STACS 94
副标题11th Annual Symposiu
编辑Patrice Enjalbert,Ernst W. Mayr,Klaus W. Wagner
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: STACS 94; 11th Annual Symposiu Patrice Enjalbert,Ernst W. Mayr,Klaus W. Wagner Conference proceedings 1994 Springer-Verlag Berlin Heidelber
描述This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS ‘94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.
出版日期Conference proceedings 1994
关键词Bisimulation; Computer-Science-Logik; Kombinatorik; Komplexität; Monoid; automata; combinatorics; complexit
版次1
doihttps://doi.org/10.1007/3-540-57785-8
isbn_softcover978-3-540-57785-0
isbn_ebook978-3-540-48332-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1994
The information of publication is updating

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




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




书目名称STACS 94网络公开度




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




书目名称STACS 94被引频次




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




书目名称STACS 94年度引用




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




书目名称STACS 94读者反馈




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




单选投票, 共有 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 22:22:15 | 显示全部楼层
发表于 2025-3-22 03:52:20 | 显示全部楼层
发表于 2025-3-22 04:58:21 | 显示全部楼层
发表于 2025-3-22 08:44:17 | 显示全部楼层
https://doi.org/10.1007/3-540-57785-8Bisimulation; Computer-Science-Logik; Kombinatorik; Komplexität; Monoid; automata; combinatorics; complexit
发表于 2025-3-22 13:02:19 | 显示全部楼层
发表于 2025-3-22 17:53:34 | 显示全部楼层
发表于 2025-3-23 00:08:37 | 显示全部楼层
发表于 2025-3-23 05:22:24 | 显示全部楼层
Faster sorting and routing on grids with diagonals,able grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half the on principle smallest number given by the bisection bound for grids without diagonals.
发表于 2025-3-23 08:55:53 | 显示全部楼层
The nature and meaning of perturbations in geometric computing,ing with them amounts to computing with limits. and (re)derive some methods of computing with such limits automatically. In principle a line can always be used as a perturbation curve. We discuss a generic method for choosing such a line that is applicable in many situations.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 02:37
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表