| 書目名稱 | Computing and Combinatorics | | 副標(biāo)題 | 17th Annual Internat | | 編輯 | Bin Fu,Ding-Zhu Du | | 視頻video | http://file.papertrans.cn/235/234771/234771.mp4 | | 概述 | Up-to-date results.Fast-track conference proceedings.State-of-the-art research | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing. | | 出版日期 | Conference proceedings 2011 | | 關(guān)鍵詞 | algorithmic geometry; algorithmic learning; combinatorial optimization; discrete mathematics; graph algo | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-22685-4 | | isbn_softcover | 978-3-642-22684-7 | | isbn_ebook | 978-3-642-22685-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag GmbH Berlin Heidelberg 2011 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 05:47
發(fā)表于 2025-3-21 19:12:38
