000			03950nam a22004455i 4500
999			_c383133 _d383133 _x1
001			383133
003			ES-MaUEC
005			20240201134319.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220623s2022 sz a s |1|| 0|eng d
020			_a9783031095740
024	7		_a10.1007/978-3-031-09574-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA75.5 _b2022 EB
245	0	0	_aComputer Science - Theory and Applications : _b17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings _cedited by Alexander S. Kulikov, Sofya Raskhodnikova
250			_aFirst edition 2022
264		1	_aCham _bSpringer International Publising _c2022
300			_a1 recurso en línea (XVI, 351 páginas) _b54 ilustraciones, 38 ilustraciones a color
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aLecture Notes in Computer Science _x1611-3349 _v13296
505	0		_aOptimization-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.
520			_aThis 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.
988			_aSpringer_Computer_2022
650		7	_2embne _9139268 _aInformática _vCongresos y asambleas
650		7	_2embne _9146336 _aGrafos, Teoría de _vCongresos y asambleas
650		7	_2embne _9684912 _aAutómatas matemáticos _vCongresos y asambleas
700	1		_aKulikov, Alexander S _eeditor literario _0(orcid)0000-0002-5656-0336 _1https://orcid.org/0000-0002-5656-0336 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aRaskhodnikova, Sofya _eeditor literario _0(orcid)0000-0002-4902-050X _1https://orcid.org/0000-0002-4902-050X _4edt _4http://id.loc.gov/vocabulary/relators/edt
776	0	8	_iPrinted edition: _z9783031095733
776	0	8	_iPrinted edition: _z9783031095757
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-09574-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b10/2022 _dz _esc _zSI