Latin 2020: Theoretical Informatics: 14th Latin American Symposium, Sгo Paulo, Brazil, January 5-8, 2021, Proceedings, Kohayakawa Yoshiharu, Miyazawa Flбvio Keidi
Автор: Alejandro L?pez-Ortiz Название: LATIN 2010: Theoretical Informatics ISBN: 3642121993 ISBN-13(EAN): 9783642121999 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The papers contained in this volume were presented at the 9th Latin American TheoreticalInformaticsSymposiumheldattheBenitoJu arezUniversityofO- aca, Oaxaca City, M exico, April 19-23, 2010. The LATIN series of conferences was launched in 1992 to foster the interaction between the Latin American t- oretical computer science community and computer scientists around the world. LATIN 2010wasthe ninth ofa series, after SaoPaulo, Brazil(1992);Valparaiso, Chile (1995); Campinas, Brazil (1998); Punta del Este, Uruguay (2000); C- cun, Mexico (2002); Buenos Aires, Argentina (2004); Valdivia, Chile (2006) and B uzios, Rio de Janeiro, Brazil (2008). From the 155 submissions, the Program Committee selected 56 papers for presentation at the conference. The selectionofpaperswasbasedonoriginality, quality, and relevance to theoretical computer science. It is expected that most of these papers will appear in a more complete and polished form in scienti?c journalsinthefuture.Inadditiontothecontributedpapers, thisvolumecontains the abstracts of four invited plenary talks given at the conference by Cristopher Moore, Piotr Indyk, Sergio Rajsbaum, and Leslie Valiant. A special session on the life and work of the late Imre Simon was held. Prof. Simon played a key role in the development of theoretical computer science in Latin American as well as theLATINconference.ThissessionhadcontributionsfromRicardoBaeza-Yates, John Brzozowski, Volker Diekert, and Jacques Sakarovitch.
Описание: This book constitutes the refereed proceedings of the 19th Symposium on High Performance Computing System, WSCAD 2018, held in Sao Paulo, Brazil, in October 2018. The papers included in this book are organized according to the following topics: cloud computing;
Автор: Evangelos Kranakis; Gonzalo Navarro; Edgar Ch?vez Название: LATIN 2016: Theoretical Informatics ISBN: 3662495287 ISBN-13(EAN): 9783662495285 Издательство: Springer Рейтинг: Цена: 12298.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Reversible Figures and Solids.- Simplicity is in Vogue (again).- Subgame Perfect Equilibrium: Computation and Efficiency.- Buying Stuff Online.- Data Crowdsourcing: Is It for Real.- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.- A Middle Curve Based on Discrete Frйchet Distance.- Comparison-Based FIFO Buffer Management in QoS Switches.- Scheduling on Power-Heterogeneous Processors.- Period Recovery over the Hamming and Edit Distances.- Chasing Convex Bodies and Functions.- Parameterized Lower Bounds and Dichotomy Results for the NP-Completeness of H-Free Edge Modification Problems.- Parameterized Complexity of Red Blue Set Cover for lines.- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.- On Mobile Agent Verifiable Problems.- Computing Maximal Layers Of Points In Ef(n) .- On the Total Number of Bends for Planar Octilinear Drawings.- Bidirectional BWT-Based De Bruijn Graphs.- The Read/Write Protocol Complex is Collapsible.- The I/O Complexity of Computing Prime Tables.-Increasing Diamonds.- Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-Vertex Cover in Bipartite Graphs.- Improved Spanning Ratio for Low Degree Spanners.- Constructing Consistent Digital Line Segments.- Faster Information Gathering in Ad-Hoc Radio Tree Networks.- Stabbing circles for Sets of Segments in the Plane.- Faster Algorithms to Enumerate Hypergraph Transversals.- Listing Acyclic Orientations of Graphs with Single and Multiple Sources.- Linear-Time Sequence Comparison Using Minimal Absent Words.- The Grandmama de Bruijn Sequence for Binary Strings.- Compressing Bounded Degree Graphs.- Random Partial Match Queries in Quad-K-d Trees.- From Discrepancy to Majority.- On the Planar Split Thickness of Graphs.- A Bounded-Risk Mechanism for the Kidney Exchange Game.- Tight Approximations of Degeneracy in Large Graphs.- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.- Bundled Crossings in Embedded Graphs.- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering.- Deterministic Sparse Suffix Sorting on Rewritable Texts.- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Ordering.- Unshuffling Permutations.- Generating Random Spanning Trees via Fast Matrix Multiplication.- Routing in Unit Disk Graphs.- Graph Drawings with One Bend and Few Slopes.- Edge-Editing to a Dense and a Sparse Graph Class.- Containment and Evasion in Stochastic Point Data.- Tree Compression Using String Grammars.- Trees and Languages with Periodic Signature.- Rank Reduction of Directed Graphs by Vertex and Edge Deletions.- New Deterministic Algorithms for Solving Parity Games.- Computing a Geodesic Two-Center of Points in a Simple Polygon.- Simple Approximation Algorithms for Balanced MAX 2SAT.- A Parameterized Algorithm for Mixed-Cut.- (k; n - k)-MAX-CUT: An O*(2p)-Time Algorithm and a Polynomial Kernel.- Independent set of convex polygons: from nƐ to 1 + Ɛ via shrinking.
Автор: Eduardo Sany Laber; Claudson Bornstein; Loana Tito Название: LATIN 2008: Theoretical Informatics ISBN: 3540787720 ISBN-13(EAN): 9783540787723 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This proceedings volume examines a range of topics in theoretical computer science, including automata theory, data compression, logic, machine learning, mathematical programming, parallel and distributed computing, quantum computing and random structures.
Автор: Bender Название: LATIN 2018: Theoretical Informatics ISBN: 3319774034 ISBN-13(EAN): 9783319774039 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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
Описание: This book constitutes the refereed proceedings of the 23rd Brazilian Symposium on Formal Methods, SBMF 2020, which was supposed to take place in Ouro Preto, Brazil, in November 2020.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
