Cornell's Faculty of Computing and Information Science (CIS) engages with every college at Cornell and shares the information revolution with every Cornell student to invent the fields of tomorrow.

Founded on the recognition that the ideas and technology of computing and information science are relevant to every academic discipline, CIS capitalizes on interdisciplinary collaboration to accelerate knowledge creation and discovery. At the center of Cornell's Information Campus, CIS bridges information and innovation.

For more information, go to Faculty of CIS Home Page.

Sub-communities within this community

Collections in this community

Recent Submissions

  • Unrestricted Stone Duality for Markov Processes 

    Furber, Robert; Kozen, Dexter; Larsen, Kim; Mardare, Radu; Panangaden, Prakash (2017-02-23)
    Stone duality relates logic, in the form of Boolean algebra, to spaces. Stone-type dualities abound in computer science and have been of great use in understanding the relationship between computational models and the ...
  • Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ 

    Smyth, Ben; Frink, Steven; Clarkson, Michael R. (2017-02-13)
    Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors ...
  • Flow-Limited Authorization 

    Arden, Owen (2017-01)
    Enforcing the confidentiality and integrity of information is critical in distributed applications. Production systems typically use some form of authorization mechanism to protect information, but these mechanisms do ...
  • Lightweight Verification of Secure Hardware Isolation Through Static Information Flow Analysis (Technical Report) 

    Ferraiuolo, Andrew; Xu, Rui; Zhang, Danfeng; Myers, Andrew C.; Suh, G. Edward (2017-01-29)
    Hardware-based mechanisms for software isolation are becoming increasingly popular, but implementing these mechanisms correctly has proved difficult, undermining the root of security. This work introduces an effective ...
  • On Free ω-Continuous and Regular Ordered Algebras 

    Esik, Zoltan; Kozen, Dexter (2016)
    Let E be a set of inequalities between finite Σ-terms. Let V_ω and V_r denote the varieties of all ω-continuous ordered Σ-algebras and regular ordered Σ-algebras satisfying E, respectively. We prove that the free V_r-algebra ...

View more


RSS Feeds