› › Mathematical Foundations Of Computer Science 2009

Mathematical Foundations of Computer Science 2009

Author : Rastislav Královič

Publisher : Springer Science & Business Media

Page : 773 pages

File Size : 12,49 MB

Release : 2009-08-06

Category : Computers

ISBN : 3642038158

Get eBook

Book Description

This book constitutes the refereed proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009, held in Novy Smokovec, High Tatras, Slovakia, in August 2009. The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning 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, theoretical issues in artificial intelligence.



Mathematical Foundations of Computer Science 2010

Author : Petr Hlineny

Publisher : Springer

Page : 730 pages

File Size : 33,13 MB

Release : 2010-08-14

Category : Computers

ISBN : 3642151558

Get eBook

Book Description

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.



Mathematical Foundations of Computer Science 2011

Author : Filip Murlak

Publisher : Springer Science & Business Media

Page : 630 pages

File Size : 42,8 MB

Release : 2011-08-09

Category : Computers

ISBN : 3642229921

Get eBook

Book Description

This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 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.



Mathematical Foundations of Computer Science 2015

Author : Giuseppe F. Italiano

Publisher : Springer

Page : 633 pages

File Size : 36,60 MB

Release : 2015-08-10

Category : Computers

ISBN : 3662480549

Get eBook

Book Description

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).





Mathematical Foundations of Computer Science 2012

Author : Branislav Rovan

Publisher : Springer

Page : 852 pages

File Size : 38,2 MB

Release : 2012-08-01

Category : Computers

ISBN : 3642325890

Get eBook

Book Description

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.



Mathematical Foundations of Computer Science 2013

Author : Krishnendu Chatterjee

Publisher : Springer

Page : 869 pages

File Size : 38,1 MB

Release : 2013-08-16

Category : Computers

ISBN : 3642403131

Get eBook

Book Description

This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.



Theoretical and Mathematical Foundations of Computer Science

Author : Qihai Zhou

Publisher : Springer

Page : 629 pages

File Size : 23,8 MB

Release : 2011-10-29

Category : Computers

ISBN : 364224999X

Get eBook

Book Description

This book constitutes the refereed post-proceedings of the Second International Conference on Theoretical and Mathematical Foundations of Computer Science, ICTMF 2011, held in Singapore in May 2011. The conference was held together with the Second International Conference on High Performance Networking, Computing, and Communication systems, ICHCC 2011, which proceedings are published in CCIS 163. The 84 revised selected papers presented were carefully reviewed and selected for inclusion in the book. The topics covered range from computational science, engineering and technology to digital signal processing, and computational biology to game theory, and other related topices.



Theoretical Aspects of Distributed Computing in Sensor Networks

Author : Sotiris Nikoletseas

Publisher : Springer Science & Business Media

Page : 904 pages

File Size : 44,65 MB

Release : 2011-01-15

Category : Computers

ISBN : 3642148492

Get eBook

Book Description

Wireless ad hoc sensor networks has recently become a very active research subject. Achieving efficient, fault-tolerant realizations of very large, highly dynamic, complex, unconventional networks is a real challenge for abstract modelling, algorithmic design and analysis, but a solid foundational and theoretical background seems to be lacking. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks. The intended audience includes researchers and graduate students working on sensor networks, and the broader areas of wireless networking and distributed computing, as well as practitioners in the relevant application areas. The book can also serve as a text for advanced courses and seminars.



Algorithmic Randomness

Author : Johanna N. Y. Franklin

Publisher : Cambridge University Press

Page : 371 pages

File Size : 28,98 MB

Release : 2020-05-07

Category : Mathematics

ISBN : 1108808271

Get eBook

Book Description

The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field.