I can't point you to anything in particular, but I can give some general thoughts. First, information about Big Oh (and little Oh and the omegas and theta and blah) on the internet is often incomplete or misleading. It really helps to have a good algorithms book that covers the topic in detail. In addition to searching for "Big Oh" with any major search engine, you can find lots of neat algorithmic info discretely posted on academic websites. You can try searching for something like "Big Oh lecture notes", or browsing around the course websites at universities with good CS departments. Algorithm papers are often only available in the postscript format (.ps) since formatting math equations is somewhat difficult in HTML. If you want to read a paper that's only available as postscript, make sure you have an appropriate viewer on your computer. Also, please change your display name to be less redundundant.
Want to know about Big Oh? Buy "Introduction to Algorithms" by Corman, Leiserson and Rivest. It's a classic. It's one of the main text books for both undergrad and graduate computer science classes at Rutgers University (and many other great schools). Another place to find out about the Big Oh is reading Maxim or Penthouse.... but that's a whole different "Big Oh"!