Computer Science - Theory and Applications de Alexander S. Kulikov

Computer Science - Theory and Applications: Lecture Notes in Computer Science, cartea 13296

Alexander S. Kulikov

Sofya Raskhodnikova

en Limba Engleză Paperback – 24 iun 2022

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 558^.53 lei
20%

Preț: 571^.88 lei
20%

Preț: 675^.83 lei
20%

Preț: 1020^.28 lei
20%

Preț: 620^.33 lei
20%

Preț: 560^.93 lei
20%

Preț: 633^.70 lei
20%

Preț: 678^.21 lei
20%

Preț: 1359^.66 lei
20%

Preț: 560^.93 lei
20%

Preț: 733^.68 lei
20%

Preț: 793^.92 lei
15%

Preț: 558^.12 lei
20%

Preț: 793^.92 lei
20%

Preț: 560^.93 lei
20%

Preț: 748^.63 lei
20%

Preț: 562^.49 lei
20%

Preț: 1246^.46 lei
20%

Preț: 449^.81 lei
20%

Preț: 556^.96 lei
20%

Preț: 562^.49 lei
20%

Preț: 851^.78 lei
20%

Preț: 313^.10 lei
18%

Preț: 945^.44 lei
20%

Preț: 314^.86 lei
20%

Preț: 560^.93 lei
20%

Preț: 313^.87 lei
20%

Preț: 1033^.45 lei
20%

Preț: 563^.29 lei
20%

Preț: 733^.68 lei
20%

Preț: 1137^.10 lei
20%

Preț: 735^.28 lei
20%

Preț: 1079^.23 lei
20%

Preț: 560^.11 lei
20%

Preț: 791^.54 lei
15%

Preț: 672^.87 lei
20%

Preț: 1032^.47 lei
20%

Preț: 617^.17 lei
20%

Preț: 1022^.15 lei
20%

Preț: 984^.64 lei
20%

Preț: 620^.33 lei
20%

Preț: 979^.25 lei
20%

Preț: 402^.28 lei
20%

Preț: 316^.28 lei
20%

Preț: 636^.06 lei
20%

Preț: 320^.24 lei
20%

Preț: 328^.94 lei

Specificații

ISBN-13: 9783031095733
ISBN-10: 3031095731
Pagini: 368
Ilustrații: XVI, 351 p. 54 illus., 38 illus. in color.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:1st edition 2022
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.