找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ISA ‘91 Algorithms; 2nd International Sy Wen-Lian Hsu,R. C. T. Lee Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 1991 Compl

[复制链接]
查看: 14556|回复: 61
发表于 2025-3-21 18:51:15 | 显示全部楼层 |阅读模式
书目名称ISA ‘91 Algorithms
副标题2nd International Sy
编辑Wen-Lian Hsu,R. C. T. Lee
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: ISA ‘91 Algorithms; 2nd International Sy Wen-Lian Hsu,R. C. T. Lee Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 1991 Compl
描述This volume presents the proceedings of the Second AnnualInternational Symposium on Algorithms held at AcademiaSinica, Taipei, Republic of China, December 16-18, 1991. Thesymposium was organized by the Institute of InformationScience, Academia Sinica, and the National TsingHuaUniversity.In response to the program committee‘s call for papers, 90papers were submitted, from which the committee selected 36forpresentation at the symposium. In addition to thesecontributed papers, the symposium included 5 invited talks.The subjects of the papers range widely in the area ofdiscrete algorithms, over such topics as computationalgeometry, graph algorithms, complexity theory,parallelalgorithms, distributed computing and computational algebra.
出版日期Conference proceedings 1991
关键词Complexity Theory; Computational Geometry; Distributed Computing; Graph Algorithms; Graph-Algorithmen; Ko
版次1
doihttps://doi.org/10.1007/3-540-54945-5
isbn_softcover978-3-540-54945-1
isbn_ebook978-3-540-46600-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1991
The information of publication is updating

书目名称ISA ‘91 Algorithms影响因子(影响力)




书目名称ISA ‘91 Algorithms影响因子(影响力)学科排名




书目名称ISA ‘91 Algorithms网络公开度




书目名称ISA ‘91 Algorithms网络公开度学科排名




书目名称ISA ‘91 Algorithms被引频次




书目名称ISA ‘91 Algorithms被引频次学科排名




书目名称ISA ‘91 Algorithms年度引用




书目名称ISA ‘91 Algorithms年度引用学科排名




书目名称ISA ‘91 Algorithms读者反馈




书目名称ISA ‘91 Algorithms读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:18:18 | 显示全部楼层
发表于 2025-3-22 02:17:43 | 显示全部楼层
0302-9743 s, over such topics as computationalgeometry, graph algorithms, complexity theory,parallelalgorithms, distributed computing and computational algebra.978-3-540-54945-1978-3-540-46600-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 05:21:13 | 显示全部楼层
On maintaining the width and diameter of a planar point-set online, but especially the one for the diameter problem, use well-understood data structures and should be simple to implement. The diameter result yields a fast implementation of the greedy heuristic for maximum-weight Euclidean matching and an efficient online algorithm to maintain approximate convex hulls in the plane.
发表于 2025-3-22 09:35:21 | 显示全部楼层
Conference proceedings 1991mber 16-18, 1991. Thesymposium was organized by the Institute of InformationScience, Academia Sinica, and the National TsingHuaUniversity.In response to the program committee‘s call for papers, 90papers were submitted, from which the committee selected 36forpresentation at the symposium. In addition
发表于 2025-3-22 14:22:12 | 显示全部楼层
发表于 2025-3-22 17:05:58 | 显示全部楼层
发表于 2025-3-23 00:31:58 | 显示全部楼层
发表于 2025-3-23 01:39:33 | 显示全部楼层
发表于 2025-3-23 06:31:22 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-25 09:18
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表