The Department of Computer Science at Cornell University, which was organized in 1965, is one of the oldest departments of its kind in the country. It has a full-time faculty of 36, approximately 110 resident Ph.D. graduate students, 100 M.Eng students, and the undergraduate program graduates about 200 C.S. majors each year. The department is typically ranked as one of the top five in the country.

For more information, go to the Computer Science Home Page.

Collections in this community

Recent Submissions

  • A Conversation with David Gries 

    Gries, David; Constable, Robert L. (Internet-First University Press, 2015-07-21)
  • A Conversation with John E. Hopcroft 

    Hopcroft, John E.; Gries, David (Internet-First University Press, 2015-07-21)
    This ACM Turing Award recipient talks about research, textbooks, working with graduate students, his role as a senior statesman of his field and concludes with some words of wisdom.
  • A Conversation with Richard W. Conway 

    Conway, Richard W.; Gries, David (Internet-First University Press, 2015-07-21)
  • A Conversation with Robert L. Constable 

    Constable, Robert L.; Gries, David (Internet-First University Press, 2015-07-21)
  • A Conversation with Anil Nerode 

    Nerode, Anil; Gries, David (Internet-First University Press, 2014-10-16)
  • Flow-Limited Authorization 

    Arden, Owen; Liu, Jed; Myers, Andrew (2015-05-08)
    Because information flow control mechanisms often rely on an underlying authorization mechanism, their security guarantees can be subverted by weaknesses in authorization. Conversely, the security of authorization can ...
  • A Conversation with Juris Hartmanis 

    Hartmanis, Juris (Internet-First University Press, 2010-03-31)
    Juris Hartmanis is video taped in a far-reaching conversation (70 minutes) with colleague David Gries. They discuss Hartmanis’ childhood and family background and his immigration to the United States. Next they trace his ...
  • A Linear List Merging Algorithm 

    Hopcroft, John E.; Ullman, Jeffrey D. (2008-05-14)
    A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of ...
  • On the Modelling Power of Petri Nets 

    Meiling, Erik (Cornell University, 1979-12)
    The behavior of a Petri net is expressed as a formal language. Certain families of Petri net languages are characterized by propositions similar to the classical pumping theorems. The results are used to give examples ...
  • Cand and Cor Before and Then or Else in Ada 

    Gries, David (Cornell University, 1979-11)
  • A Proof Technique for Communicating Sequential Processes(With an Example) 

    Levin, Gary Marc (Cornell University, 1979-11)
    We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. ...
  • On Linear Natural Deduction 

    Leivant, Daniel (Cornell University, 1979-11)
  • The System Architecture for CORE: A Tolerant Program Development Environment 

    Archer, James E., Jr.; Conway, Richard W.; Shore, Andrew I.; Silver, Leonard S. (Cornell University, 1979-10)
    CORE is a program development environment intended primarily to explore a highly tolerant useer interface. In some respects the internal architecture is also novel. It permits a highly interactive and supportive user ...
  • A Program Development System Execution Supervisor 

    Archer, James E., Jr.; Shore, Andrew I. (Cornell University, 1979-10)
    The Cornell Program Development System is an experimental vehicle to explore the applicability of highly cooperative tactics to a contemporary development environment. The CPDS provides significant facilities for modifying ...
  • Quadratic Programming with M-Matrices 

    Luk, Franklin T.; Pagano, Marcello (Cornell University, 1979-10)
    In this paper, we study the problem of quadratic programming with M-matrices. We describe (1) an effective algorithm for the case where the variables are subject to a lower bound constraint, and (2) an analogous algorithm ...
  • Ada/CS - An Instructional Subset of the Programming Language Ada 

    Archer, James E., Jr. (Cornell University, 1979-10)
  • A Unified View of Semantics 

    Majster, Mila E. (Cornell University, 1979-10)
  • Efficient On-Line Construction and Correction of Position Trees 

    Majster, Mila E. (Cornell University, 1979-10)
    This paper presents an on-line algorithm for the construction of position trees, i.e. an algorithm which constructs the position tree for a given string while reading the string from left to right. In addition, an on-line ...
  • Ensuring Consistency in a Distributed Database System by Use of Distributed Semaphores 

    Schneider, Fred B. (Cornell University, 1979-09)
    Solutions to the database consistency problem in distributed databases are developed. It is shown how any solution to the consistency problem for a centralized database system that involves locking can be adapted for use ...
  • Synchronization in Distributed Programs 

    Schneider, Fred B. (Cornell University, 1979-09)
    A technique for solving synchronization problems in distributed programs is described. Use of this technique in environments in which processes may fail is discussed. The technique can be used to solve synchronization ...

View more


RSS Feeds