國立高雄大學圖資館 |

登入

回首頁

Computer sciencetheory and applications : 17th International Computer Science Symposium in Russia, CSR 2022, virtual event, June 29-July 1, 2022 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computer scienceedited by Alexander S. Kulikov, Sofya Raskhodnikova.
其他題名:	theory and applications : 17th International Computer Science Symposium in Russia, CSR 2022, virtual event, June 29-July 1, 2022 : proceedings /
其他題名:	CSR 2022
其他作者:	Kulikov, Alexander.
團體作者:
出版者:	Cham :Springer International Publishing :2022.
面頁冊數:	xvi, 351 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer science
電子資源:	https://doi.org/10.1007/978-3-031-09574-0
ISBN:	9783031095740$q(electronic bk.)

Computer sciencetheory and applications : 17th International Computer Science Symposium in Russia, CSR 2022, virtual event, June 29-July 1, 2022 : proceedings /
Computer sciencetheory and applications : 17th International Computer Science Symposium in Russia, CSR 2022, virtual event, June 29-July 1, 2022 : proceedings /[electronic resource] :CSR 2022edited by Alexander S. Kulikov, Sofya Raskhodnikova. - Cham :Springer International Publishing :2022. - xvi, 351 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,132960302-9743 ;. - Lecture notes in computer science ;4891..

Optimization-friendly generic mechanisms without money -- Expanders in Higher Dimensions -- Private frequency estimation via projective geometry -- Parameterized Algorithms for Finding Highly Connected Solution -- Coloring a Dominating Set without Conflicts: q-Subset Square Coloring -- Quotient structures and groups computable in polynomial time -- Parameterized Complexity of List Coloring and Max Coloring -- Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs -- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time -- Kernelization of Same-Size Clustering -- Output Sensitive Fault Tolerant Maximum Matching -- Bounds for Synchronizing Markov Decision Processes -- Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs -- Discrete versions of the KKM lemma and their PPAD-completeness -- The Fast Algorithm for Online k-server Problem on Trees -- Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields -- Bounds for the Flock-of-Birds Problem -- Heterogeneous Multi-Commodity Network Flows Over Time -- On the determinization of event-clock input-driven pushdown automata -- optimization -- graph theory -- algorithms -- parameterized complexity -- group theory -- complexity theory -- grammars and context-free languages -- computational geometry -- quantum computation theory.

This book constitutes the proceedings of the 17th International Computer Science Symposium in Russia, CSR 2022, held in St. Petersburg, Russia, June 29-July 3, 2022. The 21 full papers were carefully reviewed and selected from 51 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.

ISBN: 9783031095740$q(electronic bk.)

Standard No.: 10.1007/978-3-031-09574-0doiSubjects--Topical Terms:

252805
Computer science

LC Class. No.: QA75.5 / .I57 2022

Dewey Class. No.: 004

Computer sciencetheory and applications : 17th International Computer Science Symposium in Russia, CSR 2022, virtual event, June 29-July 1, 2022 : proceedings /
LDR:03051nmm a2200361 a 4500 001 625690
003 DE-He213
005 20220623185757.0
006 m d
007 cr nn 008maaau
008 230109s2022 sz s 0 eng d
020 $a 9783031095740$q(electronic bk.)
020 $a 9783031095733$q(paper)
024 7 $a 10.1007/978-3-031-09574-0 $2 doi
035 $a 978-3-031-09574-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .I57 2022
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .I61 2022
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Computer science $h [electronic resource] : $b theory and applications : 17th International Computer Science Symposium in Russia, CSR 2022, virtual event, June 29-July 1, 2022 : proceedings / $c edited by Alexander S. Kulikov, Sofya Raskhodnikova.
246 3 $a CSR 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xvi, 351 p. : $b ill. (some col.), digital ; $c 24 cm.
338 $a online resource $b cr $2 rdacarrier
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13296
505 0 $a Optimization-friendly generic mechanisms without money -- Expanders in Higher Dimensions -- Private frequency estimation via projective geometry -- Parameterized Algorithms for Finding Highly Connected Solution -- Coloring a Dominating Set without Conflicts: q-Subset Square Coloring -- Quotient structures and groups computable in polynomial time -- Parameterized Complexity of List Coloring and Max Coloring -- Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs -- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time -- Kernelization of Same-Size Clustering -- Output Sensitive Fault Tolerant Maximum Matching -- Bounds for Synchronizing Markov Decision Processes -- Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs -- Discrete versions of the KKM lemma and their PPAD-completeness -- The Fast Algorithm for Online k-server Problem on Trees -- Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields -- Bounds for the Flock-of-Birds Problem -- Heterogeneous Multi-Commodity Network Flows Over Time -- On the determinization of event-clock input-driven pushdown automata -- optimization -- graph theory -- algorithms -- parameterized complexity -- group theory -- complexity theory -- grammars and context-free languages -- computational geometry -- quantum computation theory.
520 $a This book constitutes the proceedings of the 17th International Computer Science Symposium in Russia, CSR 2022, held in St. Petersburg, Russia, June 29-July 3, 2022. The 21 full papers were carefully reviewed and selected from 51 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.
650 0 $a Computer science $3 252805
650 1 4 $a Theory of Computation. $3 274475
700 1 $a Kulikov, Alexander. $3 515653
700 1 $a Raskhodnikova, Sofya. $3 929211
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-09574-0
950 $a Computer Science (SpringerNature-11645)