You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98, held in Taejon, Korea, in December 1998. The 47 revised full papers presented were carefully reviewed and selected from a total of 102 submissions. The book is divided in topical sections on computational geometry, complexity, graph drawing, online algorithms and scheduling, CAD/CAM and graphics, graph algorithms, randomized algorithms, combinatorial problems, computational biology, approximation algorithms, and parallel and distributed algorithms.
Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial intelligence. Research in proof complexity and feasible theories of arithmetic aims at understanding not only whether or not logical inferences can be made but also what resources are required to carry them out. Understanding the resources required for logical inferences has major implications for some of the most important problems in computational complexity, particularly the problem of whether or not NP is equal to co-NP. In addition, these have important implications for the efficiency of automate...
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).
This book constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and structural complexity, automata and formal languages, and logic in computer science.
This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002.The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented.
The area of biologically inspired computing, or biological computation, involves the development of new, biologically based techniques for solving difficult computational problems. A unified overview of computer science ideas inspired by biology, Biological Computation presents the most fundamental and significant concepts in this area. In the book, students discover that bacteria communicate, that DNA can be used for performing computations, how evolution solves optimization problems, that the way ants organize their nests can be applied to solve clustering problems, and what the human immune system can teach us about protecting computer networks. The authors discuss more biological example...
This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.
This book constitutes the refereed proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005, held in Palma de Mallorca, Spain, in September 2005 in the context of the combined conference ALGO 2005. The 75 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 244 submissions. The papers address all current issues in algorithmics reaching from design and mathematical issues over real-world applications in various fields up to engineering and analysis of algorithms.
The refereed post-proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies are presented in this volume. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches. The 46 full papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics.
Security and Privacy in the Age of Uncertainty covers issues related to security and privacy of information in a wide range of applications including: *Secure Networks and Distributed Systems; *Secure Multicast Communication and Secure Mobile Networks; *Intrusion Prevention and Detection; *Access Control Policies and Models; *Security Protocols; *Security and Control of IT in Society. This volume contains the papers selected for presentation at the 18th International Conference on Information Security (SEC2003) and at the associated workshops. The conference and workshops were sponsored by the International Federation for Information Processing (IFIP) and held in Athens, Greece in May 2003.