Gems of Theoretical Computer Science, Uwe Sch?ning; R. Pruim; Randall J. Pruim
Автор: Dingzhu Du; Lian Li; En Zhu; Kun He Название: Theoretical Computer Science ISBN: 9811068925 ISBN-13(EAN): 9789811068928 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed proceedings of the National Conference of Theoretical Computer Science, NCTCS 2017, held in Wuhan, Hubei, China, in October 2017. They present relevant trends of current research in the area of algorithms and complexity, software theory and method, data science and machine learning theory.
Автор: Cristian S. Calude; Michael J. Dinneen; Vincent Va Название: Discrete Mathematics and Theoretical Computer Science ISBN: 3540405054 ISBN-13(EAN): 9783540405054 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The refereed proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS 2003, held in Dijon, France, in July 2003.The 18 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 35 submissions.
Автор: John Fitzgerald; Anne E. Haxthausen; Husnu Yenigun Название: Theoretical Aspects of Computing - ICTAC 2008 ISBN: 3540857613 ISBN-13(EAN): 9783540857617 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Includes the refereed proceedings of the 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 held in Istanbul, Turkey in September 2008. This book contains 27 papers that were selected from over 70 submissions. It intends to bring together practitioners and researchers from academia to present research results.
Автор: Martin Leucker; Charles Carroll Morgan Название: Theoretical Aspects of Computing - ICTAC 2009 ISBN: 3642034659 ISBN-13(EAN): 9783642034657 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 6th International Colloquium Kuala Lumpur Malaysia August 1620 2009 Proceedings. .
Автор: 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.
Автор: Mohammad Reza Mousavi; Ji?? Sgall Название: Topics in Theoretical Computer Science ISBN: 3319689525 ISBN-13(EAN): 9783319689524 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the Second IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2017, held in Tehran, Iran, in September 2017. The 8 papers presented in this volume were carefully reviewed and selected from 20 submissions.
Автор: Josep Diaz; Ivan Lanese; Davide Sangiorgi Название: Theoretical Computer Science ISBN: 3662446014 ISBN-13(EAN): 9783662446010 Издательство: Springer Рейтинг: Цена: 10202.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 8th FIP WG 2.2 International Conference, TCS 2014, held in Rome, Italy, in September 2014.
Описание: Besides attractive invited papers the volume contains carefully reviewed submitted papers on the following topics: Automata and Formal Languages, Graph Algorithms and Geometric Algorithms, Distributed Computing, Parallel Algorithms, Database Theory, Logic Programming, Programming Methodology, Theory of Algorithms, Semantics and Complexity.
Автор: 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.
Автор: A. Ershov; V.A. Nepomniaschy Название: International Symposium on Theoretical Programming ISBN: 3540067205 ISBN-13(EAN): 9783540067207 Издательство: Springer Рейтинг: Цена: 4890.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Wil Michiels; Emile Aarts; Jan Korst Название: Theoretical Aspects of Local Search ISBN: 3642071481 ISBN-13(EAN): 9783642071485 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Local search has been applied successfully to a diverse collection of optimization problems. It provides the reader with a coherent overview of the achievements obtained so far, and serves as a source of inspiration for the development of novel results in the challenging field of local search.
Автор: Christian S. Calude; Vladimiro Sassone Название: Theoretical Computer Science ISBN: 3642423116 ISBN-13(EAN): 9783642423116 Издательство: Springer Рейтинг: Цена: 12857.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
