Cantitate/Preț
Produs

Computer Science - Theory and Applications: Lecture Notes in Computer Science

Editat de 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

Preț: 48869 lei

Preț vechi: 61086 lei
-20% Nou

Puncte Express: 733

Preț estimativ în valută:
8646 10073$ 7550£

Carte tipărită la comandă

Livrare economică 19 ianuarie-02 februarie 26

Preluare comenzi: 021 569.72.76

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
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.