shieber-full.bib

@techreport{Nesson:2005:IPS,
  address = {Cambridge, MA},
  author = {Rebecca Nesson and Alexander Rush and Stuart M. Shieber},
  date-added = {2007-06-15 10:47:29 -0400},
  date-modified = {2011-02-09 12:55:46 -0500},
  institution = {Division of Engineering and Applied Sciences, Harvard University},
  localpdf = {ftp://ftp.deas.harvard.edu/techreports/tr-20-05.pdf},
  number = {TR-20-05},
  pdf = {ftp://ftp.deas.harvard.edu/techreports/tr-20-05.pdf},
  title = {Induction of Probabilistic Synchronous Tree-Insertion Grammars},
  year = {2005}
}

@techreport{Nelken:2007:LCW,
  address = {Cambridge, MA},
  author = {Rani Nelken and Stuart M. Shieber},
  date-added = {2005-11-23 14:10:11 -0500},
  date-modified = {2011-02-09 12:54:58 -0500},
  institution = {School of Engineering and Applied Sciences, Harvard University},
  localpdf = {ftp://ftp.deas.harvard.edu/techreports/tr-06-07.pdf},
  number = {TR-06-07},
  pdf = {ftp://ftp.deas.harvard.edu/techreports/tr-06-07.pdf},
  title = {Lexical Chaining and Word-Sense-Disambiguation},
  year = {2007}
}

@techreport{Christensen:1992:LPF,
  address = {Cambridge, Massachusetts},
  author = {Jon Christensen and Joseph Marks and Stuart M. Shieber},
  date-modified = {2011-02-09 12:46:16 -0500},
  institution = {Harvard University Center for Research in Computing Technology},
  localpdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/label-algs-tog.pdf},
  localps = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/label-algs-tog.ps},
  month = dec,
  number = {TR-25-92},
  pdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/label-algs-tog.pdf},
  title = {Labeling Point Features on Maps and Diagrams},
  year = {1992}
}

@techreport{Grosz:1993:IRT,
  author = {Barbara J. Grosz and H. T. Kung and Margo Seltzer and Stuart M. Shieber and Michael Smith},
  institution = {Center for Research in Computing Technology, Harvard University},
  number = {TR-04-93},
  title = {Infrastructure for research towards ubiquitous information systems},
  year = {1993}
}

@techreport{Hwa:1995:ASH,
  author = {Rebecca Hwa and Joe Marks and Stuart M. Shieber},
  date-modified = {2011-02-09 12:49:26 -0500},
  http = {http://www.merl.com/papers/TR95-06/},
  institution = {Mitsubishi Electric Research Laboratories},
  number = {TR95-06},
  pdf = {http://www.merl.com/reports/docs/TR95-06.pdf},
  title = {Automatic structuring of high-performance hypermedia documents},
  year = {1995}
}

@techreport{Kosak:1991:NAA,
  address = {Cambridge, Massachusetts},
  author = {Corey Kosak and Joseph Marks and Stuart Shieber},
  institution = {Harvard University Center for Research in Computing Technology},
  number = {TR-22-91},
  title = {New Approaches to Automating Network Diagram Layout},
  year = {1991}
}

@techreport{Marks:1991:CCC,
  address = {Cambridge, Massachusetts},
  author = {Joe Marks and Stuart Shieber},
  date-modified = {2011-02-09 12:52:20 -0500},
  institution = {Harvard University Center for Research in Computing Technology},
  localpdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/label.pdf},
  localps = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/label.ps},
  month = dec,
  number = {TR-05-91},
  pdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/label.pdf},
  title = {The Computational Complexity of Cartographic Label Placement},
  year = {1991}
}

@techreport{Ryall:1993:AFP,
  author = {Kathy Ryall and Joe Marks and Murray Mazer and Stuart M. Shieber},
  ftp = {ftp://ftp.deas.harvard.edu/techreports/tr-24-93.ps.gz},
  institution = {Center for Research in Computing Technology, Harvard University},
  number = {TR-24-93},
  title = {Annotating floor plans using deformable polygons},
  year = {1993}
}

@techreport{Shieber:1986:CPU,
  address = {Stanford, California},
  author = {Stuart M. Shieber and Fernando C. N. Pereira and Lauri Karttunen and Martin Kay},
  institution = {Center for the Study of Language and Information},
  month = apr,
  number = {CSLI-86-48},
  title = {Compilation of Papers on Unification-Based Grammar Formalisms},
  year = {1986}
}

@techreport{Ruml:1999:SPB,
  annote = {Compares the performance of a simple incomplete tree
                  search algorithm with the popular incomplete graph
                  search algorithm WalkSAT. To better reflect the way
                  such algorithms are used in practice, we evaluate
                  the ability of the algorithms to determine
                  satisfiability given a bounded amount of time
                  (rather than measuring the time needed to find a
                  model in a problem known to be satisfiable). Our
                  results indicate that, for the random problems on
                  which WalkSAT excels, the tree search method can be
                  just as effective on small problems, although it
                  seems to scale poorly. },
  author = {Wheeler Ruml and Adam Ginsburg and Stuart Shieber},
  date-modified = {2011-02-09 13:02:57 -0500},
  institution = {Harvard University Computer Science},
  localpdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/tr-02-99.pdf},
  number = {TR-02-99},
  pdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/tr-02-99.pdf},
  title = {Speculative Pruning for Boolean Satisfiability},
  year = {1999}
}

@techreport{Ruml:1999:SGH,
  annote = {Presents a careful empirical comparison of
                  algorithms for graph bisection that are based on a
                  simple relative connectedness heuristic. One of the
                  connectedness algorithms performs better than
                  Kernighan-Lin or a simple spectral method in
                  time-equated tests. This is an expanded version of
                  the ALEX98 paper. },
  author = {Wheeler Ruml and Joe Marks and Stuart Shieber and Tom Ngo},
  date-modified = {2011-02-09 13:02:23 -0500},
  institution = {Harvard University Computer Science},
  localpdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/tr-10-99.pdf},
  number = {TR-10-99},
  pdf = {http://www.eecs.harvard.edu/~shieber/Biblio/Papers/tr-10-99.pdf},
  title = {Seed-Growth Heuristics for Graph Bisection},
  year = 1999
}