Theoretical Aspects of Distributed Compu
โ Sotiris E. Nikoletseas
๐ Library
๐ English
โฆ LIBER โฆ
๐
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series)
โ Scribed by Herbert Edelsbrunner
- Year
- 2004
- Tongue
- English
- Leaves
- 438
- Edition
- 1
- Category
- Library
โฌ Acquire This Volume
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Fundamentals of Algebraic Graph Transfor
โ Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, Gabriele Taentzer
๐ Library
๐
2006
๐ Springer
๐ English
<p><span>Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of th
DNA Computing: New Computing Paradigms (
๐
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
โ Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
๐ Library
๐
2010
๐ Springer
๐ English
Parameterized Complexity Theory (Texts i
โ J. Flum, M. Grohe
๐ Library
๐
2006
๐ Springer
๐ English
<p><span>Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniqu
Parameterized Complexity Theory (Texts i
โ J. Flum, M. Grohe
๐ Library
๐
2006
๐ Springer
๐ English
Elements of Finite Model Theory (Texts i
โ Leonid Libkin
๐ Library
๐
2004
๐ Springer
๐ English
<span>Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other a