A new approach to the first theory course
ACM SIGACT News
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Computational power of pipelined memory hierarchies
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Optimal organizations for pipelined hierarchical memories
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Neural circuits for pattern recognition with small total wire length
Theoretical Computer Science - Natural computing
Programming Models for Cluster Computing
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Space and Access Complexity of Computation DAGs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
The Complexity of Symmetry-Breaking Formulas
Annals of Mathematics and Artificial Intelligence
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
On the computational power of circuits of spiking neurons
Journal of Computer and System Sciences
Wire length as a circuit complexity measure
Journal of Computer and System Sciences
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Evaluation of design strategies for stochastically assembled nanoarray memories
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On the Computational Power of Winner-Take-All
Neural Computation
Delay optimization of linear depth boolean circuits with prescribed input arrival times
Journal of Discrete Algorithms
The delay of circuits whose inputs have specified arrival times
Discrete Applied Mathematics
Models for parallel and hierarchical computation
Proceedings of the 4th international conference on Computing frontiers
Internet as a multiple graph structure: The role of the transport layer
Information Security Tech. Report
Timing optimization by restructuring long combinatorial paths
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Supporting tasks with adaptive groups in data parallel programming
International Journal of Computational Science and Engineering
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
A unified model for multicore architectures
IFMT '08 Proceedings of the 1st international forum on Next-generation multicore/manycore technologies
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
On approximating the ideal random access machine by physical machines
Journal of the ACM (JACM)
Cache-optimal algorithms for option pricing
ACM Transactions on Mathematical Software (TOMS)
Evaluating multicore algorithms on the unified memory model
Scientific Programming - Software Development for Multi-core Computing Systems
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Upper and lower I/O bounds for pebbling r-pyramids
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
One-time computable self-erasing functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Efficient stack distance computation for priority replacement policies
Proceedings of the 8th ACM International Conference on Computing Frontiers
Transition function complexity of finite automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Key-evolution schemes resilient to space-bounded leakage
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Strong I/O lower bounds for binomial and FFT computation graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The Depth of Resolution Proofs
Studia Logica
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the incompressibility of monotone DNFs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Upper and lower I/O bounds for pebbling r-pyramids
Journal of Discrete Algorithms
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
A lower bound technique for communication on BSP with application to the FFT
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
Development and Evaluation of Distributed Simulation of Embedded Systems Using Ptolemy and HLA
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
Hi-index | 0.00 |
From the Publisher:Your book fills the gap which all of us felt existed too long. Congratulations on this excellent contribution to our field." --Jan van Leeuwen, Utrecht University "This is an impressive book. The subject has been thoroughly researched and carefully presented. All the machine models central to the modern theory of computation are covered in depth; many for the first time in textbook form. Readers will learn a great deal from the wealth of interesting material presented." --Andrew C. Yao, Professor of Computer Science, Princeton University "Models of Computation" is an excellent new book that thoroughly covers the theory of computation including significant recent material and presents it all with insightful new approaches. This long-awaited book will serve as a milestone for the theory community." --Akira Maruoka, Professor of Information Sciences, Tohoku University "This is computer science." --Elliot Winard, Student, Brown University In Models of Computation: Exploring the Power of Computing, John Savage re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint reflects a pedagogy motivated by the growing importance of computational models that are more realistic than the abstract ones studied in the 1950s, '60s and early '70s. Assuming onlysome background in computer organization, Models of Computation uses circuits to simulate machines with memory, thereby making possible an early discussion of P-complete and NP-complete problems. Circuits are also used to demonstrate that tradeoffs between parameters of computation, such as space and time, regulate all computations by machines with memory. Full coverage of formal languages and automata is included along with a substantive treatment of computability. Topics such as space-time tradeoffs, memory hierarchies, parallel computation, and circuit complexity, are integrated throughout the text with an emphasis on finite problems and concrete computational models FEATURES: Includes introductory material for a first course on theoretical computer science. Builds on computer organization to provide an early introduction to P-complete and NP-complete problems. Includes a concise, modern presentation of regular, context-free and phrase-structure grammars, parsing, finite automata, pushdown automata, and computability. Includes an extensive, modern coverage of complexity classes. Provides an introduction to the advanced topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity, with parallelism integrated throughout. Contains over 200 figures and over 400 exercises along with an extensive bibliography. ** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at ...