Joshua Brody, Elad Verbin. The Coin Problem and Pseudorandomness for Branching Programs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 30-39, IEEE Computer Society, 2010. [doi]
@inproceedings{BrodyV10, title = {The Coin Problem and Pseudorandomness for Branching Programs}, author = {Joshua Brody and Elad Verbin}, year = {2010}, doi = {10.1109/FOCS.2010.10}, url = {http://dx.doi.org/10.1109/FOCS.2010.10}, researchr = {https://researchr.org/publication/BrodyV10}, cites = {0}, citedby = {0}, pages = {30-39}, booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA}, publisher = {IEEE Computer Society}, isbn = {978-0-7695-4244-7}, }