東華大學圖書館 |

LATIN 2022 = theoretical informatics : 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	LATIN 2022/ edited by Armando Castaneda, Francisco Rodriguez-Henriquez.
其他題名:	theoretical informatics : 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022 : proceedings /
其他作者:	Castaneda, Armando.
團體作者:	Latin American Symposium on Theoretical Informatics
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xvi, 780 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Computer science - Congresses. -
電子資源:	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 2022theoretical informatics : 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022 : proceedings /[electronic resource] :edited by Armando Castaneda, Francisco Rodriguez-Henriquez. - Cham :Springer International Publishing :2022. - xvi, 780 p. :ill., digital ;24 cm. - Lecture notes in computer science,135680302-9743 ;. - Lecture notes in computer science ;13568..

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:

606819
Computer science
--Congresses.

LC Class. No.: QA75.5 / .L37 2022

Dewey Class. No.: 004

LATIN 2022 = theoretical informatics : 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022 : proceedings /
LDR:04776nmm a2200337 a 4500 001 2304794
003 DE-He213
005 20221028160150.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031206245 $q (electronic bk.)
020 $a 9783031206238 $q (paper)
024 7 $a 10.1007/978-3-031-20624-5 $2 doi
035 $a 978-3-031-20624-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .L37 2022
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .L357 2022
111 2 $a Latin American Symposium on Theoretical Informatics $n (15th : $d 2022 : $c Guanajuato, Mexico) $3 3607306
245 1 0 $a LATIN 2022 $h [electronic resource] : $b theoretical informatics : 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022 : proceedings / $c edited by Armando Castaneda, Francisco Rodriguez-Henriquez.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xvi, 780 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 0 $a Computer science $v Congresses. $3 606819
650 0 $a Computer science $z Latin America $v Congresses. $3 824389
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Computer Communication Networks. $3 775497
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Computer and Information Systems Applications. $3 3538505
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
700 1 $a Castaneda, Armando. $3 3607307
700 1 $a Rodriguez-Henriquez, Francisco. $3 1619797
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13568. $3 3607308
856 4 0 $u https://doi.org/10.1007/978-3-031-20624-5
950 $a Computer Science (SpringerNature-11645)