You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Les recherches en cryptographie se sont développées en France ces dernières années du fait de la nécessité de développer la sécurité de tous les échanges informatiques. Toutes les industries ainsi que les administrations sont concernées par ce développement : la sécurité des échanges informatiques ainsi que l’e-administration sont des exemples dans lesquels peut intervenir la cryptographie. Et les fonctions booléennes, en particulier, jouent un rôle central dans le design de la plupart des crypto-systèmes symétriques et leur sécurité. L’ouvrage en anglais, fruit d’un colloque international tenu à Roeun, fait le point sur ces différents systèmes.
This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.
This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.
This book constitutes revised selected papers from the 20th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2014, held in Himeji, Japan, in July 2014. The 10 regular papers included in this volume were carefully reviewed and selected from a total of 25 submissions. It also contains one invited talk in full paper length.
This book constitutes the refereed proceedings of the 5th International Conference on Machines, Computations, and Universality, MCU 2007, held in Orleans, France, September 2007. The 18 revised full papers presented together with nine invited papers cover Turing machines, register machines, word processing, cellular automata, tiling of the plane, neural networks, molecular computations, BSS machines, infinite cellular automata, real machines, and quantum computing.
Cellular automata are regular uniform networks of locally-connected finite-state machines. They are discrete systems with non-trivial behaviour. Cellular automata are ubiquitous: they are mathematical models of computation and computer models of natural systems. The book presents results of cutting edge research in cellular-automata framework of digital physics and modelling of spatially extended non-linear systems; massive-parallel computing, language acceptance, and computability; reversibility of computation, graph-theoretic analysis and logic; chaos and undecidability; evolution, learning and cryptography. The book is unique because it brings together unequalled expertise of inter-disciplinary studies at the edge of mathematics, computer science, engineering, physics and biology.
This book constitutes the refereed proceedings of the 8th International Conference on Cellular Automata for Research and Industry, ACRI 2008, held in Yokohama, Japan, in September 2008. The 43 revised full papers and 22 revised poster papers presented together with 4 invited lectures were carefully reviewed and selected from 78 submissions. The papers focus on challenging problems and new research not only in theoretical but application aspects of cellular automata, including cellular automata tools and computational sciences. The volume also contains 11 extended abstracts dealing with crowds and cellular automata, which were presented during the workshop C&CA 2008. The papers are organized in topical sections on CA theory and implementation, computational theory, physical modeling, urban, environmental and social modeling, pedestrian and traffic flow modeling, crypto and security, system biology, CA-based hardware, as well as crowds and cellular automata.
Professor Jozef Gruska is a well known computer scientist for his many and broad results. He was the father of theoretical computer science research in Czechoslovakia and among the first Slovak programmers in the early 1960s. Jozef Gruska introduced the descriptional complexity of grammars, automata, and languages, and is one of the pioneers of parallel (systolic) automata. His other main research interests include parallel systems and automata, as well as quantum information processing, transmission, and cryptography. He is co-founder of four regular series of conferences in informatics and two in quantum information processing and the Founding Chair (1989-96) of the IFIP Specialist Group on Foundations of Computer Science.
This book constitutes the proceedings of the 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014, held in Krakow, Poland, in September 2014. The 67 full papers and 7 short papers presented in this volume were carefully reviewed and selected from 125 submissions. They are organized in topical sections named: theoretical results on cellular automata; cellular automata dynamics and synchronization; modeling and simulation with cellular automata; cellular automata-based hardware and computing; cryptography, networks and pattern recognition with cellular automata. The volume also contains contributions from ACRI 2014 workshops on crowds and cellular automata; asynchronous cellular automata; traffic and cellular automata; and agent-based simulation and cellular automata.
This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%. The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.