Mendeley出力
＜電子ブック＞
STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16-18, 1989 Proceedings
| 責任表示 | |
|---|---|
| 著者 | |
| 本文言語 | |
| 出版者 | |
| 出版年 | |
| 出版地 | |
| 関連情報 | |
| 概要 | This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 16-18, 1989. In addition to papers pre...sented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency.続きを見る |
| 目次 | Contents: Invited Presentations Contributed Papers: Semantics 1. Computational Geometry. Structures. Automata Theory. Parallel Algorithms. Complexity 1. Complexity 2. Distributed Computing. Fault Tolerance. Semantics 2. Completeness. Concurrency. Formal Languages. Graph Algorithms Systems Author Index. |
| 冊子版へのリンク | http://hdl.handle.net/2324/1000929119 |
| 本文を見る |
Full text available from SpringerLINK Lecture Notes in Computer Science (2015) Full text available from SpringerLINK Lecture Notes in Computer Science Archive (Through 1996) |
詳細
| レコードID | |
|---|---|
| 主題 | |
| SSID | |
| eISBN | |
| 登録日 | 2020.06.27 |
| 更新日 | 2020.06.28 |