Norman E. Gibbs

Affiliations:
  • Carnegie Mellon University, USA


According to our database1, Norman E. Gibbs authored at least 31 papers between 1969 and 1994.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1994
Education: Past, Present, Future (Abstract).
Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1990
Graduate Programs in Software Engineering.
Proceedings of the Software Engineering Education, 1990

1989
The education programme of the Software Engineering Institute, Carnegie Mellon University.
Softw. Eng. J., 1989

A Master of Software Engineering Curriculum: Recommendations from the Software Engineering Institute.
Computer, 1989

The SEI Education Program: The Challenge of Teaching Future Software Engineers.
Commun. ACM, 1989

The SEI Education Program: Strategy and Accomplishments.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

Is the Time Right for an Undergraduate Software Engineering Degree?
Proceedings of the Software Engineering Education, 1989

1986
A Model Curriculum for a Liberal Arts Degree in Computer Science.
Commun. ACM, 1986

The Software Engineering Institute (panel session).
Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

1985
The LameDuck SIG chairman's message: a parting shot at accreditation.
ACM SIGCSE Bull., 1985

A computer science curriculum for liberal arts colleges (panel session).
Proceedings of the 16th SIGCSE Technical Symposium on Computer Science Education, 1985

Liberal arts curriculum and computer science education (Panel Presentation).
Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective: mid-80's perspective, 1985

1984
Accreditation in computer science.
Proceedings of the 15th SIGCSE Technical Symposium on Computer Science Education, 1984

1983
Accreditation in the computing sciences (Panel Session).
Proceedings of the 14th SIGCSE Technical Symposium on Computer Science Education, 1983

Computer Science and Computer Science Education.
Proceedings of the Information Processing 83, 1983

Software productivity measurement.
Proceedings of the American Federation of Information Processing Societies: 1983 National Computer Conference, 1983

1982
The bandwidth problem for graphs and matrices - a survey.
J. Graph Theory, 1982

1981
Computer science - too many students, too many majors (Panel Discussion).
Proceedings of the 12th SIGCSE Technical Symposium on Computer Science Education, 1981

1977
An introductory computer science course for all majors.
Proceedings of the 8th SIGCSE Technical Symposium on Computer Science Education, 1977

1976
A Comparison of Several Bandwidth and Profile Reduction Algorithms.
ACM Trans. Math. Softw., 1976

Algorithm 509: A Hybrid Profile Reduction Algorithm [F1].
ACM Trans. Math. Softw., 1976

Algorithm 508: Matrix Bandwidth and Profile Reduction [F1].
ACM Trans. Math. Softw., 1976

SIGCSE (Paper Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

Curriculum recommendations in computer science (Panel Discussion).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

SIGCSE (Panel Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1975
Generation of All the Cycles of a Graph from a Set of Basic Cycles [H] (Algorithm 492).
Commun. ACM, 1975

Basic Cycle Generation [H] (Algorithm 491).
Commun. ACM, 1975

1974
The heart of computer science.
ACM SIGCSE Bull., 1974

Tridiagonalization by Permutations.
Commun. ACM, 1974

1970
A planarity algorithm based on the Kuratowski theorem.
Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1970 Spring Joint Computer Conference, 1970

1969
A Cycle Generation Algorithm for Finite Undirected Linear Graphs.
J. ACM, 1969


  Loading...