找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 37982|回復(fù): 61
樓主
發(fā)表于 2025-3-21 18:51:38 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱STACS 94
副標題11th Annual Symposiu
編輯Patrice Enjalbert,Ernst W. Mayr,Klaus W. Wagner
視頻videohttp://file.papertrans.cn/861/860341/860341.mp4
叢書名稱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
關(guān)鍵詞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網(wǎng)絡(luò)公開度




書目名稱STACS 94網(wǎng)絡(luò)公開度學科排名




書目名稱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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:22:15 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:52:20 | 只看該作者
地板
發(fā)表于 2025-3-22 04:58:21 | 只看該作者
5#
發(fā)表于 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
6#
發(fā)表于 2025-3-22 13:02:19 | 只看該作者
7#
發(fā)表于 2025-3-22 17:53:34 | 只看該作者
8#
發(fā)表于 2025-3-23 00:08:37 | 只看該作者
9#
發(fā)表于 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.
10#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-23 11:55
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
方正县| 乐亭县| 乳山市| 武城县| 夏邑县| 江门市| 钟祥市| 广饶县| 新绛县| 西和县| 高雄县| 湖北省| 哈密市| 蕲春县| 奎屯市| 上栗县| 疏附县| 颍上县| 望谟县| 邹城市| 广西| 哈巴河县| 泌阳县| 成武县| 日土县| 图片| 兴安盟| 密山市| 团风县| 济宁市| 章丘市| 南阳市| 汨罗市| 威远县| 澄城县| 兴义市| 衡阳县| 萝北县| 缙云县| 扬州市| 泰宁县|