Author: R. Ramanujam
Publisher: Springer Science & Business Media
ISBN: 3540304959
Category : Computers
Languages : en
Pages : 580
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 25th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005, held in Hyderabad, India, in December 2005. The 38 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 167 submissions. A broad variety of current topics from the theory of computing are addressed, ranging from software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, and automata theory to theoretical computer science in general.
Author: R. Ramanujam
Publisher: Springer
ISBN: 3540324194
Category : Computers
Languages : en
Pages : 580
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 25th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005, held in Hyderabad, India, in December 2005. The 38 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 167 submissions. A broad variety of current topics from the theory of computing are addressed, ranging from software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, and automata theory to theoretical computer science in general.
Author: Vijay Chandru
Publisher: Springer Science & Business Media
ISBN: 9783540620341
Category : Computers
Languages : en
Pages : 408
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 16th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS '96, held in Hyderabad, India, in December 1996. The volume presents 28 revised full papers selected from a total of 98 submissions; also included are four invited contributions. The papers are organized in topical sections on computational geometry, process algebras, program semantics, algorithms, rewriting and equational-temporal logics, complexity theory, and type theory.
Author: Luca Aceto
Publisher: Springer
ISBN: 3540330461
Category : Computers
Languages : en
Pages : 459
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, held in Vienna, Austria in March 2006 as part of ETAPS. The 28 revised full papers presented together with one invited paper were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections.
Author: Orna Kupferman
Publisher: Springer Nature
ISBN: 3031308298
Category : Computers
Languages : en
Pages : 575
Get Book Here
Book Description
This open access book constitutes the proceedings of the 26th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023. The 26 regular papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
Author: Tiziana Calamoneri
Publisher: Springer Science & Business Media
ISBN: 354034375X
Category : Computers
Languages : en
Pages : 404
Get Book Here
Book Description
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
Author: Bart Jacobs
Publisher: Springer
ISBN: 3662496305
Category : Computers
Languages : en
Pages : 548
Get Book Here
Book Description
This book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads.
Author:
Publisher:
ISBN:
Category : Computer software
Languages : en
Pages : 556
Get Book Here
Book Description
Author: Alexei Myasnikov
Publisher: Springer Science & Business Media
ISBN: 3764388269
Category : Language Arts & Disciplines
Languages : en
Pages : 192
Get Book Here
Book Description
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown that there is a remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. Its elementary exposition makes the book accessible to graduate as well as undergraduate students in mathematics or computer science.
Author: Tayssir Touili
Publisher: Springer Science & Business Media
ISBN: 364214294X
Category : Computers
Languages : en
Pages : 691
Get Book Here
Book Description
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.
