notebook.bib

@misc{antileafstandard,
  author       = {All{-}in at the {R}iver},
  title        = {Standard {C}ode {L}ibrary},
  year         = {2018},
  publisher    = {GitHub},
  journal      = {GitHub Repository},
  howpublished = {\url{https://github.com/AntiLeaf/Standard-Code-Library}}
}

@misc{bqi343cp,
  author       = {Benjamin Qi, Spencer Compton, Zhezheng Luo},
  title        = {cp-notebook},
  year         = {2017},
  publisher    = {GitHub},
  journal      = {GitHub Repository},
  howpublished = {\url{https://github.com/bqi343/cp-notebook}}
}

@article{massey1969shift,
  author  = {Massey, J.},
  journal = {IEEE Transactions on Information Theory},
  title   = {Shift-register synthesis and BCH decoding},
  year    = {1969},
  volume  = {15},
  number  = {1},
  pages   = {122-127},
  doi     = {10.1109/TIT.1969.1054260}
}

@article{wiedemann1986solving,
  author  = {Wiedemann, D.},
  journal = {IEEE Transactions on Information Theory},
  title   = {Solving sparse linear equations over finite fields},
  year    = {1986},
  volume  = {32},
  number  = {1},
  pages   = {54-62},
  doi     = {10.1109/TIT.1986.1057137}
}

@misc{oiwiki,
  author       = {OI Wiki Team},
  title        = {OI Wiki},
  year         = {2016},
  publisher    = {GitHub},
  journal      = {GitHub Repository},
  howpublished = {\url{https://github.com/OI-wiki/OI-wiki}}
}

@misc{trianglecenters,
  author       = {Clark Kimberling},
  title        = {Encyclopedia of Triangle Centers},
  year         = {2023},
  howpublished = {\url{https://faculty.evansville.edu/ck6/encyclopedia/ETC.html}}
}

@misc{enwiki:1166292319,
  author       = {{Wikipedia contributors}},
  title        = {Faulhaber's formula --- {Wikipedia}{,} The Free Encyclopedia},
  year         = {2023},
  howpublished = {\url{https://en.wikipedia.org/w/index.php?title=Faulhaber%27s_formula&oldid=1166292319}},
  note         = {[Online; accessed 21-October-2023]}
}

@article{ieee1451721,
  author  = {Agarwal, R.C. and Burrus, C.S.},
  journal = {Proceedings of the IEEE},
  title   = {Number theoretic transforms to implement fast digital convolution},
  year    = {1975},
  volume  = {63},
  number  = {4},
  pages   = {550-560},
  doi     = {10.1109/PROC.1975.9791}
}

@article{ebert1987versatile,
  author     = {Ebert, J\"{u}rgen},
  title      = {A Versatile Data Structure for Edge-Oriented Graph Algorithms},
  year       = {1987},
  issue_date = {June 1987},
  publisher  = {Association for Computing Machinery},
  address    = {New York, NY, USA},
  volume     = {30},
  number     = {6},
  issn       = {0001-0782},
  url        = {https://doi.org/10.1145/214762.214769},
  doi        = {10.1145/214762.214769},
  abstract   = {An abstract graph module that allows for easy and secure programming of a great number of graph algorithms is implemented by symmetrically stored forward and backward adjacency lists, thus supporting edge-oriented traversals of general directed and undirected graphs.},
  journal    = {Commun. ACM},
  month      = {jun},
  pages      = {513--519},
  numpages   = {7}
}

@inproceedings{bostan2021simple,
  title        = {A simple and fast algorithm for computing the N-th term of a linearly recurrent sequence},
  author       = {Bostan, Alin and Mori, Ryuhei},
  booktitle    = {Symposium on Simplicity in Algorithms (SOSA)},
  pages        = {118--132},
  year         = {2021},
  organization = {SIAM}
}

@article{zhan2016list,
  title     = {List-based simulated annealing algorithm for traveling salesman problem},
  author    = {Zhan, Shi-hua and Lin, Juan and Zhang, Ze-jun and Zhong, Yi-wen and others},
  journal   = {Computational intelligence and neuroscience},
  volume    = {2016},
  year      = {2016},
  publisher = {Hindawi}
}

@misc{tspvlsidatasets,
  author       = {Andre Rohe},
  title        = {{VLSI Data Sets}},
  year         = {2013},
  howpublished = {\url{https://www.math.uwaterloo.ca/tsp/vlsi/}}
}

@misc{enwiki:1188156145,
  author = {{Wikipedia contributors}},
  title  = {Alpha--beta pruning --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2023},
  url    = {https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&oldid=1188156145},
  note   = {[Online; accessed 27-December-2023]}
}

@misc{enwiki:1033199110,
  author = {{Wikipedia contributors}},
  title  = {SMAWK algorithm --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2021},
  url    = {https://en.wikipedia.org/w/index.php?title=SMAWK_algorithm&oldid=1033199110},
  note   = {[Online; accessed 6-February-2024]}
}

@misc{enwiki:1214062423,
  author = {{Wikipedia contributors}},
  title  = {Burrows--Wheeler transform --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2024},
  url    = {https://en.wikipedia.org/w/index.php?title=Burrows%E2%80%93Wheeler_transform&oldid=1214062423},
  note   = {[Online; accessed 3-April-2024]}
}

@misc{enwiki:1185721721,
  author = {{Wikipedia contributors}},
  title  = {Boyer--Moore string-search algorithm --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2023},
  url    = {https://en.wikipedia.org/w/index.php?title=Boyer%E2%80%93Moore_string-search_algorithm&oldid=1185721721},
  note   = {[Online; accessed 5-April-2024]}
}

@misc{enwiki:1136480391,
  author = {{Wikipedia contributors}},
  title  = {Boyer--Moore--Horspool algorithm --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2023},
  url    = {https://en.wikipedia.org/w/index.php?title=Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm&oldid=1136480391},
  note   = {[Online; accessed 5-April-2024]}
}

@misc{enwiki:1213681016,
  author = {{Wikipedia contributors}},
  title  = {Pisano period --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2024},
  url    = {https://en.wikipedia.org/w/index.php?title=Pisano_period&oldid=1213681016},
  note   = {[Online; accessed 7-April-2024]}
}

@misc{enwiki:1187705852,
  author = {{Wikipedia contributors}},
  title  = {Gomory--Hu tree --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2023},
  url    = {https://en.wikipedia.org/w/index.php?title=Gomory%E2%80%93Hu_tree&oldid=1187705852},
  note   = {[Online; accessed 9-April-2024]}
}

@article{brodal1996optimal,
  title     = {Optimal purely functional priority queues},
  author    = {Brodal, Gerth St{\o}lting and Okasaki, Chris},
  journal   = {Journal of Functional Programming},
  volume    = {6},
  number    = {6},
  pages     = {839--857},
  year      = {1996},
  publisher = {Cambridge University Press}
}

@book{menezes2018handbook,
  title     = {Handbook of applied cryptography},
  author    = {Menezes, Alfred J and Van Oorschot, Paul C and Vanstone, Scott A},
  year      = {2018},
  url       = {https://cacr.uwaterloo.ca/hac/},
  publisher = {CRC press}
}

@article{bannai2017runs,
  title     = {The ``Runs'' Theorem},
  volume    = {46},
  issn      = {1095-7111},
  url       = {http://dx.doi.org/10.1137/15M1011032},
  doi       = {10.1137/15m1011032},
  number    = {5},
  journal   = {SIAM Journal on Computing},
  publisher = {Society for Industrial & Applied Mathematics (SIAM)},
  author    = {Bannai, Hideo and I, Tomohiro and Inenaga, Shunsuke and Nakashima, Yuto and Takeda, Masayuki and Tsuruta, Kazuya},
  year      = {2017},
  month     = {jan},
  pages     = {1501--1514}
}

@misc{enwiki:1204698483,
  author = {{Wikipedia contributors}},
  title  = {Chordal graph --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2024},
  url    = {https://en.wikipedia.org/w/index.php?title=Chordal_graph&oldid=1204698483},
  note   = {[Online; accessed 24-April-2024]}
}
  
@misc{enwiki:1217459734,
  author = {{Wikipedia contributors}},
  title  = {Tree decomposition --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2024},
  url    = {https://en.wikipedia.org/w/index.php?title=Tree_decomposition&oldid=1217459734},
  note   = {[Online; accessed 24-April-2024]}
}

@misc{enwiki:1209826174,
  author = {{Wikipedia contributors}},
  title  = {Bron--Kerbosch algorithm --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2024},
  url    = {https://en.wikipedia.org/w/index.php?title=Bron%E2%80%93Kerbosch_algorithm&oldid=1209826174},
  note   = {[Online; accessed 15-May-2024]}
}

@misc{yoichi2012exponential,
  author = {岩田陽一},
  title  = {指数時間アルゴリズム入門},
  year   = {2012},
  url    = {https://www.slideshare.net/wata_orz/ss-12131479}
}

@article{gabow1976efficient,
  title     = {An efficient implementation of Edmonds' algorithm for maximum matching on graphs},
  author    = {Gabow, Harold N},
  journal   = {Journal of the ACM (JACM)},
  volume    = {23},
  number    = {2},
  pages     = {221--234},
  year      = {1976},
  publisher = {ACM New York, NY, USA}
}

@article{ahuja1997computational,
  title     = {Computational investigations of maximum flow algorithms},
  author    = {Ahuja, Ravindra K and Kodialam, Murali and Mishra, Ajay K and Orlin, James B},
  journal   = {European Journal of Operational Research},
  volume    = {97},
  number    = {3},
  pages     = {509--542},
  year      = {1997},
  publisher = {Elsevier}
}

@article{ruyi2016segbeats,
  title     = {区间最值操作与历史最值问题},
  author    = {吉如一},
  journal   = {信息学奥林匹克中国国家队候选队员论文集},
  pages     = {99--121},
  year      = {2016},
  publisher = {中国计算机学会}
}

@article{katz1974local,
  title     = {Local convergence in Fermat's problem},
  author    = {Katz, I Norman},
  journal   = {Mathematical Programming},
  volume    = {6},
  number    = {1},
  pages     = {89--104},
  year      = {1974},
  publisher = {Springer}
}

@article{brimberg1992local,
  title     = {Local convergence in a generalized Fermat-Weber problem},
  author    = {Brimberg, Jack and Love, Robert F},
  journal   = {Annals of Operations Research},
  volume    = {40},
  pages     = {33--66},
  year      = {1992},
  publisher = {Springer}
}

@article{vardi2000multivariate,
  title     = {The multivariate {L}1-median and associated data depth},
  author    = {Vardi, Yehuda and Zhang, Cun-Hui},
  journal   = {Proceedings of the National Academy of Sciences},
  volume    = {97},
  number    = {4},
  pages     = {1423--1426},
  year      = {2000},
  publisher = {National Acad Sciences}
}

@inproceedings{arlazarov1970yekonomnom,
  title        = {Об экономном построении транзитивного замыкания ориентированного графа},
  author       = {Арлазаров, Владимир Львович and Диниц, Ефим А and Кронрод, М А and Фараджев, Игорь Александрович},
  booktitle    = {Доклады Академии наук},
  volume       = {194},
  number       = {3},
  pages        = {487--488},
  year         = {1970},
  organization = {Российская академия наук}
}

@book{aho1974design,
  title     = {The design and analysis of computer algorithms},
  author    = {Aho, Alfred V and Hopcroft, John E},
  year      = {1974},
  publisher = {Pearson Education India}
}

@article{barber1996quickhull,
  title     = {The quickhull algorithm for convex hulls},
  author    = {Barber, C Bradford and Dobkin, David P and Huhdanpaa, Hannu},
  journal   = {ACM Transactions on Mathematical Software (TOMS)},
  volume    = {22},
  number    = {4},
  pages     = {469--483},
  year      = {1996},
  publisher = {Acm New York, NY, USA}
}

@misc{enwiki:1229899175,
  author = {{Wikipedia contributors}},
  title  = {Pfaffian --- {Wikipedia}{,} The Free Encyclopedia},
  year   = {2024},
  url    = {https://en.wikipedia.org/w/index.php?title=Pfaffian&oldid=1229899175},
  note   = {[Online; accessed 22-June-2024]}
}

@misc{enwiki:1216412359,
  author       = {{Wikipedia contributors}},
  title        = {FKT algorithm --- {Wikipedia}{,} The Free Encyclopedia},
  year         = {2024},
  howpublished = {\url{https://en.wikipedia.org/w/index.php?title=FKT_algorithm&oldid=1216412359}},
  note         = {[Online; accessed 22-June-2024]}
}

@article{garsia1977new,
  title     = {A new algorithm for minimum cost binary trees},
  author    = {Garsia, Adriano M and Wachs, Michelle L},
  journal   = {SIAM Journal on Computing},
  volume    = {6},
  number    = {4},
  pages     = {622--642},
  year      = {1977},
  publisher = {SIAM}
}

@article{kingston1988new,
  title     = {A new proof of the Garsia-Wachs algorithm},
  author    = {Kingston, Feffrey H},
  journal   = {Journal of Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {129--136},
  year      = {1988},
  publisher = {Elsevier}
}

@article{kinoshita2024power,
  title   = {Power Series Composition in Near-Linear Time},
  author  = {Kinoshita, Yasunori and Li, Baitian},
  journal = {arXiv preprint arXiv:2404.05177},
  year    = {2024}
}

@inproceedings{szHugyi2013random,
  title     = {Random number generator for C++ template metaprograms},
  author    = {Sz{\H{u}}gyi, Zal{\'a}n and Cs{\'e}ri, Tam{\'a}s and Porkol{\'a}b, Zolt{\'a}n},
  booktitle = {Proceedings of the 13th Symposium on Programming Languages and Software Tools (SPLST’13)},
  year      = {2013}
}

@article{matsumoto1998mersenne,
  title     = {Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator},
  author    = {Matsumoto, Makoto and Nishimura, Takuji},
  journal   = {ACM Transactions on Modeling and Computer Simulation (TOMACS)},
  volume    = {8},
  number    = {1},
  pages     = {3--30},
  year      = {1998},
  publisher = {ACM New York, NY, USA}
}

@article{johnson1879notes,
  title     = {Notes on the ``15'' puzzle},
  author    = {Johnson, Wm Woolsey and Story, William Edward and others},
  journal   = {American Journal of Mathematics},
  volume    = {2},
  number    = {4},
  pages     = {397--404},
  year      = {1879},
  publisher = {JSTOR}
}

@article{archer1999modern,
  title     = {A modern treatment of the 15 puzzle},
  author    = {Archer, Aaron F},
  journal   = {The American Mathematical Monthly},
  volume    = {106},
  number    = {9},
  pages     = {793--799},
  year      = {1999},
  publisher = {Taylor \& Francis}
}

@article{lemire2019fast,
  title     = {Fast Random Integer Generation in an Interval},
  volume    = {29},
  issn      = {1558-1195},
  url       = {http://dx.doi.org/10.1145/3230636},
  doi       = {10.1145/3230636},
  number    = {1},
  journal   = {ACM Transactions on Modeling and Computer Simulation},
  publisher = {Association for Computing Machinery (ACM)},
  author    = {Lemire, Daniel},
  year      = {2019},
  month     = jan,
  pages     = {1--12}
}