Articles Title Id Created Updated
1MIRK 2003 proceedingsmirk-2003-proceedings2026-10-182026-10-18
1An O(m) Algorithm for Cores Decomposition of Networks by Vladimir Batagelj and Matjaž Zaveršnikan-o-m-algorithm-for-cores-decomposition-of-networks-by-vladimir-batagelj-and-matjaz-zaversnik2026-10-182026-10-18
1Efficiency of a Good But Not Linear Set Union Algorithm by Robert Endre Tarjanefficiency-of-a-good-but-not-linear-set-union-algorithm-by-robert-endre-tarjan2026-10-182026-10-18
1COS 226 Bob’s Notes 1: Union-Find and Percolation (Version 2) by Robert Tarjancos-226-bob’s-notes-1-union-find-and-percolation-version-2-by-robert-tarjan2026-10-182026-10-18
1CS 312 at Cornell Universitycs-312-at-cornell-university2026-10-182026-10-18
1Amortized Computational Complexity by Robert Endre Tarjanamortized-computational-complexity-by-robert-endre-tarjan2026-10-182026-10-18
1CS 4820: Algorithms, Spring 2011cs-4820-algorithms-spring-20112026-10-182026-10-18
1Discrete Probability by Jeff Ericksondiscrete-probability-by-jeff-erickson2026-10-182026-10-18
1Structure and Interpretation of Computer Programs by Harold Abelson and othersstructure-and-interpretation-of-computer-programs-by-harold-abelson-and-others2026-10-182026-10-18
16.046J Design and Analysis of Algorithms, Spring 20156-046j-design-and-analysis-of-algorithms-spring-20152026-10-182026-10-18
1Algorithms by Jeff Ericksonalgorithms-by-jeff-erickson2026-10-182026-10-18
1Matplotlib 3.10.7 documentationmatplotlib-3-10-7-documentation2026-10-182026-10-18
1CS 2112 Fall 2019cs-2112-fall-20192026-10-182026-10-18
1CS 252, Lecture 8: Constraint Satisfaction Problems (Carnegie Mellon University)cs-252-lecture-8-constraint-satisfaction-problems-carnegie-mellon-university2026-10-182026-10-18
1The Complexity of Theorem-Proving Procedures by Stephen A. Cookthe-complexity-of-theorem-proving-procedures-by-stephen-a-cook2026-10-182026-10-18
1CPSC 536N: Randomized Algorithmscpsc-536n-randomized-algorithms2026-10-182026-10-18
1CMPT 710 and CMPT 407 - Computational Complexity - Fall 2007cmpt-710-and-cmpt-407-computational-complexity-fall-20072026-10-182026-10-18
1Jan Gasparjan-gaspar2026-10-182026-10-18
1Julie Sussmanjulie-sussman2026-10-182026-10-18
1Tim Rohlfstim-rohlfs2026-10-182026-10-18

Empty topics are being shown, click here to show only nonempty topics.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact