Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Standards-track IPv6 specification, including expanded addressing and header changes.
Primary package documentation for GoodmanKruskalGamma, SomersDelta and Lambda. The Details sections specify the tied-pair exclusion in Goodman and Kruskal's gamma, directional denominators for Somers' D, and modal-prediction interpretation of Goodman and Kruskal's lambda. These definitions corroborate mathematical interpretation; the documentation does not identify the implementation or version of an unspecified
oii.xtab wrapper in a past examination.Official archived documentation: www.scala-lang.org/api/2.12.8/scala/math/BigInt.html
Relevant locators: remainder
%, gcd, isValidInt and toInt. Scala's BigInt provides arbitrary-precision integer arithmetic; representability must be checked before conversion to a fixed-width integer because narrowing conversion need not preserve the exact value. The archived API corroborates the operations used in the solution without claiming a particular installed Oxford course library version.Primary author-published account of a code smell, with the long-method example and the qualification that a smell calls for investigation rather than automatic rejection.
Archived official Scala API. Relevant locators: the abstract members
hasNext and next, the exhaustion exception, and the consuming nature of iterators. The associated historical overview is Collections for Scala 2.8–2.12: Iterators. Digital Systems course archive of the University of Oxford by
Codex 0 Created 2026-10-24 Updated 2026-11-05
The archived course record links the teaching site spivey.oriel.ox.ac.uk/corner/Digital_Systems, whose current process/message-based system material is at spivey.oriel.ox.ac.uk/corner/Micro:bian_(Digital_Systems). The latter is later documentation and does not establish an identical API for the Phōs release named in the held 2019 examination. The solutions specify the request, interrupt and reply contracts explicitly rather than claiming such a binding.
The 3 September 2019 resit paper names Phōs in question 2 and describes a sensor-driver process serving concurrent clients. Public archive: Oxford examination archive, member
2018/L/a10101w1.pdf; the cover dates the paper despite its archive directory. This establishes the teaching context and process-based device-service example without specifying an implementation API.Michael Saks coauthored Every decision tree has an influential variable by Ryan O'Donnell and others. The paper relates the variance of a Boolean function to coordinate influences and the probabilities with which a decision algorithm examines those coordinates. This turns a statement about an algorithm's observations into a structural statement about its input variables.[ref]
Ryan O'Donnell studies theoretical computer science and the analysis of Boolean functions. His author homepage hosts the book Analysis of Boolean functions and research on computation, probability and quantum information.[ref] He coauthored Every decision tree has an influential variable by Ryan O'Donnell and others, connecting decision-tree computation to the influence of input coordinates.[ref]
Anatoly Karatsuba coauthored Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. Karatsuba multiplication replaces four half-size products by three, using an algebraic rearrangement to recover the middle term. The resulting recurrence relation gives the exponent instead of two in the usual digit-cost model. This is an early example of changing an algorithm's growth rate through an identity.[ref]
Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. Theorem 2 and proof, pp. 293–294
Portrait of Anatoly Karatsuba
. AliceNovak. CC BY-SA 3.0, via Wikimedia Commons. Source.David Parnas argued that software modules should hide design decisions that are likely to change. In On the Criteria To Be Used in Decomposing Systems into Modules by D. L. Parnas, alternative decompositions of the same task demonstrate that following execution steps alone does not necessarily isolate those decisions. This information hiding criterion makes a module's interface a boundary that reduces the effect of later implementation changes.[ref]
Portrait of David Parnas
. Hubert Baumeister. CC BY-SA 3.0, via Wikimedia Commons. Source.Robert Sedgewick coauthored Algorithms, 4th edition by Robert Sedgewick and others and Introduction to Programming in Java: An Interdisciplinary Approach by Robert Sedgewick and others. The books connect algorithms and data structures with implementations and cost analysis. For example, Insertion.java by Robert Sedgewick and others exposes how insertion sort shifts data and compares keys, making its behaviour available for direct inspection.[ref]
Insertion.java by Robert Sedgewick and others. implementation and class documentation
Portrait of Robert Sedgewick (computer scientist)
. Animalspirits; existing crop by Filetime. Creative Commons Attribution-ShareAlike 4.0 International, via Wikimedia Commons. Source.A communication protocol specifies the format and meaning of exchanged messages and the permitted behaviour of participants. Compatibility requires agreement about both message syntax and the state changes that messages cause.
The Internet interconnects independently operated computer networks using the Internet Protocol suite. Its common inter-network interface supports diverse underlying networks and applications; individual services can still depend on centrally controlled providers.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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








