Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm

Rhonda Kay Gaede, M. Ray Mercer, Bill Underwood. Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm. In Proceedings International Test Conference 1986, Washington, D.C., USA, September 1986. pages 498-505, IEEE Computer Society, 1986.

@inproceedings{GaedeMU86,
  title = {Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm},
  author = {Rhonda Kay Gaede and M. Ray Mercer and Bill Underwood},
  year = {1986},
  researchr = {https://researchr.org/publication/GaedeMU86},
  cites = {0},
  citedby = {0},
  pages = {498-505},
  booktitle = {Proceedings International Test Conference 1986, Washington, D.C., USA, September 1986},
  publisher = {IEEE Computer Society},
}