New Lower Bounds for the Number of Pseudoline Arrangements

Adrian Dumitrescu, Ritankar Mandal. New Lower Bounds for the Number of Pseudoline Arrangements. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 410-425, SIAM, 2019. [doi]

@inproceedings{DumitrescuM19,
  title = {New Lower Bounds for the Number of Pseudoline Arrangements},
  author = {Adrian Dumitrescu and Ritankar Mandal},
  year = {2019},
  doi = {10.1137/1.9781611975482.26},
  url = {https://doi.org/10.1137/1.9781611975482.26},
  researchr = {https://researchr.org/publication/DumitrescuM19},
  cites = {0},
  citedby = {0},
  pages = {410-425},
  booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019},
  editor = {Timothy M. Chan},
  publisher = {SIAM},
  isbn = {978-1-61197-548-2},
}