國立虎尾科技大學 |

LATIN 2022: Theoretical Informatics = 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	LATIN 2022: Theoretical Informatics/ edited by Armando Castañeda, Francisco Rodríguez-Henríquez.
其他題名:	15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings /
其他作者:	Rodríguez-Henríquez, Francisco.
面頁冊數:	XVI, 780 p. 174 illus., 113 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Discrete Mathematics in Computer Science. -
電子資源:	https://doi.org/10.1007/978-3-031-20624-5
ISBN:	9783031206245

LATIN 2022: Theoretical Informatics = 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings /
LATIN 2022: Theoretical Informatics15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings /[electronic resource] :edited by Armando Castañeda, Francisco Rodríguez-Henríquez. - 1st ed. 2022. - XVI, 780 p. 174 illus., 113 illus. in color.online resource. - Lecture Notes in Computer Science,135681611-3349 ;. - Lecture Notes in Computer Science,9324.

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

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

ISBN: 9783031206245

Standard No.: 10.1007/978-3-031-20624-5doiSubjects--Topical Terms:

670123
Discrete Mathematics in Computer Science.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

LATIN 2022: Theoretical Informatics = 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings /
LDR:05145nam a22004095i 4500 001 1084852
003 DE-He213
005 20221028160150.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031206245 $9 978-3-031-20624-5
024 7 $a 10.1007/978-3-031-20624-5 $2 doi
035 $a 978-3-031-20624-5
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a LATIN 2022: Theoretical Informatics $h [electronic resource] : $b 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings / $c edited by Armando Castañeda, Francisco Rodríguez-Henríquez.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XVI, 780 p. 174 illus., 113 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Computer Science, $x 1611-3349 ; $v 13568
505 0 $a Algorithms 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 $a This 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 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computer and Information Systems Applications. $3 1365732
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer Communication Networks. $3 669310
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Application software. $3 528147
650 0 $a Information theory. $3 595305
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer networks . $3 1365720
650 0 $a Computer science. $3 573171
700 1 $a Rodríguez-Henríquez, Francisco. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1255354
700 1 $a Castañeda, Armando. $e editor. $1 https://orcid.org/0000-0002-8017-8639 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1391235
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031206238
776 0 8 $i Printed edition: $z 9783031206252
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-20624-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)