Last update: Sun Oct 15 02:37:19 MDT 2017
@Article{Doerr:2012:BBC,
author = "Benjamin Doerr and Carola Winzen",
title = "Black-Box Complexity: Breaking the {$O(n \log n)$}
Barrier of {{\sc LeadingOnes}}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7401",
pages = "205--216",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35533-2_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:46 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35533-2_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35533-2",
book-URL = "http://www.springerlink.com/content/978-3-642-35533-2",
fjournal = "Lecture Notes in Computer Science",
}