找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be

[复制链接]
查看: 30056|回复: 66
发表于 2025-3-21 18:48:23 | 显示全部楼层 |阅读模式
期刊全称Algorithms and Data Structures
期刊简称4th International Wo
影响因子2023Selim G. Akl,Frank Dehne,Nicola Santoro
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be
影响因子This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS ‘95, held in Kingston, Canada in August 1995..The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.
Pindex Conference proceedings 1995
The information of publication is updating

书目名称Algorithms and Data Structures影响因子(影响力)




书目名称Algorithms and Data Structures影响因子(影响力)学科排名




书目名称Algorithms and Data Structures网络公开度




书目名称Algorithms and Data Structures网络公开度学科排名




书目名称Algorithms and Data Structures被引频次




书目名称Algorithms and Data Structures被引频次学科排名




书目名称Algorithms and Data Structures年度引用




书目名称Algorithms and Data Structures年度引用学科排名




书目名称Algorithms and Data Structures读者反馈




书目名称Algorithms and Data Structures读者反馈学科排名




单选投票, 共有 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 23:10:20 | 显示全部楼层
发表于 2025-3-22 01:22:43 | 显示全部楼层
发表于 2025-3-22 06:41:49 | 显示全部楼层
978-3-540-60220-0Springer-Verlag Berlin Heidelberg 1995
发表于 2025-3-22 09:17:40 | 显示全部楼层
发表于 2025-3-22 13:16:28 | 显示全部楼层
Stabsfunktionen im Unternehmen,We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.
发表于 2025-3-22 19:03:03 | 显示全部楼层
发表于 2025-3-23 00:19:10 | 显示全部楼层
Load balancing in quorum systems,This paper introduces and studies the question of balancing the load on processors participating in a given quorum system. Our proposed measure for the degree of balancing is the ratio between the load on the most frequently referenced element, and on the least frequently used one.
发表于 2025-3-23 04:38:03 | 显示全部楼层
On the complexity of approximating and illuminating three-dimensional convex polyhedra,We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.
发表于 2025-3-23 06:54:06 | 显示全部楼层
Computing common tangents without a separating line,Given two disjoint convex polygons in standard representations, one can compute outer common tangents in logarithmic time without first obtaining a separating line. If the polygons are not disjoint, there is an additional factor of the logarithm of the intersection or convex hull, whichever is smaller.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 12:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表