Skip header Section
Skip Bibliometrics Section
Foundations of Computer ScienceDecember 1994
- Authors:
- Alfred V. Aho,
- Jeffrey D. Ullman
Abstract
No abstract available.
Cited By
Aho A and Ullman J (2022). Abstractions, their algorithms, and their compilers, Communications of the ACM, 65:2, (76-91), Online publication date: 1-Feb-2022.- Black A (2019). Importance sampling for partially observed temporal epidemic models, Statistics and Computing, 29:4, (617-630), Online publication date: 1-Jul-2019.
- Afrati F, Sharma S, Ullman J and Ullman J Computing Marginals Using MapReduce Proceedings of the 20th International Database Engineering & Applications Symposium, (12-23)
- Cook C, Drachova S, Hallstrom J, Hollingsworth J, Jacobs D, Krone J and Sitaraman M A systematic approach to teaching abstraction and mathematical modeling Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education, (357-362)
- Haberman B, Averbuch H and Ginat D Is it really an algorithm Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education, (74-78)
- Haberman B, Averbuch H and Ginat D (2005). Is it really an algorithm, ACM SIGCSE Bulletin, 37:3, (74-78), Online publication date: 1-Sep-2005.
- nakano S and Uno T Generating colored trees Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science, (249-260)
- Sufatrio and Yap R Improving host-based IDS with argument abstraction to prevent mimicry attacks Proceedings of the 8th international conference on Recent Advances in Intrusion Detection, (146-164)
- Haberman B (2004). High-School Students' Attitudes Regarding Procedural Abstraction, Education and Information Technologies, 9:2, (131-145), Online publication date: 1-Jun-2004.
- Nakano S and Uno T Constant time generation of trees with specified diameter Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science, (33-45)
- O'Boyle M and Stöhr E (2002). Compile Time Barrier Synchronization Minimization, IEEE Transactions on Parallel and Distributed Systems, 13:6, (529-543), Online publication date: 1-Jun-2002.
- Surma D and Sha E (2000). Communication Reduction in Multiple Multicasts Based on Hybrid Static-Dynamic Scheduling, IEEE Transactions on Parallel and Distributed Systems, 11:9, (865-878), Online publication date: 1-Sep-2000.
Recommendations
Laying the foundations for computer science
This paper has three primary goals:
- Stimulate the discussion of possible skills which might be incorporated into the K-12 curriculum in order to provide students with a foundation for the study of computer science.
- Stimulate the discussion of strategies ...
On teaching theoretical foundations of computer science
Theoretical foundations of Computer Science (Automata Theory, Complexity, Formal Languages...) are taught almost everywhere within Computer Science curricula. However little effort is usually done to present this material in an integrated and motivated ...