Rename "References" section to "Bibliography".
parent
be383ef6d5
commit
4b65764c89
|
@ -352,7 +352,7 @@ Reference: Ronald L. Graham, Donald Ervin Knuth, and Oren Patashnik, *Concrete M
|
|||
<!--ID: 1708115683366-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
* Ronald L. Graham, Donald Ervin Knuth, and Oren Patashnik, *Concrete Mathematics: A Foundation for Computer Science*, 2nd ed (Reading, Mass: Addison-Wesley, 1994).
|
||||
|
|
|
@ -292,7 +292,7 @@ Tags: binary::hex
|
|||
<!--ID: 1708631918829-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
* “Radix,” in *Wikipedia*, August 6, 2023, [https://en.wikipedia.org/w/index.php?title=Radix&oldid=1169046173](https://en.wikipedia.org/w/index.php?title=Radix&oldid=1169046173).
|
|
@ -150,6 +150,6 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1709666305449-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -142,6 +142,6 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1709666305447-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -169,7 +169,7 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1709302343255-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
||||
* Ronald L. Graham, Donald Ervin Knuth, and Oren Patashnik, *Concrete Mathematics: A Foundation for Computer Science*, 2nd ed (Reading, Mass: Addison-Wesley, 1994).
|
||||
|
|
|
@ -126,7 +126,7 @@ Reference: “Square Number,” in _Wikipedia_, May 10, 2023, [https://en.wikipe
|
|||
<!--ID: 1709422558648-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
||||
* “Square Number,” in _Wikipedia_, May 10, 2023, [https://en.wikipedia.org/w/index.php?title=Square_number&oldid=1154182731](https://en.wikipedia.org/w/index.php?title=Square_number&oldid=1154182731).
|
|
@ -254,7 +254,7 @@ Reference: “Triangular Number,” in _Wikipedia_, January 13, 2024, [https://e
|
|||
<!--ID: 1709419325981-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
||||
* “Triangular Number,” in _Wikipedia_, January 13, 2024, [https://en.wikipedia.org/w/index.php?title=Triangular_number&oldid=1195279122](https://en.wikipedia.org/w/index.php?title=Triangular_number&oldid=1195279122).
|
|
@ -120,6 +120,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1708174545527-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||
|
|
|
@ -97,6 +97,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1708742467187-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
|
@ -85,6 +85,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1707329951150-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
|
@ -1247,6 +1247,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1709752223586-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
|
@ -198,6 +198,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1707504634803-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||
|
|
|
@ -108,7 +108,7 @@ Reference: “Kernel — Elixir v1.16.1,” accessed February 2, 2024, [https://
|
|||
<!--ID: 1706913303160-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., *Introduction to Algorithms*, 3rd ed (Cambridge, Mass: MIT Press, 2009).
|
||||
* “Kernel — Elixir v1.16.1,” accessed February 2, 2024, [https://hexdocs.pm/elixir/1.16/Kernel.html#module-structural-comparison](https://hexdocs.pm/elixir/1.16/Kernel.html#module-structural-comparison).
|
||||
|
|
|
@ -214,6 +214,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1707399790960-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||
|
|
|
@ -159,6 +159,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1708742590435-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||
|
|
|
@ -174,6 +174,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1708002177782-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||
|
|
|
@ -55,7 +55,7 @@ Reference: Cooper, Mendel. “Advanced Bash-Scripting Guide,” n.d., 916.
|
|||
<!--ID: 1706885111460-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Cooper, Mendel. “Advanced Bash-Scripting Guide,” n.d., 916.
|
||||
* Robbins, Arnold D. “GAWK: Effective AWK Programming,” October 2023. [https://www.gnu.org/software/gawk/manual/gawk.pdf](https://www.gnu.org/software/gawk/manual/gawk.pdf)
|
|
@ -64,6 +64,6 @@ It's interesting to think what else can be used as a measure of a command's robu
|
|||
|
||||
The above scenarios are what makes something like [[nix/index|nix]] so compelling.
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Robbins, Arnold D. “GAWK: Effective AWK Programming,” October 2023. [https://www.gnu.org/software/gawk/manual/gawk.pdf](https://www.gnu.org/software/gawk/manual/gawk.pdf)
|
||||
|
|
|
@ -52,7 +52,7 @@ Reference: Robbins, Arnold D. “GAWK: Effective AWK Programming,” October 202
|
|||
<!--ID: 1706726911470-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Cooper, Mendel. “Advanced Bash-Scripting Guide,” n.d., 916.
|
||||
* Robbins, Arnold D. “GAWK: Effective AWK Programming,” October 2023. [https://www.gnu.org/software/gawk/manual/gawk.pdf](https://www.gnu.org/software/gawk/manual/gawk.pdf)
|
|
@ -114,6 +114,6 @@ int main() {
|
|||
|
||||
The above snippet can be used to check endianness on the current machine. If big-endian, the output should be `01 23 45 67`. If little-endian, `67 45 23 01`.
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
|
@ -353,6 +353,6 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1707493017246-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
|
|
|
@ -1057,7 +1057,7 @@ Tags: encoding::unicode
|
|||
<!--ID: 1706976705750-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Arnold D. Robbins, “GAWK: Effective AWK Programming,” October 2023, [https://www.gnu.org/software/gawk/manual/gawk.pdf](https://www.gnu.org/software/gawk/manual/gawk.pdf).
|
||||
* Brian W. Kernighan and Dennis M. Ritchie, *The C Programming Language*, 2nd ed (Englewood Cliffs, N.J: Prentice Hall, 1988).
|
||||
|
|
|
@ -54,6 +54,6 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1708217738491-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -605,6 +605,6 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1708451749791-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -91,6 +91,6 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1708438356493-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -142,6 +142,6 @@ Back:
|
|||
<!--ID: 1709306140891-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
||||
|
|
|
@ -117,6 +117,6 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1708221293502-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -487,7 +487,7 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1708366788641-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
||||
|
|
|
@ -87,6 +87,6 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1707757786295-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
|
@ -1454,7 +1454,7 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1710680824867-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
* “Scientific Notation.” In _Wikipedia_, March 6, 2024. [https://en.wikipedia.org/w/index.php?title=Scientific_notation&oldid=1212169750](https://en.wikipedia.org/w/index.php?title=Scientific_notation&oldid=1212169750).
|
||||
|
|
|
@ -2114,7 +2114,7 @@ Tags: c17
|
|||
<!--ID: 1709831032461-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
* Finley, Thomas. “Two’s Complement,” April 2000. [https://www.cs.cornell.edu/~tomf/notes/cps104/twoscomp.html](https://www.cs.cornell.edu/~tomf/notes/cps104/twoscomp.html).
|
||||
|
|
|
@ -97,7 +97,7 @@ Reference: “Content-Addressable Storage,” in _Wikipedia_, February 27, 2024,
|
|||
<!--ID: 1709177255573-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* “Content-Addressable Storage,” in _Wikipedia_, February 27, 2024, [https://en.wikipedia.org/w/index.php?title=Content-addressable_storage&oldid=1210669681](https://en.wikipedia.org/w/index.php?title=Content-addressable_storage&oldid=1210669681).
|
||||
* Scott Chacon, _Pro Git_, Second edition, The Expert’s Voice in Software Development (New York, NY: Apress, 2014).
|
|
@ -618,6 +618,6 @@ Reference: Scott Chacon, *Pro Git*, Second edition, The Expert’s Voice in Soft
|
|||
<!--ID: 1711120782272-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Scott Chacon, *Pro Git*, Second edition, The Expert’s Voice in Software Development (New York, NY: Apress, 2014).
|
|
@ -234,6 +234,6 @@ Reference: Scott Chacon, *Pro Git*, Second edition, The Expert’s Voice in Soft
|
|||
<!--ID: 1711120782244-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Scott Chacon, *Pro Git*, Second edition, The Expert’s Voice in Software Development (New York, NY: Apress, 2014).
|
|
@ -236,6 +236,6 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1707774068237-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
|
@ -887,7 +887,7 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in
|
|||
<!--ID: 1707939006297-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Avigad, Jeremy. ‘Theorem Proving in Lean’, n.d.
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
@ -38,6 +38,6 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in
|
|||
<!--ID: 1707675369187-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
@ -226,7 +226,7 @@ Reference: Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n
|
|||
<!--ID: 1708199272189-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
||||
|
|
|
@ -233,7 +233,7 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in
|
|||
<!--ID: 1707675399517-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
||||
* Oscar Levin, *Discrete Mathematics: An Open Introduction*, 3rd ed., n.d., [https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf](https://discrete.openmathbooks.org/pdfs/dmoi3-tablet.pdf).
|
|
@ -138,6 +138,6 @@ END%%
|
|||
|
||||
Gries lists other "Laws" but they don't seem as important to note here. What's worth noting is that the other [[equiv-trans#Equivalence Schemas|equivalence schemas]] still apply if we can limit operands to just $T$ and $F$.
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
@ -87,6 +87,6 @@ Reference: Gries, David. *The Science of Programming*. Texts and Monographs in
|
|||
<!--ID: 1707311869003-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
@ -111,6 +111,6 @@ Reference: Yin, Ryan. “NixOS and Flakes Book.” Nix, February 1, 2024. [https
|
|||
<!--ID: 1706828225240-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Yin, Ryan. “NixOS and Flakes Book.” Nix, February 1, 2024. [https://github.com/ryan4yin/nixos-and-flakes-book](https://github.com/ryan4yin/nixos-and-flakes-book)
|
||||
|
|
|
@ -328,7 +328,7 @@ Reference: Robbins, Arnold D. “GAWK: Effective AWK Programming,” October 202
|
|||
<!--ID: 1707050923740-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* “POSIX Basic Regular Expressions,” accessed February 4, 2024, [https://en.wikibooks.org/wiki/Regular_Expressions/POSIX_Basic_Regular_Expressions](https://en.wikibooks.org/wiki/Regular_Expressions/POSIX_Basic_Regular_Expressions).
|
||||
* Robbins, Arnold D. “GAWK: Effective AWK Programming,” October 2023. [https://www.gnu.org/software/gawk/manual/gawk.pdf](https://www.gnu.org/software/gawk/manual/gawk.pdf)
|
||||
|
|
|
@ -245,7 +245,7 @@ Tags: c17
|
|||
<!--ID: 1709131892349-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Cooper, Mendel. “Advanced Bash-Scripting Guide,” n.d., 916.
|
||||
* Dowling, “A List of Signals and What They Mean.”
|
||||
|
|
|
@ -1043,6 +1043,6 @@ Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (
|
|||
<!--ID: 1710807788538-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
|
@ -237,6 +237,6 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1711116523908-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
||||
|
|
|
@ -277,6 +277,6 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1710955847001-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
|
@ -60,6 +60,6 @@ Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Program
|
|||
<!--ID: 1710959313826-->
|
||||
END%%
|
||||
|
||||
## References
|
||||
## Bibliography
|
||||
|
||||
* Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
|
Loading…
Reference in New Issue