设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet A (Aa, Ab,Ac, Ad, Ae…... )

1234567下一页
返回列表

Titlebook: Algorithms - ESA ‘93; First Annual Europea Thomas Lengauer Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Algorithmen.A

[复制链接]
查看: 43717|回复: 63
发表于 2025-3-21 18:52:34 | 显示全部楼层 |阅读模式
期刊全称Algorithms - ESA ‘93
期刊简称First Annual Europea
影响因子2023Thomas Lengauer
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithms - ESA ‘93; First Annual Europea Thomas Lengauer Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Algorithmen.A
影响因子Symposium on Algorithms (ESA ‘93), held in Bad Honnef, nearBoon, inGermany, September 30 - October 2, 1993. Thesymposium is intended to launchan annual series ofinternational conferences, held in early fall, covering thefield of algorithms. Within the scope of the symposium liesall research on algorithms, theoretical as well as applied,that is carried out in the fields of computer science anddiscrete applied mathematics. The symposium aims to cater toboth of these research communities and tointensify theexchange between them.The volume contains 35 contributed papers selected from 101proposals submitted in response to the call forpapers, aswell as three invited lectures: "Evolution of an algorithm"by Michael Paterson, "Complexity of disjoint paths problemsin planar graphs" by Alexander Schrijver, and"Sequencecomparison and statistical significance in molecularbiology" by Michael S. Waterman.
Pindex Conference proceedings 1993
The information of publication is updating

书目名称Algorithms - ESA ‘93影响因子(影响力)




书目名称Algorithms - ESA ‘93影响因子(影响力)学科排名




书目名称Algorithms - ESA ‘93网络公开度




书目名称Algorithms - ESA ‘93网络公开度学科排名




书目名称Algorithms - ESA ‘93被引频次




书目名称Algorithms - ESA ‘93被引频次学科排名




书目名称Algorithms - ESA ‘93年度引用




书目名称Algorithms - ESA ‘93年度引用学科排名




书目名称Algorithms - ESA ‘93读者反馈




书目名称Algorithms - ESA ‘93读者反馈学科排名




单选投票, 共有 0 人参与投票
1.jpg
 

0票 0%

Perfect with Aesthetics
2.jpg
 

0票 0%

Better Implies Difficulty
3.jpg
 

0票 0%

Good and Satisfactory
4.jpg
 

0票 0%

Adverse Performance
5.jpg
 

0票 0%

Disdainful Garbage
您所在的用户组没有投票权限
Blandishment
回复

举报

发表于 2025-3-21 21:44:08 | 显示全部楼层
insular
回复

举报

发表于 2025-3-22 00:26:09 | 显示全部楼层
Parallel approximation schemes for problems on planar graphs,This paper describes a technique to obtain NC Approximations Schemes for the Maximun Independent Set in planar graphs and related optimization problems.
ADORE
回复

举报

发表于 2025-3-22 07:12:25 | 显示全部楼层
返老还童
回复

举报

发表于 2025-3-22 12:22:06 | 显示全部楼层
领巾
回复

举报

发表于 2025-3-22 16:46:14 | 显示全部楼层
一条卷发
回复

举报

发表于 2025-3-22 20:33:59 | 显示全部楼层
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs,e communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following:
STELL
回复

举报

发表于 2025-3-23 00:40:47 | 显示全部楼层
LINE
回复

举报

发表于 2025-3-23 04:04:06 | 显示全部楼层
Parley
回复

举报

发表于 2025-3-23 08:36:27 | 显示全部楼层
GORGE
回复

举报

下一页 »
1234567下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 16:50
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表