Finding Maximal Pairs with Bounded Gap

Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye. Finding Maximal Pairs with Bounded Gap. In Maxime Crochemore, Mike Paterson, editors, Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings. Volume 1645 of Lecture Notes in Computer Science, pages 134-149, Springer, 1999. [doi]

@inproceedings{BrodalLPS99,
  title = {Finding Maximal Pairs with Bounded Gap},
  author = {Gerth Stølting Brodal and Rune B. Lyngsø and Christian N. S. Pedersen and Jens Stoye},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1645/16450134.htm},
  researchr = {https://researchr.org/publication/BrodalLPS99},
  cites = {0},
  citedby = {0},
  pages = {134-149},
  booktitle = {Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings},
  editor = {Maxime Crochemore and Mike Paterson},
  volume = {1645},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66278-2},
}