Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Structural Information and Communication Complexity
This book constitutes the refereed proceedings of the 11th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2004, held in Smolenice Castle, Slowakia in June 2004. The 26 revised full papers presented were carefully reviewed and selected from 56 submissions. Among the topics addressed are WDM networks, optical networks, ad-hoc networking, computational graph theory, graph algorithms, radio networks, routing, shortest-path problems, searching, labelling, distributed algorithms, communication networks, approximation algorithms, wireless networks, scheduling, NP completeness, Byzantine environments
Combinatorial Algorithms
This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
Modern Aspects of Classical Automata Theory
Regular languages have a wide area of applications. This makes it an important task to convert between different forms of regular language representations, and to compress the size of such representations. This book studies modern aspects of compressions and conversions of regular language representations. The first main part presents methods for lossy compression of classical finite automata. Lossy compression allows to reduce the size of a language representation below the limits of classical compression methods, by the cost of introducing tolerable errors to the language. The complexity of many problems related to compression with respect to different error profiles is classified. The other main part is devoted to the study of biautomata, which were recently introduced as a new descriptional model for regular languages. Although biautomata are in many ways similar to finite automata, this book carves out some notable differences. While classical methods for finite automata can successfully be applied to biautomata, one observes a drastic increase of the computational complexity when considering lossy compression for biautomata.
Mathematical Foundations of Computer Science 2006
This book constitutes the refereed proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006. The book presents 62 revised full papers together with the full papers or abstracts of 7 invited talks. All current aspects in theoretical computer science and its mathematical foundations are addressed, from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry and more.
SOFSEM 2011: Theory and Practice of Computer Science
This book constitutes the refereed proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011, held in Nový, Smokovec, Slovakia in January 2011. The 41 revised full papers, presented together with 5 invited contributions, were carefully reviewed and selected from 122 submissions. SOFSEM 2011 was organized around the following four tracks: foundations of computer science; software, systems, and services; processing large datasets; and cryptography, security, and trust.
SOFSEM 2019: Theory and Practice of Computer Science
This book constitutes the refereed proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2019, held in Nový Smokovec, Slovakia, in January 2019. The 34 full papers presented together with 6 invited talks were carefully reviewed and selected from 92 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2019: Foundations of theoretical Computer Science, foundations of data science and engineering, and foundations of software engineering.
Structural Information and Communication Complexity
This book constitutes the refereed conference proceedings of the 27th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2020, held in Paderborn, Germany, in June 2020.* The 19 full papers and 2 invited papers presented in this book were carefully reviewed and selected from 41 submissions. They are divided into seven sections, i.e. invited papers; mobile robots; dynamic graphs; network communication; multi-agent systems; communication complexity; and game theory. * The conference was held virtually due to the COVID-19 pandemic.
Structural Information and Communication Complexity
This book constitutes the refereed proceedings of the 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007, held in Castiglioncello, Italy in June 2007. The 23 revised full papers and four invited talks cover graph exploration, fault tolerance, distributed algorithms and data structures, location problems, wireless networks, fault tolerance, as well as parallel computing and selfish routing.
Mathematical Foundations of Computer Science 2009
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.
Teaching Fundamental Concepts of Informatics
This book constitutes the refereed proceedings of the fourth International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, held in Zurich, Switzerland in January 2010. The 14 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 32 submissions. A broad variety of topics related to teaching informatics in secondary schools is addressed ranging from national experience reports to paedagogical and methodological issues. Contributions solicited cover a variety of topics including but not limited to accessibility, assessment, classroom management, communication skills, computer science contests, computers an...
