Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos. Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. Algorithmica, 60(3):505-552, 2011. [doi]

@article{GoodrichTT11,
  title = {Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems},
  author = {Michael T. Goodrich and Roberto Tamassia and Nikos Triandopoulos},
  year = {2011},
  doi = {10.1007/s00453-009-9355-7},
  url = {http://dx.doi.org/10.1007/s00453-009-9355-7},
  tags = {data-flow, graph-rewriting, rewriting, search},
  researchr = {https://researchr.org/publication/GoodrichTT11},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {60},
  number = {3},
  pages = {505-552},
}