Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Martin Sauerhoff. A Lower Bound for Randomized Read-k-Times Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 4(19), 1997. [doi]