citations.bib

@book{epip,
    title = {{Elements of Programming Interviews in Python: The Insiders'
                  Guide}},
    author = {Aziz, Adnan and Lee, Tsung-Hsien and Prakash, Amit},
    year = {2018},
    isbn = {9781537713946},
    shorttitle = {Elements of Programming Interviews in Python},
    language = {eng},
    publisher = {CreateSpace Independent Publishing Platform (25 July. 2018)},
    month = jul,
    note = {OCLC: 1308498466},
}

@book{hd,
    title = {{Hacker's Delight}},
    author = {Warren, Henry S.},
    edition = {2nd ed},
    year = {2013},
    isbn = {9780321842688},
    publisher = {Addison-Wesley},
    keywords = {Computer programming},
    address = {Upper Saddle River, NJ},
}

@book{taocp1,
    title = {{The Art of Computer Programming: Fundamental Algorithms}},
    author = {Knuth, Donald Ervin},
    edition = {3rd ed},
    year = {1997},
    isbn = {0-201-89683-4},
    publisher = {Addison-Wesley},
    keywords = {Computer programming, Computer algorithms},
    address = {Reading, Mass},
}

@book{taocp3,
    title = {{The Art of Computer Programming: Sorting and Searching}},
    author = {Knuth, Donald Ervin},
    edition = {2nd ed},
    year = {1997},
    isbn = {0201896850 9780201896855},
    publisher = {Addison-Wesley},
    keywords = {Computer programming, Computer algorithms},
    address = {Reading, Mass},
}

@book{cormen,
    title = {{Introduction to Algorithms}},
    author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
    edition = {3rd ed},
    year = {2009},
    isbn = {9780262033848 9780262533058},
    publisher = {MIT Press},
    note = {OCLC: ocn311310321},
    keywords = {Computer programming, Computer algorithms},
    address = {Cambridge, Mass},
}

@book{sedgewick,
    title = {{Algorithms}},
    author = {Sedgewick, Robert and Wayne, Kevin Daniel},
    edition = {4th ed},
    year = {2011},
    isbn = {9780321573513},
    publisher = {Addison-Wesley},
    keywords = {Computer algorithms, Textbooks},
    address = {Upper Saddle River, NJ},
}

@book{levitin,
    title = {{Algorithmic Puzzles}},
    author = {Levitin, Anany and Levitin, Maria},
    year = {2011},
    isbn = {9780199740444},
    publisher = {Oxford University Press},
    keywords = {Mathematical recreations, Algorithms},
    address = {Oxford ; New York},
}

@book{pearls,
    title = {{Programming Pearls}},
    author = {Bentley, Jon Louis},
    edition = {2nd ed},
    year = {2000},
    isbn = {9780201657883},
    publisher = {Addison-Wesley},
    keywords = {Computer programming},
    address = {Reading, Mass},
}

@book{skiena,
    title = {{The Algorithm Design Manual}},
    author = {Skiena, Steven S.},
    edition = {2nd ed},
    year = {2008},
    isbn = {9781848000698 9781848000704},
    publisher = {Springer},
    note = {OCLC: ocn228582051},
    keywords = {Computer algorithms},
    address = {London},
}

@misc{se112007,
    title = {{O(1) space, O(N) complexity algorithm for buy and sell stock twice
                  interview question}},
    author = {eefiasfira
                  (https://cs.stackexchange.com/users/107747/eefiasfira)},
    howpublished = {Computer Science Stack Exchange},
    note = {URL:https://cs.stackexchange.com/q/112007 (version: 2021-04-21)},
    eprint = {https://cs.stackexchange.com/q/112007},
    url = {https://cs.stackexchange.com/q/112007}
}

@article{knuth_literate_1984,
    title = {{Literate Programming}},
    volume = {27},
    issn = {0010-4620, 1460-2067},
    url = {https://academic.oup.com/comjnl/article-lookup/doi/10.1093/comjnl/27.2.97},
    doi = {10.1093/comjnl/27.2.97},
    language = {en},
    number = {2},
    urldate = {2023-05-03},
    journal = {The Computer Journal},
    author = {Knuth, D. E.},
    month = feb,
    year = {1984},
    pages = {97--111},
}

@article{ramsey_literate_1994,
    title = {{Literate programming simplified}},
    author = {Ramsey, Norman},
    year = {1994},
    journal = {IEEE Software},
    volume = {11},
    issn = {1937-4194},
    doi = {10.1109/52.311070},
    abstract = {Literate programming tools let you arrange the parts of a
                  program in any order and extract documentation and code from
                  the same source file. The author argues that
                  language-dependence and feature complexity have hampered
                  acceptance of these tools, then offers a simpler
                  alternative.{\textless}{\textgreater}},
    number = {5},
    month = sep,
    keywords = {Documentation, Code standards, Writing, Program processors,
                  Computer languages, Operating systems, Internet, Strips,
                  Pipelines},
    pages = {97--105},
}

@misc{daescu2018kmaximum,
      title={k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler},
      author={Ovidiu Daescu and Hemant Malik},
      year={2018},
      eprint={1804.05956},
      archivePrefix={arXiv},
      primaryClass={cs.DS}
}