Optimizing cyclic data-flow graphs via associativity

Liang-Fang Chao. Optimizing cyclic data-flow graphs via associativity. In Fourth Great Lakes Symposium on Design Automation of High Performance VLSI Systems, GLSV '94, Notre Dame, IN, USA, March 4-5, 1994. pages 6-10, IEEE, 1994. [doi]

@inproceedings{Chao94-0,
  title = {Optimizing cyclic data-flow graphs via associativity},
  author = {Liang-Fang Chao},
  year = {1994},
  doi = {10.1109/GLSV.1994.290005},
  url = {http://dx.doi.org/10.1109/GLSV.1994.290005},
  researchr = {https://researchr.org/publication/Chao94-0},
  cites = {0},
  citedby = {0},
  pages = {6-10},
  booktitle = {Fourth Great Lakes Symposium on Design Automation of High Performance VLSI Systems, GLSV '94, Notre Dame, IN, USA, March 4-5, 1994},
  publisher = {IEEE},
  isbn = {0-8186-5610-7},
}