Skip to main content Accessibility help
×
Hostname: page-component-77f85d65b8-g4pgd Total loading time: 0 Render date: 2026-04-12T17:41:51.257Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  19 December 2024

Dan S. Myers
Dan S. Myers
Affiliation:
Rollins College, Florida
Get access

Information

Type
Chapter
Information
Data Structures and Algorithms in Java
A Project-Based Approach
 , pp. 604 - 609
Publisher: Cambridge University Press
Print publication year: 2024

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

Adelson-Velsky, Georgy Maksimovich, and Landis, Evgenii Mikhailovich. 1962. An algorithm for organization of information. Doklady Akademii Nauk, 146: 263–266.Google Scholar
Aho, Alfred V., Sethi, Ravi, Ullman, Jeffrey D., et al. 2007. Compilers: Principles, Techniques, and Tools, vol. 2. Addison-Wesley.Google Scholar
Allouche, Jean-Paul, and Shallit, Jeffrey. 2003. Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press.CrossRefGoogle Scholar
Anderson, Julie, and Franceschi, Hervé J. 2014. Java Illuminated: An Active Learning Approach. Jones & Bartlett Publishers.Google Scholar
Appel, Kenneth I., and Haken, Wolfgang. 1989. Every Planar Map is Four Colorable. American Mathematical Society.CrossRefGoogle Scholar
Appleby, Austin. 2008. SMHasher. Online: Accessed July 4, 2023 from https://github.com/aappleby/smhasher.Google Scholar
Arpaci-Dusseau, Remzi H., and Arpaci-Dusseau, Andrea C. 2018. Operating Systems: Three Easy Pieces. Arpaci-Dusseau Books LLC.Google Scholar
Atwood, Jeff. 2007. The Danger of Naïveté. Online: Accessed August 1, 2022 from https://blog.codinghorror.com/the-danger-of-naivete/.Google Scholar
Bachmann, Paul. 1894. Die Analytische Zahlentheorie, vol. 2. Teubner.Google Scholar
Back, Adam. 2002. Hashcash: A Denial of Service Counter-Measure. Online: Accessed November 28, 2023 from www.hashcash.org/papers/hashcash.pdf.Google Scholar
Baecker, Ronald. 1998. Sorting out sorting: A case study of software visualization for teaching computer science. Software Visualization: Programming as a Multimedia Experience, 1, 369–381.Google Scholar
Bayer, Rudolf, and McCreight, Edward. 1970. Organization and maintenance of large ordered indices. Pages 107–141 of: Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control.CrossRefGoogle Scholar
Bentley, Jon. 2016. Programming Pearls. Addison-Wesley Professional.Google Scholar
Bentley, Jon L., and McIlroy, M. Douglas. 1993. Engineering a sort function. Software: Practice and Experience, 23(11), 1249–1265.Google Scholar
Berners-Lee, Timothy J. 1989. Information Management: A Proposal. Technical Report.Google Scholar
Berto, Francesco, and Tagliabue, Jacopo. 2006. Cellular Automata. The Stanford Encyclopedia of Philosophy (Spring 2022 edition), Zalta, Edward N. (ed.) Online: Accessed October 30, 2022 from https://plato.stanford.edu/archives/spr2022/entries/cellular-automata/.Google Scholar
Bloch, Joshua. 2006. Extra, extra – read all about it: Nearly all binary searches and mergesorts are broken. Online: Accessed October 30, 2021 from http://googleresearch.blogspot.com/2006/06/extra-extra-read-allabout-it-nearly.html.Google Scholar
Bourke, Paul. 2002. The Mandelbrot set at a glance. Online: Accessed 30 August 2022 from http://paulbourke.net/fractals/mandelbrot/.Google Scholar
Brin, Sergey, and Page, Lawrence. 1998. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1–7), 107–117.CrossRefGoogle Scholar
Bush, Vannevar. 1945. As we may think. The Atlantic Monthly, 176(1), 101–108.Google Scholar
Cerf, Vinton, and Kahn, Bob. 1990. Selected ARPANET Maps. Computer Communications Review (CCR), 20, 81–110.Google Scholar
Chea, Rattanak. 2018. Amazon’s Interview Question: Count Island. Online: Accessed December 21, 2022 from https://dev.to/rattanakchea/amazons-interview-question-count-island-21h6.Google Scholar
Chomsky, Noam. 1956. Three models for the description of language. IRE Transactions on Information Theory, 2(3), 113–124.CrossRefGoogle Scholar
Collavo, Alberto, Glew, Robert H., Huang, Yung-Sheng, et al. 2005. House cricket small-scale farming. Ecological Implications of Minilivestock: Potential of Insects, Rodents, Frogs and Snails, 27, 515–540.Google Scholar
Conway, John Horton. 1973. Tomorrow is the day after doomsday. Eureka, 36, 28–31.Google Scholar
Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford. 2022. Introduction to Algorithms. MIT Press.Google Scholar
Dahl, Ole-Johan. 2004. The birth of object orientation: The Simula languages. Pages 15–25 of: From Object-Orientation to Formal Methods. Springer.Google Scholar
Deitel, H.M., and Deitel, P.J.C. 2005. How to Program. Pearson Education.Google Scholar
Dijkstra, Edsger Wybe. 1976. A Discipline of Programming. Prentice-Hall.Google Scholar
Doctorow, Cory. 2007. Famous poems as limericks. Online: Accessed May 26, 2022 from https://boingboing.net/2007/07/23/famous-poems-as-lime.html.Google Scholar
Droste, Magdalena. 2002. Bauhaus, 1919–1933. Taschen.Google Scholar
Eckhardt, Roger. 1987. Stan Ulam, John von Neumann, and the Monte Carlo method. Los Alamos Science, 15(131–136), 30.Google Scholar
Eksombatchai, Chantat, Jindal, Pranav, Liu, Jerry Zitao, et al. 2018. Pixie: A system for recommending 3+ billion items to 200+ million users in real-time. Pages 1775–1784 of: Proceedings of the 2018 World Wide Web Conference.CrossRefGoogle Scholar
Engelbart, Christina. 1986. A lifetime pursuit: A brief history of Doug Engelbart’s work by Christina Engelbart. Online: Accessed June 12, 2022 from https://dougengelbart.org/content/view/183/.Google Scholar
Euler, Leonhard. 1782. Recherches sur un nouvelle espéce de quarrés magiques. Verhandelingen uitgegeven door het zeeuwsch Genootschap der Wetenschappen te Vlissingen, 85–239.Google Scholar
Everson, Michael, McGowan, Rick, Whistler, Ken, and Umamaheswaran, V.S. 2021. Roadmap to the basic multilingual plane. Online: Accessed August 28, 2022 from https://unicode.org/roadmaps/bmp/.Google Scholar
Floyd, Robert W. 1964. Algorithm 245: Treesort. Communications of the ACM, 7(12), 701.CrossRefGoogle Scholar
Fredman, Michael L., and Tarjan, Robert Endre. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM), 34(3), 596–615.CrossRefGoogle Scholar
Freeman, Eric, Robson, Elisabeth, Bates, Bert, and Sierra, Kathy. 2004. Head First Design Patterns: A Brain-Friendly Guide. O’Reilly Media.Google Scholar
Friedman, Daniel P., and Felleisen, Matthias. 1995. The Little Schemer. MIT Press.Google Scholar
Gandz, Solomon. 1926. The origin of the term “Algebra.” The American Mathematical Monthly, 33(9), 437–440.Google Scholar
Gardner, Martin. 1970. The fantastic combinations of John Conway’s New Solitaire Game of Life. Scientific American, 223, 20–123.Google Scholar
Gardner, Martin. 2001. The Colossal Book of Mathematics. W.W. Norton.Google Scholar
Geiling, Natasha. 2014. The World’s Longest Beard Is One of the Smithsonian’s Strangest Artifacts. Online: Accessed August 28, 2022 from www.smithsonianmag.com/smithsonian-institution/smithsonian-home-worlds-longest-beard-180953370/.Google Scholar
Gleick, James. 2008. Chaos: Making a New Science. Penguin.Google Scholar
Goldberg, Adele, and Robson, David. 1983. Smalltalk-80: The Language and Its Implementation. Addison-Wesley Longman.Google Scholar
Google. 2022a. Google Java style guide. Online: Accessed August 28, 2022 from https://google.github.io/styleguide/javaguide.html.Google Scholar
Google. 2022b. How Google Search organizes information. Online: Accessed May 14, 2022 from www.google.com/search/howsearchworks/how-search-works/organizing-information/.Google Scholar
Gross, Jonathan L., and Yellen, Jay. 2003. Handbook of Graph Theory. CRC Press.CrossRefGoogle Scholar
Guibas, Leo J., and Sedgewick, Robert. 1978. A dichromatic framework for balanced trees. Pages 8–21 of: 19th Annual Symposium on Foundations of Computer Science (SFCS 1978). IEEE.Google Scholar
Harchol-Balter, Mor. 2013. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press.CrossRefGoogle Scholar
Hoare, Charles Antony Richard., 1961a. Algorithm 64: quicksort. Communications of the ACM, 4(7), 321.Google Scholar
Hoare, Charles Antony Richard., 1961b. Algorithm 65: find. Communications of the ACM, 4(7), 321–322.Google Scholar
Hofstadter, Douglas R. 1979. Gödel, Escher, Bach: An Eternal Golden Braid. Basic Books.Google Scholar
Johnson, Eric M. 2005. Open Source Shakespeare: An Experiment in Literary Technology. Ph.D. thesis, George Mason University.Google Scholar
Kennedy, James, and Eberhart, Russell. 1995. Particle swarm optimization. Pages 1942–1948 of: Proceedings of ICNN’95 – International Conference on Neural Networks, vol. 4. IEEE.Google Scholar
Knuth, Donald E. 1972. Ancient Babylonian algorithms. Communications of the ACM, 15(7), 671–677.CrossRefGoogle Scholar
Knuth, Donald E. 1976. Big omicron and big omega and big theta. ACM Sigact News, 8(2), 18–24.CrossRefGoogle Scholar
Knuth, Donald E. 2014a. Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley Professional.Google Scholar
Knuth, Donald E. 2014b. Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley Professional.Google Scholar
Knuth, Donald E. 2014c. Art of Computer Programming, Volume 3: Searching and Sorting. Addison-Wesley Professional.Google Scholar
Kraitchik, Maurice. 1942. Mathematical Recreations. W.W. Norton.Google Scholar
Kruskal, Joseph B. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48–50.CrossRefGoogle Scholar
Kushagra, Shrinu, López-Ortiz, Alejandro, Qiao, Aurick, and Munro, J. Ian. 2014. Multi-pivot quicksort: Theory and experiments. Pages 47–60 of: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM.Google Scholar
LifeWiki. 2022. Online: Accessed October 30, 2022 from https://conwaylife.com/wiki/Main_Page.Google Scholar
Louvet, Jean-Pierre, and Martínez, Juan Luis. 2003. Fractal art FAQ. Online: Accessed August 30, 2022 from www.fractalus.com/fractal-art-faq/index.html.Google Scholar
Lyons, James. 2012. Practical cryptography. Online: Accessed May 26, 2022 from https://practicalcryptography.com/.Google Scholar
Mandelbrot, Benoit. 1967. How long is the coast of Britain? Statistical self-similarity and fractional dimension. Science, 156(3775), 636–638.CrossRefGoogle Scholar
Martin, Keith M. 2012. Everyday Cryptography. Oxford University Press.CrossRefGoogle Scholar
Michail, Dimitrios, Kinable, Joris, Naveh, Barak, and Sichi, John V. 2020. JGraphT: a Java library for graph data structures and algorithms. ACM Transactions on Mathematical Software, 46(2).CrossRefGoogle Scholar
Montfort, Nick. 2005. Twisty Little Passages: An Approach to Interactive Fiction. MIT Press.Google Scholar
Morgan, Nick. 2015. Easy forth. Online: Accessed July 4, 2023 from https://skilldrick.github.io/easyforth/.Google Scholar
Morris, Robert, and Thompson, Ken. 1979. Password security: A case history. Communications of the ACM, 22(11), 594–597.CrossRefGoogle Scholar
Munroe, Randall. 2011. Password strength. Online: Accessed July 4, 2023 from https://xkcd.com/936/.Google Scholar
Nakamoto, Satoshi. 2008. Bitcoin: A peer-to-peer electronic cash system. Online: Accessed November 28, 2023 from https://bitcoin.org/bitcoin.pdf.Google Scholar
Nebel, Markus E., Wild, Sebastian, and Martínez, Conrado. 2016. Analysis of pivot sampling in dual-pivot quicksort: A holistic analysis of Yaroslavskiy’s partitioning scheme. Algorithmica, 75(4), 632–683.CrossRefGoogle Scholar
Neumueller, Alexander. 2023. Bitcoin electricity consumption: An improved assessment. Online: Accessed November 28, 2023 from www.jbs.cam.ac.uk/2023/bitcoin-electricity-consumption/.Google Scholar
Nicholas, Nick, and Strader, Andrew. 2000. The Klingon Hamlet. Pocket Books.Google Scholar
Nikoli. 2021. Nikoli puzzles. Online: Accessed September 4, 2023 from www.nikoli.co.jp/en/puzzles/.Google Scholar
Nyce, James M., and Kahn, Paul. 1991. From Memex to Hypertext: Vannevar Bush and the Mind’s Machine. Academic Press Professional.Google Scholar
Nystrom, Robert. 2021. Crafting Interpreters. Genever Benning.Google Scholar
OpenJDK. 2013. TreeMap.java. Online: Accessed September 10, 2023 from https://hg.openjdk.org/jdk8/jdk8/jdk/file/tip/src/share/classes/java/util/TreeMap.java.Google Scholar
OpenJDK. 2014. DualPivotQuicksort.java. Online: Accessed October 29, 2022 from http://hg.openjdk.java.net/jdk8/jdk8/jdk/file/tip/src/share/classes/java/util/\DualPivotQuicksort.java.Google Scholar
Oracle. 2023. HotSpot garbage collection basics. Online: Accessed August 27, 2022 from www.oracle.com/webfolder/technetwork/tutorials/obe/java/gc01/index.html.Google Scholar
Page, Lawrence, Brin, Sergey, Motwani, Rajeev, and Winograd, Terry. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab.Google Scholar
Pagh, Rasmus, and Rodler, Flemming Friche. 2004. Cuckoo hashing. Journal of Algorithms, 51(2), 122–144.CrossRefGoogle Scholar
Papert, Seymour A. 1980. Mindstorms: Children, Computers, and Powerful Ideas. Basic Books.Google Scholar
Perlman, Radia. 1985. An algorithm for distributed computation of a spanning tree in an extended LAN. ACM SIGCOMM Computer Communication Review, 15(4), 44–53.CrossRefGoogle Scholar
Peters, Tim. 2002. Timsort. Online: Accessed October 30, 2022 from https://svn.python.org/projects/python/trunk/Objects/listsort.txt.Google Scholar
Peyrott, Sebastian. 2017. A brief history of JavaScript. Online: Accessed August 28, 2022 from https://auth0.com/blog/a-brief-history-of-javascript/.Google Scholar
Piantadosi, Steven T. 2014. Zipf’s word frequency law in natural language: a critical review and future directions. Psychonomic Bulletin Review, 21, 1112–1130.CrossRefGoogle Scholar
Poitevin, Pierre-Marie. 2020. Leetcode 1670: Design front middle back queue. Online: Accessed December 21, 2022 from https://poitevinpm.medium.com/leetcode-1670-design-front-middle-back-queue-7ee2ce386d0d.Google Scholar
Porter, Martin F. 1980. An algorithm for sufix stripping. Program, 14(3), 130–137.CrossRefGoogle Scholar
Porter, Martin F. 2006. The Porter stemming algorithm. Online: Accessed May 27, 2022 from https://tartarus.org/martin/PorterStemmer/.Google Scholar
Prim, Robert Clay. 1957. Shortest connection networks and some generalizations. The Bell System Technical Journal, 36(6), 1389–1401.CrossRefGoogle Scholar
Project Gutenberg. 1998. Macbeth. Online: Accessed May 26, 2022 from www.gutenberg.org/ebooks/1533.Google Scholar
Provos, Niels, and Mazieres, David. 1999. A future-adaptable password scheme. Pages 81–91 of: USENIX Annual Technical Conference, FREENIX Track.Google Scholar
Pullen, Walter. 2022. Think labyrinth. Online: Accessed July 3, 2023 from www.astrolog.org/labyrnth/algrithm.htm.Google Scholar
Python. 2022. dis — Disassembler for Python bytecode. Online: Accessed August 28, 2022 from https://docs.python.org/3/library/dis.html.Google Scholar
Reed, Aaron. 2021. 50 years of text games. Online: Accessed July 3, 2023 from https://if50.substack.com/.Google Scholar
Reeves, William T. 1983. Particle systems: A technique for modeling a class of fuzzy objects. ACM Transactions on Graphics (TOG), 2(2), 91–108.CrossRefGoogle Scholar
Reinhold, Arnold. 1995. The Diceware passphrase home page. Online: Accessed July 3, 2023 from https://theworld.com/reinhold/diceware.html.Google Scholar
Reynolds, Craig W. 1987. Flocks, herds and schools: A distributed behavioral model. Pages 25–34 of: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques.CrossRefGoogle Scholar
Reynolds, Craig W. 2001. Boids: background and update. Online: Accessed March 15, 2023 from www.red3d.com/cwr/boids/.Google Scholar
Russell, Stuart, and Norvig, Peter. 2020. Artificial Intelligence: A Modern Approach, 4th edn. Prentice Hall.Google Scholar
Sanderson, Mark, and Croft, W. Bruce. 2012. The history of information retrieval research. Proceedings of the IEEE, 100(Special Centennial Issue), 1444–1451.CrossRefGoogle Scholar
Sedgewick, Robert. 1978. Implementing quicksort programs. Communications of the ACM, 21(10), 847–857.CrossRefGoogle Scholar
Seidel, Raimund, and Aragon, Cecilia R. 1996. Randomized search trees. Algorithmica, 16(4), 464–497.CrossRefGoogle Scholar
Shaffer, Clifford A. 1997. A Practical Introduction to Data Structures and Algorithm Analysis. Prentice Hall.Google Scholar
Shannon, Claude Elwood. 1948. A mathematical theory of communication. The Bell System Technical Journal, 27(3), 379–423.CrossRefGoogle Scholar
Shell, Donald L. 1959. A high-speed sorting procedure. Communications of the ACM, 2(7), 30–32.CrossRefGoogle Scholar
Skiena, Steven S. 1998. The Algorithm Design Manual, vol. 2. Springer.Google Scholar
Sleator, Daniel Dominic, and Tarjan, Robert Endre. 1985. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3), 652–686.CrossRefGoogle Scholar
Smyth, A.S.H. 2018. The weird world of the hapax legomenon. Online: Accessed July 3, 2023 from www.spectator.co.uk/article/the-weird-world-of-the-hapaxlegomenon/.Google Scholar
St. John, James. 2016. Conus textile (textile cone snail) 3. Online: Accessed October 30, 2022 from www.flickr.com/photos/jsjgeology/31207880866.Google Scholar
Stephenson, Brian. 2018. Random Mondrian art. Online: Accessed August 30, 2022 from http://nifty.stanford.edu/2018/stephenson-mondrian-art/.Google Scholar
Stroethoff, Karel. 2014. Bhaskara’s approximation for the sine. The Mathematics Enthusiast, 11(3), 485–492.CrossRefGoogle Scholar
Sullivan, Andrew. 2009. The beard-second. Online: Accessed August 26, 2022 from www.theatlantic.com/daily-dish/archive/2009/11/-a-beard-second/194602/.Google Scholar
Target, Sinclair. 2019. How much of a genius-level move was using binary space partitioning in Doom? Online: Accessed September 4, 2023 from https://twobithistory.org/2019/11/06/doom-bsp.html.Google Scholar
V8 Dev. 2010. Digging into the TurboFan JIT. Online: Accessed August 28, 2022 from https://v8.dev/blog/turbofan-jit.Google Scholar
Vandevenne, Lode. 2007. Lode’s computer graphics tutorial. Online: Accessed March 15, 2023 from https://lodev.org/cgtutor/fire.html.Google Scholar
Vernon, Jennifer. 2010. Shakespeare’s coined words now common currency. Online: Accessed June 12, 2022 from www.nationalgeographic.com/culture/article/shakespeares-coined-words-now-common-currency.Google Scholar
Williams, John William Joseph. 1964. Algorithm 232: Heapsort. Communications of the ACM, 7, 347–348.Google Scholar
Wirth, Niklaus. 1976. Algorithms + Data Structures = Programs. Prentice-Hall.Google Scholar
Wolfram, Stephen. 1983. Statistical mechanics of cellular automata. Reviews of Modern Physics, 55(3), 601.CrossRefGoogle Scholar
Yan, Xiang, Diaconis, Persi, Rusmevichientong, Paat, and Roy, Benjamin. 2004. Solitaire: Man versus machine. Advances in Neural Information Processing Systems, 17.Google Scholar
Yaroslavskiy, Vladimir. 2009. Dual-pivot quicksort. Research Disclosure.Google Scholar
Yeomans, Julian Scott. 2003. Solving “Einstein’s riddle” using spreadsheet optimization. INFORMS Transactions on Education, 3(2), 55–63.CrossRefGoogle Scholar
Young, Elaine. 2007. Euler squares. Online: Accessed June 12, 2022 from https://maa.org/press/periodicals/convergence/euler-squares-introduction.Google Scholar

Accessibility standard: Unknown

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

Accessibility compliance for the HTML of this chapter is currently unknown and may be updated in the future.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Dan S. Myers, Rollins College, Florida
  • Book: Data Structures and Algorithms in Java
  • Online publication: 19 December 2024
  • Chapter DOI: https://doi.org/10.1017/9781009260350.025
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Dan S. Myers, Rollins College, Florida
  • Book: Data Structures and Algorithms in Java
  • Online publication: 19 December 2024
  • Chapter DOI: https://doi.org/10.1017/9781009260350.025
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Dan S. Myers, Rollins College, Florida
  • Book: Data Structures and Algorithms in Java
  • Online publication: 19 December 2024
  • Chapter DOI: https://doi.org/10.1017/9781009260350.025
Available formats
×