Computer Science - Theory and Applications
17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings
Published on 24. June 2022
Book
Paperback/Softback
XVI, 351 pages
978-3-031-09573-3 (ISBN)
Description
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.
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.
More details
Series
Edition
1st ed. 2022
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
16 s/w Abbildungen, 38 farbige Abbildungen
XVI, 351 p. 54 illus., 38 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 20 mm
Weight
557 gr
ISBN-13
978-3-031-09573-3 (9783031095733)
DOI
10.1007/978-3-031-09574-0
Schweitzer Classification
Other editions
Additional editions
Alexander S. Kulikov | Sofya Raskhodnikova
Computer Science - Theory and Applications
17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings
E-Book
06/2022
Springer
€80.24
Available for download
Content
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.