Now showing items 1-4 of 4

    • Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets 

      Pearson, David; Vazirani, Vijay V. (Cornell University, 1991-08)
      A maximal bipartite set (MBS) in an undirected graph $G = (V, E)$ is a maximal collection of vertices $B \subseteq$ V$ whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and ...
    • Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time 

      Johnson, Richard C.; Pearson, David; Pingali, Keshav (Cornell University, 1993-07)
      Many compilation problems require computing the control dependence equivalence relation which divides nodes in a control flow graph into equivalence classes such that nodes are in the same class if and only if they have ...
    • Parallel Computing as a Commodity 

      Pearson, David (Cornell University, 1998-05)
      Massively parallel computers have become undisputed champions in the supercomputing arena. The global computer industry, however, is increasingly dominated by consumer machines. In this thesis, we argue that everyday ...
    • A Polynomial-time Algorithm for the Change-Making Problem 

      Pearson, David (Cornell University, 1994-06)
      The change-making problem is the problem of representing a given value with the fewest coins possible from a given set of coin denominations. To solve this problem for arbitrary coin systems is NP-hard [L]. We investigate ...