Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Adventures Between Lower Bounds and Higher Altitudes
This Festschrift volume is published in honor of Juraj Hromkovič on the occasion of his 60th birthday. Juraj Hromkovič is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education. The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovič’s research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.
An Introduction to Online Computation
This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
Algorithmic Aspects of Bioinformatics
This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. After introducing the basics of molecular biology and algorithmics, Part I explains string algorithms and alignments; Part II details the field of physical mapping and DNA sequencing; and Part III examines the application of algorithmics to the analysis of biological data. Exciting application examples include predicting the spatial structure of proteins, and computing haplotypes from genotype data. Figures, chapter summaries, detailed derivations, and examples, are provided.
Computation, Cooperation, and Life
Gheorghe Păun has played an important role within a wide range of disciplines, from the foundations of traditional computation theory and formal language theory to research gaining its inspiration from living nature. He has significantly contributed to the development of these diverse fields, initiating and pioneering some of them with remarkable imaginativeness and enthusiasm. Gheorghe Păun’s research focusses on systems inspired by structures and processes found in living systems, with the field of membrane computing or P systems being the most important of his initiatives. This Festschrift volume, published to honor Gheorghe Păun on the occasion of his 60th birthday, includes 16 cont...
Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting. The 32 revised full papers presented together with the abstract of a keynote talk were carefully reviewed and selected from 81 submissions. All current issues of algorithms in bioinformatics are addressed, reaching from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. The topics range in biological applicability from genome mapping, to sequence assembly, to microarray quality, to phylogenetic inference, to molecular modeling.
Algorithms and Complexity
The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21...
SOFSEM 2016: Theory and Practice of Computer Science
This book constitutes the proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016, held in Harrachov, Czech Republic, in January 2016. The 43 full papers presented in this volume were carefully reviewed and selected from 116 submissions. They are organized in topical sections named: foundations of computer science; software engineering: methods, tools, applications; and data, information, and knowledge engineering. The volume also contains 7 invited talks in full paper length.
Rainbow of Computer Science
This volume is dedicated to Hermann Maurer on his 70th birthday. Topics include Automata, Formal Languages and Computability to various aspects of the Practice of Computer Science, as well as from Algorithmics to Learning.
Computing with New Resources
Professor Jozef Gruska is a well known computer scientist for his many and broad results. He was the father of theoretical computer science research in Czechoslovakia and among the first Slovak programmers in the early 1960s. Jozef Gruska introduced the descriptional complexity of grammars, automata, and languages, and is one of the pioneers of parallel (systolic) automata. His other main research interests include parallel systems and automata, as well as quantum information processing, transmission, and cryptography. He is co-founder of four regular series of conferences in informatics and two in quantum information processing and the Founding Chair (1989-96) of the IFIP Specialist Group on Foundations of Computer Science.
