Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems

Amir Abboud, Virginia Vassilevska Williams. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. pages 434-443, IEEE Computer Society, 2014. [doi]

@inproceedings{AbboudW14,
  title = {Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems},
  author = {Amir Abboud and Virginia Vassilevska Williams},
  year = {2014},
  doi = {10.1109/FOCS.2014.53},
  url = {http://dx.doi.org/10.1109/FOCS.2014.53},
  researchr = {https://researchr.org/publication/AbboudW14},
  cites = {0},
  citedby = {0},
  pages = {434-443},
  booktitle = {55th IEEE  Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4799-6517-5},
}