LEADER 03687nam  22005415  450 
001 9910580177403321
005 20251225212324.0
010   $a3-031-09574-X
024 7 $a10.1007/978-3-031-09574-0
035   $a(MiAaPQ)EBC7021583
035   $a(Au-PeEL)EBL7021583
035   $a(CKB)23981275400041
035   $a(PPN)268857296
035   $a(BIP)84667925
035   $a(BIP)84362292
035   $a(DE-He213)978-3-031-09574-0
035   $a(EXLCZ)9923981275400041
100   $a20220623d2022      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aComputer Science ? Theory and Applications $e17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 ? July 1, 2022, Proceedings /$fedited by Alexander S. Kulikov, Sofya Raskhodnikova
205   $a1st ed. 2022.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022.
215   $a1 online resource (364 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13296
311 08$aPrint version: Kulikov, Alexander S. Computer Science - Theory and Applications Cham : Springer International Publishing AG,c2022 9783031095733 
320   $aIncludes bibliographical references and index.
327   $aOptimization-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 andFinite 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v13296
606   $aComputer science
606   $aTheory of Computation
615  0$aComputer science.
615 14$aTheory of Computation.
676   $a004
676   $a004
702   $aKulikov$b Alexander S.
702   $aRaskhodnikova$b Sofya
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910580177403321
996   $aComputer Science - Theory and Applications$92889860
997   $aUNINA