Data processing and computer science theory

Authors:
A. T. Berztiss
Affiliations:
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA
Venue:
SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
Year:
1983

Citing 10
Cited 1

Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
The Complexity of Trie Index Construction

Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs

Journal of the ACM (JACM)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
The Science of Programming

The Science of Programming
Formal Specifications of Programming Language: A Panoramic Primer

Formal Specifications of Programming Language: A Panoramic Primer
Functional Programming

Functional Programming
Data Structures and Algorithms

Data Structures and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori

Fundamentals of Computer Alori

What should be the mission of four year undergraduate programs in information systems?

SIGCSE '85 Proceedings of the sixteenth SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Theoretical results have had much greater impact on computing practice than we are normally aware of, and the practical significance of theoretical results can be expected to become more prominent in the future. We discuss the past and present significance for data processing specialists of some results in analysis of algorithms, languages, and program proofs, and argue for a greater emphasis on computer science theory in data processing curricula.