Now showing items 1-20 of 2234

• #### 00_A Directory of the Oral Histories of Computer Science at Cornell University ﻿

(The Internet-First University Press, 2016-06-16)
• #### The 1986-1987 Taulbee Survey Report: The Computing Research Board's Survey on the Production and Employment of Ph.D.'s and Faculty in Computer Science and Engineering ﻿

(Cornell University, 1988-02)
ABSTRACT NOT AVAILABLE
• #### 2.25 N-Lower Bound on the Combinational Complexity of Boolean Functions ﻿

(Cornell University, 1974-12)
Consider the combinational complexity L(f) of Boolean functions over the basis $\Omega = \{f|f:\{0,1\}^{2} \rightarrow \{0,1\}\}$. A new Method for proving linear lower bounds of size 2n is presented. Combining it with ...
• #### The 711 Problem ﻿

(Cornell University, 1982-05)
NO ABSTRACT SUPPLIED
• #### A Hamiltonian-Schur Decomposition ﻿

(Cornell University, 1979-09)
• #### A Logic For Correct Program Development ﻿

(Cornell University, 1979-08)
• #### Abstract Identifiers and Textual Reference ﻿

(Cornell University, 2002-11-15)
Here are three proposals concerning the structure and maintenance of formal, inter-referential, digitally stored texts: (1) include abstract atomic identifiers in texts, (2) identify these identifiers with references ...
• #### Abstract Semantics for a Higher order Functional Language with Logic Variables ﻿

(Cornell University, 1991-07)
The addition of logic variables to functional languages gives the programmer novel and powerful tools such as incremental definition of data structures through constraint intersection. A number of such "hybrid" languages, ...
• #### An Abstract Semantics for Atoms in Nuprl ﻿

(Cornell University, 2006-06-05)
We provide a supervaluating semantics for treating Atoms abstractly in Computational Type Theory, specifically for Nuprl logics. It supports a principled explanation for desirable gaps in provability without positing novel ...
• #### Abstract Value Constructors: Symbolic Constants for Standard ML ﻿

(Cornell University, 1992-06)
Standard ML (SML) has been used to implement a wide variety of large systems, such as compilers, theorem provers, graphics libraries and even operating systems. While SML provides a convenient, high-level notation for ...
• #### Abstraction-Safe Effect Handlers via Tunneling: Technical Report ﻿

(2018-11-09)
Algebraic effect handlers offer a unified approach to expressing control-flow transfer idioms such as exceptions, iteration, and async/await. Unfortunately, previous attempts to make these handlers type-safe have failed ...
• #### Abstractions for Fault Tolerance in Distributed Systems ﻿

(Cornell University, 1986-04)
Abstractions useful in fault-tolerant and distributed systems are described. The abstractions are specified as properties of protocols, hence they have a different flavor from abstractions prevalent in sequential and ...
• #### An Accelerated Interior Point Method Whose Running Time Depends Only on $A$ ﻿

(Cornell University, 1993-10)
We propose a "layered-step" interior point (LIP) algorithm for linear programming. This algorithm follows the central path, either with short steps or with a new type of step called a "layered least squares" (LLS) step. ...
• #### An Accelerated Interior Point Method Whose Running Time Depends Only on A ﻿

(Cornell University, 1993-10)
We propose a "layered-step" interior point (LIP) algorithm for linear programming. This algorithm follows the central path, either with shortsteps or with a new type of step called a "layered least squares" (LLS)step. The ...
• #### Accepting Blame: Expressive Checked Exceptions ﻿

(2016-04)
Unhandled exceptions crash programs, so a compile-time check that exceptions are handled should in principle make software more reliable. But designers of some recent languages have argued that the benefits of statically ...
• #### Access Control in Parallel Programs ﻿

(Cornell University, 1978-01)
An important component of a programming language for writing operating systems, or other large parallel systems, is the set of access control facilities. Two principles for access control, expressive power and access ...
• #### Access Normalization: Loop Restructuring for NUMA Compilers ﻿

(Cornell University, 1992-07)
A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access local data. In addition, when a ...
• #### Access Normalization: Loop Restructuring for NUMA Compilers ﻿

(Cornell University, 1992-07)
A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access local data. In addition, when a ...
• #### Access Normalization: Loop Restructuring for NUMA Compilers ﻿

(Cornell University, 1992-04)
A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access non-local data. In addition, when a ...
• #### Accommodating Simplicity and Complexity in Metadata: Lessons from theDublin Core Experience ﻿

(Cornell University, 2000-06-30)
The Dublin Core Metadata Element Set (DCMES) grew out of a recognized need for improved resource discovery of web resources. Initial work on the DCMES focused on the requirement of simplicity: "ordinary" users should be ...