000 06156nam a22006255i 4500
001 978-3-031-20624-5
003 DE-He213
005 20240730170352.0
007 cr nn 008mamaa
008 221028s2022 sz | s |||| 0|eng d
020 _a9783031206245
_9978-3-031-20624-5
024 7 _a10.1007/978-3-031-20624-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aLATIN 2022: Theoretical Informatics
_h[electronic resource] :
_b15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings /
_cedited by Armando Castañeda, Francisco Rodríguez-Henríquez.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXVI, 780 p. 174 illus., 113 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13568
505 0 _aAlgorithms and Data Structures -- Cutting a tree with Subgraph Complementation is hard, except for some small trees -- Elastic-Degenerate String Matching with 1 Error -- Median and Hybrid Median K-Dimensional Trees -- Weighted Connected Matchings -- Space-efficient data structure for next/previous larger/smaller value queries -- Near-Optimal Search Time in &-Optimal Space -- Computing and Listing Avoidable Vertices and Paths -- Klee's Measure Problem Made Oblivious -- Approximation Algorithms -- A parameterized approximation algorithm for the Multiple Allocation k-Hub Center -- Theoretical analysis of git bisect -- Pathlength of Outerplanar graphs -- Approximations for the Steiner Multicycle Problem -- Approximation Schemes for Packing Problems with `p-norm Diversity Constraints -- Obtaining Approximately Optimal and Diverse Solutions via Dispersion -- Cryptography -- On APN functions whose graphs are maximal Sidon sets -- On the subfield codes of a subclass of optimal cyclic codes and their covering structures -- Social Choice Theory -- Multidimensional Manhattan Preferences -- Theoretical Machine Learning -- Exact Learning of Multitrees and Almost-Trees Using Path Queries -- Almost Optimal Proper Learning and Testing Polynomials -- Estimating the Clustering Coefficient using Sample Complexity Analysis -- Automata Theory and Formal Languages -- Binary completely reachable automata -- Conelikes and Ranker Comparisons -- The Net Automaton of a Rational Expression -- Embedding arbitrary Boolean circuits into fungal automata -- How many times do you need to go back to the future in Unary Temporal Logic? -- String Attractors and Infinite Words -- Combinatorics and Graph Theory -- On the Zero-sum Ramsey Problem over Zd2 -- On x-diperfect digraphs with stability number two -- Percolation and Epidemic Processes in One-Dimensional Small-World Networks -- A combinatorial link between labelled graphs and increasingly labelled Schroder trees -- Min orderings and list homomorphism dichotomies for signed and unsigned graphs -- On the Zombie number of various graph classes -- Patterns in ordered (random) matchings -- Tree 3-spanners on generalized prisms of graphs -- A General Approach to Ammann Bars for Aperiodic Tilings -- Complexity Theory -- List Homomorphism: Beyond the Known Boundaries -- On the closures of monotone algebraic classes and variants of the Determinant -- MCSP is Hard for Read-Once Nondeterministic Branching Programs -- Bounds on oblivious multiparty quantum communication complexity -- Improved Parallel Algorithms for Generalized Baumslag Groups -- Computational Geometry -- Piercing Pairwise Intersecting Convex Shapes in the Plane -- Local routing algorithms on Euclidean spanners with small diameter -- On r-Guarding SCOTs - a New Family of Orthogonal Polygons -- Complexity Results on Untangling Red-Blue Matchings -- On Vertex Guarding Staircase Polygons -- On the Complexity of Half-Guarding Monotone Polygons.
520 _aThis book constitutes the proceedings of the 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry. Chapter "Klee's Measure Problem Made Oblivious" is available open access under a CC BY 4.0 license.
650 0 _aComputer science.
_99832
650 0 _aComputer networks .
_931572
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aApplication software.
_993034
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aTheory of Computation.
_993035
650 2 4 _aComputer Communication Networks.
_993036
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer and Information Systems Applications.
_993037
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aCastañeda, Armando.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_993038
700 1 _aRodríguez-Henríquez, Francisco.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_993039
710 2 _aSpringerLink (Online service)
_993040
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031206238
776 0 8 _iPrinted edition:
_z9783031206252
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13568
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-20624-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86873
_d86873