Page 2
Page 2
Developments in language theory ; 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings
Basic Notions of Reaction Systems / A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms / Algebraic and Topological Models for DNA Recombinant Processes / Contributed Papers : Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet / On Competence in CD Grammar Systems / The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels, and other
Developments in Language Theory ; 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008.
Developments in Language Theory ; 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.
Cryptanalytic Attacks on RSA
RSA is a public-key cryptographic system, and is the most famous and widely-used cryptographic system in today's digital world. Cryptanalytic Attacks on RSA, a professional book, covers almost all major known cryptanalytic attacks and defenses of the RSA cryptographic system and its variants.
Computing and Combinatorics ; Vol. 4112 ; 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.
Computing and combinatorics ; Vol. 3595 ; 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings
The papers in this volume were presented at theEleventh Annual InternationalComputing and Combinatorics Conference(COCOON 2005), The topics cover most aspects of theoretical computerscience and combinatorics related to computing.Submissions to the conference this year were conducted electronically. A totalof 353 papers were submitted, of which 96 were accepted.
Combinatorial optimization and applications ; 2nd International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008.
Combinatorial optimization and applications ; 1st International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
This book presented feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
Logic, language, information and computation ; 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings
The Workshop on Logic, Language, Information and Computation (WoLLIC) is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. The WoLLIC meetings alternate between Brazil (and Latin America) and other countries, with the aim of fostering interest in applied logic among Latin Am- ican scientists and students, and facilitating their interaction with the international - plied logic community.
List decoding of error-correcting codes : Winning thesis of the 2002 ACM doctoral dissertation competition
Presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specifically, it shows how the notion of “list-decoding” can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background : error-correcting codes are combinatorial str- tures that show how to represent (or “encode”) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem, called the decoding problem : compute the message from a corrupted codeword, when the number of errors is less than d/2.
LATIN 2008 : Theoretical Informatics ; 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings
The Latin American Theoretical INformatics Symposium (LATIN) is becoming a traditional and high-quality conference on the Theory of Computing. Previous conferences havebeen organized twiceinBrazil: SaoPaulo (1992) and Campinas (1998); twice in Chile: Valpara so (1995) and Valdivia (2006); once in Uruguay: Punta del Este (2000); once in Mexico: Cancun (2002); and once in Argentina: Buenos Aires (2004). This volume contains the proceedings of the 8th Latin American Theore- cal INformatics Symposium (LATIN 2008), which was held in Buzio s, Rio de Janeiro, Brazil, April 7 11, 2008.
Computation Engineering : Applied Automata Theory and Logic
This book covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.
Computation and Logic in the Real World ; 3rd Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings
This volume, Computation and Logic in the Real World, is the proceedings of the third in a series of conferences of CiE Computability in Europe, (CiE) is an informal network working on computability theory including its foundations, technical development, and applications. It performed with discrete or continuous data by all kinds of algorithms, programs, and machines. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning.
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Approximation, randomization, and combinatorial optimization algorithms and techniques ; 9th International Workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, embeddings and metric space methods, and more.
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 8th international workshop on approximation algorithms for compinatorial optimization problems, APPROX 2005 and 9th international workshop on randomization and computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings
This volume contains the papers presented at the 8th International Workshopon Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2005) and the 9th International Workshop on Randomization andComputation (RANDOM 2005), APPROX focuses on algorith-mic and complexity issues surrounding the development of efficient approximatesolutions to computationally hard problems, RANDOM isconcerned with applications of randomness to computational and combinatorialproblems, The volume contains 20 contributed papers selected by the APPROX Pro-gram
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the field. It focuses on algorithmic and complexity aspects ar- ing in the development of eficient approximate solutions to computationally dificult problems.
Algorithms and computation ; 15th international symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
This volume contains the proceedings of the 15th Annual International Sym- sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 2004. ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation. aftar review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation.
