LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 277-279 of 486

    • Evaluation of an Office Analysis Methodology 

      Sutherland, Juliet; Sirbu, Marvin (1983-03)
      We have developed a model of the office that describes semi-structured office work. This model underlies an office analysis methodology and an office-specification language. An evaluation of the usefulness and practicality ...

    • An Approximation Algorithm for Manhattan Routing 

      Baker, Brenda S.; Bhatt, Sandeep N.; Leighton, Frank Thomson (1983-02)
      Density has long been known to be an important measure of difficulty for Manhattan routing. In this paper, we identify a second important measure of difficulty, which we call flux. We show that flux, like density, is a ...

    • Planar Embedding of Planar Graphs 

      Dolev, Danny; Leighton, Frank Thomson; Trickey, Howard (1983-02)
      Planar embedding with minimal area of graphs on an integer grid is an interesting problem in VLSI theory. Valiant [V] gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there ...