Cantitate/Preț
Produs
Total produse
Vezi coșul
LATIN 2022: Theoretical Informatics de Armando Castañeda

LATIN 2022: Theoretical Informatics: Lecture Notes in Computer Science

Editat de Armando Castañeda, Francisco Rodríguez-Henríquez
en Limba Engleză Paperback – 29 oct 2022
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.


Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 59258 lei

Preț vechi: 74074 lei
-20% Nou

Puncte Express: 889
Preț estimativ în valută:
10484€ • 12214$ • 9155£

Carte tipărită la comandă

Livrare economică 19 ianuarie-02 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031206238
ISBN-10: 3031206231
Pagini: 796
Ilustrații: XVI, 780 p. 174 illus., 113 illus. in color.
Dimensiuni: 155 x 235 x 43 mm
Greutate: 1.18 kg
Ediția:1st edition 2022
Editura: Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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