This paper gives a personal account of some developments in automata theory and computational complexity theory. Though the account is subjective and deals primarily with the research areas of direct interest to the author, it discusses the underlying beliefs and philosophy which guided this research as well as the intellectual environment and the ideas and contacts which influenced it. An attempt is also made to draw some general conclusions about computer science research and to discuss the nature of theoretical computer science
The book brings into relief the variety of approaches and disciplines that have informed the quest f...
Computation as a mechanical reality is young - almost exactly seventy years of age - and yet the spi...
Undergraduate Colloquium presents Karl Wimmer,Assistant Professor, Mathematics, Duquesne University,...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
Some aspects of the prehistory and the background of Theoretical Computer Science are discussed. We ...
Exploration of the connections between computational complexity, descriptive complexity, and logic r...
This article focuses not on computer science but on computational science. First we will elucidate s...
This collection of recent papers on computational complexity theory grew out of activities during a ...
This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Aw...
This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding w...
grantor: University of TorontoThis thesis highlights the intellectual origins of theoretic...
We devote this issue of the Scientific Annals of Computer Science to the 11th International Colloqui...
Prospects for research in theoretical computer science are discussed. The maintenance of a genuine l...
Learn the skills and acquire the intuition to assess the theoretical limitations of computer program...
The newly emerging branch of research of Computer Science received encouragement from the successors...
The book brings into relief the variety of approaches and disciplines that have informed the quest f...
Computation as a mechanical reality is young - almost exactly seventy years of age - and yet the spi...
Undergraduate Colloquium presents Karl Wimmer,Assistant Professor, Mathematics, Duquesne University,...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
Some aspects of the prehistory and the background of Theoretical Computer Science are discussed. We ...
Exploration of the connections between computational complexity, descriptive complexity, and logic r...
This article focuses not on computer science but on computational science. First we will elucidate s...
This collection of recent papers on computational complexity theory grew out of activities during a ...
This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Aw...
This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding w...
grantor: University of TorontoThis thesis highlights the intellectual origins of theoretic...
We devote this issue of the Scientific Annals of Computer Science to the 11th International Colloqui...
Prospects for research in theoretical computer science are discussed. The maintenance of a genuine l...
Learn the skills and acquire the intuition to assess the theoretical limitations of computer program...
The newly emerging branch of research of Computer Science received encouragement from the successors...
The book brings into relief the variety of approaches and disciplines that have informed the quest f...
Computation as a mechanical reality is young - almost exactly seventy years of age - and yet the spi...
Undergraduate Colloquium presents Karl Wimmer,Assistant Professor, Mathematics, Duquesne University,...