Sökt på: Sökresultat
totalt 23 träffar
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 Novy, Smokovec, Slovakia in …
Algorithmics for Hard Problems
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, …
Algorithmics for Hard Problems
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, …
Stochastic Algorithms: Foundations and Applications
This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers …
Teaching Fundamental Concepts of Informatics
The International Conference on Informatics in Secondary Schools: Evolution and Perspective (ISSEP) is an emerging forum for researchers and practitioners in the area of computer …
Graph-Theoretic Concepts in Computer Science
The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. …
Dissemination of Information in Communication Networks
Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly …
Algorithmics for Hard Problems
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer technologies. Because of this, the …
Graph-Theoretic Concepts in Computer Science
Communication Complexity and Parallel Computing
The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of …
Communication Complexity and Parallel Computing
The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of …
Dissemination of Information in Communication Networks
Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly …