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.
Andrej Bogdanov, Luca Trevisan. Lower Bounds for Testing Bipartiteness in Dense Graphs. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA. pages 75-81, IEEE Computer Society, 2004. [doi]