Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds

Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song. Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Trans. Parallel Distrib. Syst., 24(4):724-733, 2013. [doi]

@article{AlvesCS13,
  title = {Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds},
  author = {Carlos Eduardo Rodrigues Alves and Edson Norberto Cáceres and Siang Wun Song},
  year = {2013},
  doi = {10.1109/TPDS.2012.149},
  url = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.149},
  researchr = {https://researchr.org/publication/AlvesCS13},
  cites = {0},
  citedby = {0},
  journal = {IEEE Trans. Parallel Distrib. Syst.},
  volume = {24},
  number = {4},
  pages = {724-733},
}