找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computing and Combinatorics; 5th Annual Internati Takano Asano,Hideki Imai,Takeshi Tokuyama Conference proceedings 1999 Springer-Verlag Ber

[复制链接]
发表于 2025-3-27 00:59:02 | 显示全部楼层
Computing and Combinatorics978-3-540-48686-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-27 01:57:29 | 显示全部楼层
Energieumwandlungen und Exergie,delete-min operations in .(. + . log .) time. The merit of the 2—3 heap is that it is conceptually simpler and easier to implement. The new data structure will have a wide application in graph algorithms.
发表于 2025-3-27 05:40:24 | 显示全部楼层
Die thermische Zustandsgleichung, trees in external memory so that bottom-up paths can be traversed I/O-efficiently, and we present I/O-efficient algorithms for tri-angulating planar graphs and computing small separators of such graphs. Using these techniques, we can construct a data structure that allows for answering shortest path queries on a planar graph I/O-efficiently.
发表于 2025-3-27 09:31:42 | 显示全部楼层
发表于 2025-3-27 15:22:59 | 显示全部楼层
发表于 2025-3-27 19:14:54 | 显示全部楼层
,Modellprozesse für Stoffumwandlungen,d78]. The first characterization of LOGDCFL in terms of polynomial proof-tree-size is obtained, using circuits built from the multiplex select gates of [FLR96]. The classes L and NC. are also characterized by such polynomial size circuits: “self-similar” logarithmic depth captures L, and bounded width captures NC..
发表于 2025-3-27 22:36:34 | 显示全部楼层
发表于 2025-3-28 04:45:29 | 显示全部楼层
发表于 2025-3-28 07:32:59 | 显示全部楼层
发表于 2025-3-28 10:45:18 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-1 18:53
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表