3-ranks for strongly regular graphs

Andrew Novocin, B. David Saunders, Alexander Stachnik, Bryan S. Youse. 3-ranks for strongly regular graphs. In Jean-Guillaume Dumas, Erich L. Kaltofen, Clément Pernet, editors, Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015. pages 101-108, ACM, 2015. [doi]

@inproceedings{NovocinSSY15,
  title = {3-ranks for strongly regular graphs},
  author = {Andrew Novocin and B. David Saunders and Alexander Stachnik and Bryan S. Youse},
  year = {2015},
  doi = {10.1145/2790282.2790295},
  url = {http://doi.acm.org/10.1145/2790282.2790295},
  researchr = {https://researchr.org/publication/NovocinSSY15},
  cites = {0},
  citedby = {0},
  pages = {101-108},
  booktitle = {Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015},
  editor = {Jean-Guillaume Dumas and Erich L. Kaltofen and Clément Pernet},
  publisher = {ACM},
  isbn = {978-1-4503-3599-7},
}