LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 184-186 of 486

    • Combinatorial Algorithms for the Generalized Circulation Problem 

      Goldberg, Andrew V.; Plotkin, Serge A.; Tardos, Eva (1988-05)
      We consider a generalization of the maximum flow problem in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e) ?(e) units arrive at the ...

    • Sublinear-time Parallel Algorithms for Matching and Related Problems 

      Goldberg, Andrew V.; Plotkin, Serge A.; Vaidya, Pravin (1988-06)
      This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. ...

    • Semantical Paradigms: Notes for an Invited Lecture 

      Meyer, Albert R.; Cosmadakis, Stavros S. (1988-07)
      It tooke me quite a few years to understand the point of the continuity in denotational semantics. I'm happy to report below on some recent results which justify my muddle-headedness and help to explain the point too. What ...