國立高雄大學圖資館 |

登入

回首頁

Algorithms and complexity13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and complexityedited by Marios Mavronicolas.
其他題名:	13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023 : proceedings /
其他題名:	CIAC 2023
其他作者:	Mavronicolas, Marios.
團體作者:
出版者:	Cham :Springer International Publishing :2023.
面頁冊數:	xi, 400 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Algorithms
電子資源:	https://doi.org/10.1007/978-3-031-30448-4
ISBN:	9783031304484$q(electronic bk.)

Algorithms and complexity13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023 : proceedings /
Algorithms and complexity13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023 : proceedings /[electronic resource] :CIAC 2023edited by Marios Mavronicolas. - Cham :Springer International Publishing :2023. - xi, 400 p. :ill., digital ;24 cm. - Lecture notes in computer science,138980302-9743 ;. - Lecture notes in computer science ;4891..

This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13-16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.

ISBN: 9783031304484$q(electronic bk.)

Standard No.: 10.1007/978-3-031-30448-4doiSubjects--Topical Terms:

253943
Algorithms

LC Class. No.: QA76.9.A43 / I58 2023

Dewey Class. No.: 518.1

Algorithms and complexity13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023 : proceedings /
LDR:02416nmm a2200337 a 4500 001 642652
003 DE-He213
005 20230424212634.0
006 m d
007 cr nn 008maaau
008 231123s2023 sz s 0 eng d
020 $a 9783031304484$q(electronic bk.)
020 $a 9783031304477$q(paper)
024 7 $a 10.1007/978-3-031-30448-4 $2 doi
035 $a 978-3-031-30448-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b I58 2023
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA76.9.A43 $b I61 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Algorithms and complexity $h [electronic resource] : $b 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023 : proceedings / $c edited by Marios Mavronicolas.
246 3 $a CIAC 2023
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a xi, 400 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13898
520 $a This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13-16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.
650 0 $a Algorithms $3 253943
650 0 $a Computational complexity $3 253942
650 1 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Computer System Implementation. $3 276333
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Mavronicolas, Marios. $3 280318
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-30448-4
950 $a Computer Science (SpringerNature-11645)