Can dist tables be merged in linear time - An Open Problem

Gad M. Landau. Can dist tables be merged in linear time - An Open Problem. In Jan Holub, Jan Zdárek, editors, Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006. pages 1, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 2006. [doi]

@inproceedings{Landau06,
  title = {Can dist tables be merged in linear time - An Open Problem},
  author = {Gad M. Landau},
  year = {2006},
  url = {http://www.stringology.org/event/2006/p01.html},
  tags = {source-to-source, open-source},
  researchr = {https://researchr.org/publication/Landau06},
  cites = {0},
  citedby = {0},
  pages = {1},
  booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006},
  editor = {Jan Holub and Jan Zdárek},
  publisher = {Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University},
  isbn = {80-01-03533-6},
}