Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls

Thomas Holenstein, Makrand Sinha. Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 698-707, IEEE Computer Society, 2012. [doi]

@inproceedings{HolensteinS12,
  title = {Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls},
  author = {Thomas Holenstein and Makrand Sinha},
  year = {2012},
  doi = {10.1109/FOCS.2012.51},
  url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2012.51},
  researchr = {https://researchr.org/publication/HolensteinS12},
  cites = {0},
  citedby = {0},
  pages = {698-707},
  booktitle = {53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4673-4383-1},
}