Algebraic Informatics, Traian Muntean; Robert Rolland; Dimitrios Poulakis

Автор: Andreas Maletti
Название: Algebraic Informatics
ISBN: 3319230204 ISBN-13(EAN): 9783319230207
Издательство: Springer
Рейтинг:
Цена: 6708.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 6th International Conference on Algebraic Informatics, CAI 2015, held in Stuttgart, Germany, in September 2015. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. The papers cover topics such as data models and coding theory;

Автор: Branislav Rovan
Название: SOFSEM `98: Theory and Practice of Informatics
ISBN: 3540652604 ISBN-13(EAN): 9783540652601
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: 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 E^f(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*(2^p)-Time Algorithm and a Polynomial Kernel.- Independent set of convex polygons: from n^Ɛ to 1 + Ɛ via shrinking.

Автор: Symeon Bozapalidis; George Rahonis
Название: Algebraic Informatics
ISBN: 354075413X ISBN-13(EAN): 9783540754138
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the proceedings of the Second International Conference on Algebraic Informatics, CAI 2007, held in Thessaloniki, Greece, in May 2007. This book covers topics such as algebraic semantics on graphs and trees, formal power series, syntactic objects, algebraic picture processing, and infinite computation.

Автор: Symeon Bozapalidis; George Rahonis
Название: Algebraic Informatics
ISBN: 3642035639 ISBN-13(EAN): 9783642035630
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 3rd International Conference on Algebraic Informatics CAI 2009 Thessaloniki Greece Mai 1922 2009. .

Автор: Andrei Voronkov; Irina Virbitskaite
Название: Perspectives of System Informatics
ISBN: 3662468220 ISBN-13(EAN): 9783662468227
Издательство: Springer
Рейтинг:
Цена: 8944.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book contains the thoroughly refereed papers from the 9th International Ershov Informatics Conference, PSI 2014, held in St. Petersburg, Russia, in June 2014. The 17 revised full papers, 11 revised short papers, and 2 system and experimental papers presented in this book were carefully reviewed and selected from 80 submissions.

Автор: Bernhard Steffen; Oliver R?thing; Michael Huth
Название: Mathematical Foundations of Advanced Informatics
ISBN: 3319683969 ISBN-13(EAN): 9783319683966
Издательство: Springer
Рейтинг:
Цена: 4611.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions.This textbook is suitable for undergraduate and graduate courses in computer science and for self-study.

Автор: Leszek Pacholski; Peter Ruzicka
Название: SOFSEM 2001: Theory and Practice of Informatics
ISBN: 3540429123 ISBN-13(EAN): 9783540429128
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Contains the proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics, held in Piestany in 2001. It includes 12 lectures, one keynote paper and 18 research papers, spanning the range of informatics with emphasis on trends in informatics, and enabling technologies.

Автор: M. Elena Renda; Miroslav Bursa; Andreas Holzinger;
Название: Information Technology in Bio- and Medical Informatics
ISBN: 3319227408 ISBN-13(EAN): 9783319227405
Издательство: Springer
Рейтинг:
Цена: 5590.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Custom and ritual, or their Hebrew equivalent minhag, has intrigued rabbis and scholars for generations. Here, Simcha Fishbane treats minhag from a socio-anthropological perspective. She discusses the theory and model of minhagim, using the Mishnah Berurah and the Arukh Hashulkhan, analyses rabbinic texts concerned with custom, and describes current rituals from a socio-anthropological viewpoint.

Автор: Andy Sloane; Felix van Rijn
Название: Home Informatics and Telematics
ISBN: 1475754159 ISBN-13(EAN): 9781475754155
Издательство: Springer
Рейтинг:
Цена: 20962.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume is composed of the best papers submitted to the HOIT2000 conference held in Wolverhampton, U.

Автор: Claudio L. Lucchesi; Arnaldo V. Moura
Название: LATIN`98: Theoretical Informatics
ISBN: 3540642757 ISBN-13(EAN): 9783540642756
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A presentation of 28 papers, organized in sections on: algorithms and complexity; automata, transition systems and combinatorics; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing.