03687nam 22005415 450 991058017740332120251225212324.03-031-09574-X10.1007/978-3-031-09574-0(MiAaPQ)EBC7021583(Au-PeEL)EBL7021583(CKB)23981275400041(PPN)268857296(BIP)84667925(BIP)84362292(DE-He213)978-3-031-09574-0(EXLCZ)992398127540004120220623d2022 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierComputer Science – Theory and Applications 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings /edited by Alexander S. Kulikov, Sofya Raskhodnikova1st ed. 2022.Cham :Springer International Publishing :Imprint: Springer,2022.1 online resource (364 pages)Lecture Notes in Computer Science,1611-3349 ;13296Print version: Kulikov, Alexander S. Computer Science - Theory and Applications Cham : Springer International Publishing AG,c2022 9783031095733 Includes bibliographical references and index.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 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.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.Lecture Notes in Computer Science,1611-3349 ;13296Computer scienceTheory of ComputationComputer science.Theory of Computation.004004Kulikov Alexander S.Raskhodnikova SofyaMiAaPQMiAaPQMiAaPQBOOK9910580177403321Computer Science - Theory and Applications2889860UNINA