1 option
Computer 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 Raskhodnikova.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- Lecture notes in computer science 1611-3349 ; 13296
- Lecture Notes in Computer Science, 1611-3349 ; 13296
- Language:
- English
- Subjects (All):
- Computer science.
- Theory of Computation.
- Local Subjects:
- Theory of Computation.
- Physical Description:
- 1 online resource (XVI, 351 pages) : 54 illustrations, 38 illustrations in color.
- Edition:
- 1st ed. 2022.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2022.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-031-09574-0
- 9783031095740
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.