You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume constitutes the refereed proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, held in Brno, Czech Republic, in August 2010. The 56 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 149 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.
This book constitutes the refereed proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, held in Brno, Czech Republic in August 2002.The 32 revised full papers presented together with abstracts of seven invited contributions were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on verification and model checking, logic, mobility, probabilistic systems, models of computation and process algebra, security, Petri nets, and bisimulation.
This volume contains the papers presented at the 4th International Workshop on Reachability Problems, RP 2010 held during August 28–29, 2010 in the F- ulty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010 (35th InternationalSymposiums on Mathem- ical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). RP 2010 was the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in 2007. TheReachabilityProblemsworkshopsseriesaimsatgatheringtogethersch- ars from diverse disciplines ...
This volume contains the post-proceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computer-aided analysis and verification, applications of game theory in computer science, networks and security, modern trends of graph theory in computer science, electronic systems design and testing, and quantum information processing.
This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.
This book constitutes the proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014, held in Sydney, Australia, in November 2014. The 29 revised papers presented in this volume were carefully reviewed and selected from 76 submissions. They show current research on theoretical and practical aspects of automated analysis, verification and synthesis by providing an international forum for interaction among the researchers in academia and industry.
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.
A pioneering volume addressing issues related to cultures, ideologies, and the dictionary. A cross-cultural and cross-linguistic study with focus on selected Western and non-Western languages. A number of in-depth case studies illustrates the dominant role ideology and other types of bias play in the making of a dictionary. The volume includes invited papers of 40 internationally recognized scholars.