Now showing items 7-26 of 37

• #### Efficient Planarity Testing ﻿

(Cornell University, 1973-04)
This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter ...
• #### Fast Parallel Matrix and GCD Computations ﻿

(Cornell University, 1982-04)
We present parallel algorithms to compute the determinant and characteristic polynomial of n x n-matrices and the gcd of polynomials of degree $\leq$n. The algorithms use parallel time $O(\log^{2}n)$ and a polynomial ...
• #### Geometric Ambiguities in Boundary Representations ﻿

(Cornell University, 1986-01)
Boundary representations are usually separated into two components, a topological component and a geometric component. The conditions necessary to insure that the topological component is unambiguous are well understood. ...
• #### The Geometry of Projective Blending Surfaces ﻿

(Cornell University, 1986-05)
Blending surfaces smoothly join two or more primary surfaces that otherwise would intersect in edges. We outline the potential method for deriving blending surfaces, and explain why the method needs to be considered in ...
• #### Independence Results in Computer Science ﻿

(Cornell University, 1976-12)
In this note we show that instances of problems which appear naturally in computer science cannot be answered in formalized set theory. We show, for example, that some relativized versions of the famous P = NP problem ...
• #### A Linear Algorithm for Testing Equivalence of Finite Automata ﻿

(Cornell University, 1971-12)
An algorithm is given for determining if two finite automata with start states are equivalent. The asymptotic running time of the algorithm is bounded by a constant times the product of the number of states of the larger ...
• #### A Linear List Merging Algorithm ﻿

(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 ...
• #### A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem ﻿

(Cornell University, 1979-07)
THe Generalized Consecutive Retrieval Problem (GCRP) is to find a directed tree on $n$ records in which each of $k$ subsets forms a directed path. The problem arises in organizing information for efficient retrieval. A ...
• #### Merging on Parallel Models of Computation ﻿

(Cornell University, 1981-09)
• #### On the Motion of Objects in Contact ﻿

(Cornell University, 1984-05)
There is an increasing use of computers in the design, manufacture and manipulation of physical objects. An important aspect of reasoning about such actions concerns the motion of objects in contact. The study of problems ...
• #### On the Movement of Robot Arms in Two Dimensional Bounded Regions ﻿

(Cornell University, 1982-04)
The classical mover's problem is the following: can a rigid object in 3-dimensional space be moved from one given position to another while avoiding obstacles? It is known that a more general version of this problem ...
• #### On the Reachability Problem for 5-Dimensional Vector Addition Systems ﻿

(Cornell University, 1976-06)
The reachability set for vector addition systems of dimension less than or equal to five are shown to be effectively computable semilinear sets. Thus reachability, equvalence and containment are decidable up to dimension ...
• #### On Time Versus Space ﻿

(Cornell University, 1975-12)
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Consequently, for tape constructable t(n), the class of languages recognizable by multitape Turing machines of time complexity ...