Now showing items 1-20 of 37

    • Automatic Surface Generation in Computer Aided Design 

      Hoffmann, Christoph M.; Hopcroft, John E. (Cornell University, 1985-01)
      No abstract available
    • The Complexity of Equivalence and Containment for Free Single Variable Program Schemes 

      Fortune, Steven; Hopcroft, John E.; Schmidt, Erik Meineche (Cornell University, 1977-05)
      Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial time algorithm for deciding equivalence of two free schemes, provided one of them has the predicates appearing in the same ...
    • 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.
    • Determining Points of a Circular Region Reachable by Joints of a Robot Arm 

      Hopcroft, John E.; Joseph, Deborah A.; Whitesides, Sue H. (Cornell University, 1982-08)
      An "arm" is a sequence of links whose endpoints are connected consecutively by movable joints. The location of the first endpoint is fixed. This report gives a polynomial time algorithm for determining the regions that ...
    • Dividing a Graph into Triconnected Components 

      Hopcroft, John E.; Tarjan, Robert Endre (Cornell University, 1974-02)
      An algorithm for dividing a graph into triconnected components is presented. When implemented on a random access computer, the algorithm requires $O(V+E)$ time and space to analyze a graph with $V$ vertices and $E$ edges. ...
    • Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms 

      Hopcroft, John E.; Musinski, J. (Cornell University, 1972-10)
      The paper considers the complexity of bilinear forms in a noncommutative ring. The dual of a computation is defined and applied to matrix multiplication and other bilinear forms. It is shown that the dual of an optimal ...
    • Efficient Planarity Testing 

      Hopcroft, John E.; Tarjan, Robert Endre (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 

      Borodin, Allan B.; Von zur Gathen, Joachim; Hopcroft, John E. (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 

      Hoffmann, Christoph M.; Hopcroft, John E. (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 

      Hoffmann, Christoph M.; Hopcroft, John E. (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 

      Hartmanis, Juris; Hopcroft, John E. (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 

      Hopcroft, John E.; Karp, R. M. (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 

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

      Dietz, Paul F.; Furst, Merrick; Hopcroft, John E. (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 

      Borodin, Allan B.; Hopcroft, John E. (Cornell University, 1981-09)
      A variety of models have been proposed for the study of synchronous parallel computation. We review these models and study further some prototype problems. Within a spectrum of shared memory models, we show that $\log ...
    • Movement Problems for 2-Dimensional Linkages 

      Hopcroft, John E.; Joseph, Deborah A.; Whitesides, Sue H. (Cornell University, 1982-08)
    • A Note on Cryptography and NP$\cap$ CoNP-P 

      Brassard, Giles; Fortune, Steven; Hopcroft, John E. (Cornell University, 1978-04)
      Diffie and Hellman [2] propose the use of the exponential function in a finite field for cryptographic purposes. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. ...
    • A Note on Rabin's Nearest-Neighbor Algorithm 

      Fortune, Steven; Hopcroft, John E. (Cornell University, 1978-04)
      Rabin has proposed a probabilistic algorithm for finding the closest pair of a set of points in Euclidean space. His algorithm is asymtomatically linear whereas the best of the known deterministic algorithms take order ...
    • On Edge Coloring Bipartite Graphs 

      Cole, Richard; Hopcroft, John E. (Cornell University, 1980-11)
    • On Minimizing the Number of Multiplications Necessary for Matrix Multiplication 

      Hopcroft, John E.; Kerr, Leslie Robert (Cornell University, 1969-09)
      This paper develops an algorithm to multiply a px2 matrix by a 2xn matrix in $\lceil (3pn+max(n,p))/2 \rceil$ multiplications for matrix multiplication without commutativity. The algorithm minimizes the number of multiplications ...