Now showing items 9-12 of 12

    • Parallel Algorithms For Maximum Matching And Other Problems On Interval Graphs 

      Moitra, Abha; Johnson, Richard C. (Cornell University, 1988-07)
      In this paper, we consider parallel algorithms on interval graphs. An interval graph is a graph having a one-to-one correspondence with a sequence of intervals on the real line, such that each vertex maps to an interval ...
    • Proof Rules for Fault-Tolerant Distributed Programs 

      Joseph, Mathai; Moitra, Abha; Soundararajan, Neelam (Cornell University, 1984-10)
      Proving properties of fault tolerant distributed programs is a complex task as such proofs must take into account failures at all possible points in the execution of individual processes. The difficulty in accomplishing ...
    • A Proof System for Dataflow Networks with Indeterminate Modules 

      Moitra, Abha; Panangaden, Prakash (Cornell University, 1986-09)
      In this paper we discuss a model for dataflow networks containing indeterminate operators and the associated proof system. The model is denotational and associates with each network the set of possible behaviors. The ...
    • Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 

      Bilardi, Gianfranco; Moitra, Abha (Cornell University, 1989-05)
      It is shown that the time to compute a monotone boolean function depending upon $n$ variables on a CREW-PRAM satisfies the lower bound $T = \Omega$(log $l$ + (log $n$)/$l$), where $l$ is the size of the largest prime ...