| Título : |
LATIN 2018: Theoretical Informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Bender, Michael A., ; Farach-Colton, Martín, ; Mosteiro, Miguel A., |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2018 |
| Número de páginas: |
XVII, 889 p. 142 ilustraciones |
| ISBN/ISSN/DL: |
978-3-319-77404-6 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Algoritmos Ingeniería Informática Red de computadoras Informática Inteligencia artificial Gráficos de computadora Ingeniería Informática y Redes Matemáticas de la Computación Ciencia de los datos |
| Índice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas del 13° Simposio Latinoamericano de Informática Teórica, LATIN 2018, celebrado en Buenos Aires, Argentina, en abril de 2018. Los 63 artículos presentados en este volumen fueron cuidadosamente revisados y seleccionados entre 161 presentaciones. El Simposio está dedicado a diferentes áreas de la informática teórica, que incluyen, entre otras: algoritmos (de aproximación, en línea, aleatorios, teoría algorítmica de juegos, etc.), combinatoria analítica y análisis de algoritmos, teoría de autómatas y lenguajes formales, teoría de la codificación. y compresión de datos, algoritmos combinatorios, optimización combinatoria, combinatoria y teoría de grafos, teoría de la complejidad, álgebra computacional, biología computacional, geometría computacional, teoría computacional de números, criptología, bases de datos y recuperación de información, estructuras de datos, métodos formales y seguridad, Internet y la web , computación paralela y distribuida, coincidencia de patrones, teoría de lenguajes de programación y estructuras aleatorias. |
| Nota de contenido: |
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness -- Approximate Correlation Clustering Using Same-Cluster Queries -- Finding tight Hamilton cycles in random hypergraphs faster -- Walking Through Waypoints -- Lower Bounds for Online Matching on the Line -- On the complexity of _nding internally vertex-disjoint long directed paths -- Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets -- A Polynomial Sized Kernel for Tracking Paths Problem -- Time-Space Trade-O_s for Computing Euclidean Minimum Spanning Trees -- Approximate nearest neighbor for lp-spaces (2 < p < ) via embeddings -- The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model -- Partitioning Orthogonal Histograms into Rectangular Boxes -- Compact Self-Stabilizing Leader Election for General Networks -- Random Walks with Multiple Step Lengths -- Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set -- A tight bound for shortest augmenting paths on trees -- Approximation Algorithms for Replenishment Problems with Fixed Turnover Times -- Maximum Box Problem on Stochastic Points -- The Online Set Aggregation Problem -- Agglomerative Clustering of Growing Squares -- Fourier Entropy-Inuence Conjecture for Random Linear Threshold Functions -- Property Suffix Array with Applications -- Competitive Algorithms for Demand Response Management in Smart Grid -- An Average-Case Lower Bound against ACC^0 -- Compressed Indexing with Signature Grammars -- Combinatorics of Beacon-based Routing in Three Dimensions -- On split B1-EPG graphs -- Efficient algorithms for computing a minimal homology basis -- Shifting the Phase Transition Threshold for Random Graphs using Degree Set Constraints -- On the Biased Partial Word Collector Problem -- Constructive Ramsey Numbers For Loose Hyperpaths -- Cache Oblivious Sparse Matrix Multiplication -- Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading -- Probabilistic Analysis of Online (Class-constrained) Bin Packing and Bin Covering -- Locating the eigenvalues for graphs of small clique-width -- On the Approximation Ratio of Lempel-Ziv Parsing -- Kernelization for Maximum Happy Vertices Problem -- When is Red-Blue Nonblocker FPT -- Incremental Strong Connectivity and 2-Connectivity in Directed Graphs -- Efficient Algorithms for Listing K Disjoint st-Paths in Graphs -- Transversals of longest cycles in chordal and bounded tree-width graphs -- Majority Model on Random Regular Graphs -- Property testing for point sets on the plane -- Maximal and Convex Layers of Random Point Sets -- Plane Gossip: Approximating rumor spread in planar graphs -- Algorithms and Bounds for Very Strong Rainbow Coloring -- New Integer Linear Programming Models for the Vertex Coloring Problem -- Submodular maximization with uncertain knapsack capacity -- Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time -- Recognizinggeneralized transmission graphs of line segments and circular sectors -- A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game -- The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue -- Satisfying neighbor preferences on a circle -- Two-dimensional Knapsack for Circles -- Scheduling Parallelizable Jobs Online to Maximize Throughput -- Reactive Proximity Data Structures for Graphs -- Mutants and Residents with Different Connection Graphs in the Moran Process -- A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs -- Rapid Mixing of k-Class Biased Permutations -- Transition Operations over Plane Trees -- Analysis of the Continued Logarithm Algorithm -- Quadratic Simulations of Merlin-Arthur Games -- On Counting Perfect Matchings in General Graphs. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
LATIN 2018: Theoretical Informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings [documento electrónico] / Bender, Michael A., ; Farach-Colton, Martín, ; Mosteiro, Miguel A., . - 1 ed. . - [s.l.] : Springer, 2018 . - XVII, 889 p. 142 ilustraciones. ISBN : 978-3-319-77404-6 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Algoritmos Ingeniería Informática Red de computadoras Informática Inteligencia artificial Gráficos de computadora Ingeniería Informática y Redes Matemáticas de la Computación Ciencia de los datos |
| Índice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas del 13° Simposio Latinoamericano de Informática Teórica, LATIN 2018, celebrado en Buenos Aires, Argentina, en abril de 2018. Los 63 artículos presentados en este volumen fueron cuidadosamente revisados y seleccionados entre 161 presentaciones. El Simposio está dedicado a diferentes áreas de la informática teórica, que incluyen, entre otras: algoritmos (de aproximación, en línea, aleatorios, teoría algorítmica de juegos, etc.), combinatoria analítica y análisis de algoritmos, teoría de autómatas y lenguajes formales, teoría de la codificación. y compresión de datos, algoritmos combinatorios, optimización combinatoria, combinatoria y teoría de grafos, teoría de la complejidad, álgebra computacional, biología computacional, geometría computacional, teoría computacional de números, criptología, bases de datos y recuperación de información, estructuras de datos, métodos formales y seguridad, Internet y la web , computación paralela y distribuida, coincidencia de patrones, teoría de lenguajes de programación y estructuras aleatorias. |
| Nota de contenido: |
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness -- Approximate Correlation Clustering Using Same-Cluster Queries -- Finding tight Hamilton cycles in random hypergraphs faster -- Walking Through Waypoints -- Lower Bounds for Online Matching on the Line -- On the complexity of _nding internally vertex-disjoint long directed paths -- Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets -- A Polynomial Sized Kernel for Tracking Paths Problem -- Time-Space Trade-O_s for Computing Euclidean Minimum Spanning Trees -- Approximate nearest neighbor for lp-spaces (2 < p < ) via embeddings -- The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model -- Partitioning Orthogonal Histograms into Rectangular Boxes -- Compact Self-Stabilizing Leader Election for General Networks -- Random Walks with Multiple Step Lengths -- Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set -- A tight bound for shortest augmenting paths on trees -- Approximation Algorithms for Replenishment Problems with Fixed Turnover Times -- Maximum Box Problem on Stochastic Points -- The Online Set Aggregation Problem -- Agglomerative Clustering of Growing Squares -- Fourier Entropy-Inuence Conjecture for Random Linear Threshold Functions -- Property Suffix Array with Applications -- Competitive Algorithms for Demand Response Management in Smart Grid -- An Average-Case Lower Bound against ACC^0 -- Compressed Indexing with Signature Grammars -- Combinatorics of Beacon-based Routing in Three Dimensions -- On split B1-EPG graphs -- Efficient algorithms for computing a minimal homology basis -- Shifting the Phase Transition Threshold for Random Graphs using Degree Set Constraints -- On the Biased Partial Word Collector Problem -- Constructive Ramsey Numbers For Loose Hyperpaths -- Cache Oblivious Sparse Matrix Multiplication -- Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading -- Probabilistic Analysis of Online (Class-constrained) Bin Packing and Bin Covering -- Locating the eigenvalues for graphs of small clique-width -- On the Approximation Ratio of Lempel-Ziv Parsing -- Kernelization for Maximum Happy Vertices Problem -- When is Red-Blue Nonblocker FPT -- Incremental Strong Connectivity and 2-Connectivity in Directed Graphs -- Efficient Algorithms for Listing K Disjoint st-Paths in Graphs -- Transversals of longest cycles in chordal and bounded tree-width graphs -- Majority Model on Random Regular Graphs -- Property testing for point sets on the plane -- Maximal and Convex Layers of Random Point Sets -- Plane Gossip: Approximating rumor spread in planar graphs -- Algorithms and Bounds for Very Strong Rainbow Coloring -- New Integer Linear Programming Models for the Vertex Coloring Problem -- Submodular maximization with uncertain knapsack capacity -- Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time -- Recognizinggeneralized transmission graphs of line segments and circular sectors -- A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game -- The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue -- Satisfying neighbor preferences on a circle -- Two-dimensional Knapsack for Circles -- Scheduling Parallelizable Jobs Online to Maximize Throughput -- Reactive Proximity Data Structures for Graphs -- Mutants and Residents with Different Connection Graphs in the Moran Process -- A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs -- Rapid Mixing of k-Class Biased Permutations -- Transition Operations over Plane Trees -- Analysis of the Continued Logarithm Algorithm -- Quadratic Simulations of Merlin-Arthur Games -- On Counting Perfect Matchings in General Graphs. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsquedaAlgorithms for Sensor Systems / Fernández Anta, Antonio ; Jurdzinski, Tomasz ; Mosteiro, Miguel A. ; Zhang, Yanyong
