000 03761nam a22005055i 4500
001 978-3-031-09574-0
003 DE-He213
005 20240423125327.0
007 cr nn 008mamaa
008 220623s2022 sz | s |||| 0|eng d
020 _a9783031095740
_9978-3-031-09574-0
024 7 _a10.1007/978-3-031-09574-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputer Science – Theory and Applications
_h[electronic resource] :
_b17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings /
_cedited by Alexander S. Kulikov, Sofya Raskhodnikova.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXVI, 351 p. 54 illus., 38 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13296
505 0 _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.
520 _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.
650 0 _aComputer science.
650 1 4 _aTheory of Computation.
700 1 _aKulikov, Alexander S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRaskhodnikova, Sofya.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031095733
776 0 8 _iPrinted edition:
_z9783031095757
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13296
856 4 0 _uhttps://doi.org/10.1007/978-3-031-09574-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c176732
_d176732