Project documentation; cited manual sections are recorded below.
The section credits refer to the GNU MP development team.
Published in Doklady Akademii Nauk SSSR, 145(2), 293–294.
Cited passages: Karatsuba and Ofman, Multiplication of many-digital numbers by automatic computers, original Russian article, 1962, pp. 293–294: Theorem 2, its proof, and the footnote on p. 294.
Published in Nature 218, pp. 19–22.
Cited passages: Donald Michie, “Memo” Functions and Machine Learning, Nature 218, pp. 19–22 (1968), abstract: programming-language rote learning motivated by efficiency during execution.
Publisher: MIT OpenCourseWare, Massachusetts Institute of Technology.
This source is credited to an organization.
Spring 2020 identifies the MIT 6.006 course offering. The institutional credit applies to these notes; listed course instructors are not inferred to be their authors.
Cited passages: MIT 6.006 Spring 2020, Lecture 15: Recursive Algorithms, printed p. 3, final three bullets: growing Fibonacci bit lengths and addition cost; MIT 6.006 Spring 2020, Lecture 15: Recursive Algorithms, printed pp. 2–3, Fibonacci Numbers and Re-using Subproblem Solutions.
Publisher: seL4 Project.
This source is credited to an organization.
Cited passages: What the Proofs Assume, The Assumptions: Assembly, Hardware, Hardware management, Boot code, DMA, Information side-channels; What the Proofs Assume, The Assumptions: DMA and memory-mapped device registers.
Publisher: seL4 Project.
This source is credited to an organization.
Cited passages: seL4 Proofs, High-level Proof Statements: Functional correctness; Binary correctness; Security; System initialisation; platform/configuration qualification.
Publisher: seL4 Project.
This source is credited to an organization.
Cited passages: IPC tutorial, Background: System calls, seL4_Call and reply capabilities; IPC tutorial, Background: System calls; IPC Buffer; Data transfer; IPC tutorial, Background: endpoint queues.
Publisher: seL4 Project.
This source is credited to an organization.
Cited passages: Capabilities tutorial, Background: What is a capability?; Capabilities tutorial, Background: What is a capability?; CNodes and CSlots.
Publisher: Association for Computing Machinery.
Published in Proceedings of the 15th ACM Symposium on Operating Systems Principles (SOSP); also ACM SIGOPS Operating Systems Review, 29(5), pp. 237–250.
Cited passages: Liedtke, On micro-kernel construction, section 2, pp. 238–240: minimality criterion, address spaces, threads and IPC; section 3, pp. 240–241: user-level services; Liedtke, On micro-kernel construction, section 4.1, pp. 241–244: kernel-user switches, address-space switches, and discussion of hardware-dependent cache and TLB effects.
This source is credited to an organization.
Cited passages: Version 20260120, section 12.3.2, printed p. 134, steps 2–8; section 12.4.1, printed p. 137: Sv39 uses the same algorithm with LEVELS=3 and PTESIZE=8; Version 20260120, section 12.4.1, printed pp. 136–137, Figures 68–70: address fields, entry sizes, root, and larger pages.
Publisher: The kernel development community.
This source is credited to an organization.
Cited passages: MMU, TLB, and Page Faults: translation caches, page walks, and faults for missing or forbidden mappings; Page Tables: opening hierarchy discussion, paragraph beginning "One could of course imagine"; Page Table Folding.
Publisher: Microsoft Learn.
This source is credited to an organization.
Cited passages: Dependence, Dirty Cells, and Recalculated Cells: paragraph beginning “When a structural change is made”; B1/A1 and C1/B1 dirty-cell example; Dependence, Dirty Cells, and Recalculated Cells: paragraphs beginning “In Excel 2002 and earlier versions” and “In Excel 2007”.
Collection of sources; individual chapter authors and dates are recorded below.
Publisher: Massachusetts Institute of Technology, MIT OpenCourseWare.
Publisher: Association for Computing Machinery.
Published in Communications of the ACM, volume 15, number 12, pp. 1053–1058.
Cited passages: Parnas, pp. 1054 and 1056, What Is Modularization? and The Criteria: responsibility assignments and hidden design decisions.
Publisher: RFC Editor.
Cited passages: RFC 1951, heading and sections 2 and 4: format and encoder choices; RFC 1951, section 3.2.3, printed p. 11: overlapping string references; RFC 1951, section 3.2.3: header, block types and decoding loop; RFC 1951, section 3.2.5, length and distance tables; RFC 1951, sections 2 and 3.2.3: independent block codes, references across blocks; RFC 1951, sections 3.2.2, 3.2.6 and 3.2.7: code reconstruction, fixed codes and dynamic code-length repeats; RFC 1951, sections 3.2.3 and 3.2.4: alignment, LEN, NLEN and stored data; RFC 1951, sections 3.2.3 and 3.2.5: available history, overlap, length and distance ranges; RFC 1951, sections 3.2.3, 3.2.4 and 3.2.6: header, stored layout and fixed literal lengths; RFC 1951, sections 3.2.5 and 3.2.6: length 9, distance 3 and fixed code lengths.
Publisher: ARM Limited.
Cited passages: AMBA Specification, revision 2.0, section 1.4 and section 3.11.4: burst operation and early burst termination; AMBA Specification, revision 2.0, section 1.5, pp. 1-7–1-8: master, slave and address decoder; AMBA Specification, revision 2.0, section 3.11.3, pp. 3-30–3-31, figures 3-16–3-17: readiness and ownership handover; AMBA Specification, revision 2.0, sections 1.4–1.5: transfer, initiator and responding target.
Collection of sources; individual chapter authors and dates are recorded below.
Publisher: University of California, Berkeley.

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