Boolean satisfiability problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Boolean satisfiability problem" in English language version.

refsWebsite

Global rank English rank

21doi.org

2^nd place

7semanticscholar.org

11^th place

8^th place

4psu.edu

207^th place

136^th place

4arxiv.org

69^th place

59^th place

3web.archive.org

1^st place

2ghostarchive.org

32^nd place

21^st place

2harvard.edu

18^th place

17^th place

2worldcat.org

5^th place

2springer.com

274^th place

309^th place

1cmu.edu

1,564^th place

1,028^th place

1fortnow.com

low place

1berkeley.edu

580^th place

462^nd place

1toronto.edu

low place

8,821^st place

1mathnet.ru

8,783^rd place

low place

1cwi.nl

low place

1neu.edu

low place

7,273^rd place

1books.google.com

3^rd place

1acm.org

1,185^th place

840^th place

1handle.net

102^nd place

76^th place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1princeton.edu

741^st place

577^th place

1illinois.edu

1,349^th place

866^th place

1satcompetition.org

low place

acm.org (Global: 1,185^th place; English: 840^th place)

portal.acm.org

R. E. Bryant, S. M. German, and M. N. Velev, Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions, in Analytic Tableaux and Related Methods, pp. 1–13, 1999.

arxiv.org (Global: 69^th place; English: 59^th place)

Akmal, Shyan; Williams, Ryan (2022). MAJORITY-3SAT (and Related Problems) in Polynomial Time. pp. 1033–1043. arXiv:2107.02748. doi:10.1109/FOCS52979.2021.00103. ISBN 978-1-6654-2055-6.
Selsam, Daniel; Lamm, Matthew; Bünz, Benedikt; Liang, Percy; de Moura, Leonardo; Dill, David L. (11 March 2019). "Learning a SAT Solver from Single-Bit Supervision". arXiv:1802.03685 [cs.AI].
Junqiang Peng and Mingyu Xiao (Aug 2022). Further improvements for SAT in terms of formula length (Technical Report). arXiv:2105.06131.
Huairui Chu and Mingyu Xiao and Zhe Zhang (Jul 2020). An improved upper bound for SAT (Technical Report). arxiv. arXiv:2007.03829.

berkeley.edu (Global: 580^th place; English: 462^nd place)

cs.berkeley.edu

Karp, Richard M. (1972). "Reducibility Among Combinatorial Problems" (PDF). In Raymond E. Miller; James W. Thatcher (eds.). Complexity of Computer Computations. New York: Plenum. pp. 85–103. ISBN 0-306-30707-3. Archived from the original (PDF) on 2011-06-29. Retrieved 2020-05-07. Here: p.86

books.google.com (Global: 3^rd place; English: 3^rd place)

Moore, Cristopher; Mertens, Stephan (2011), The Nature of Computation, Oxford University Press, p. 366, ISBN 9780199233212.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Fortnow, L. (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186. S2CID 5969255.

cwi.nl (Global: low place; English: low place)

homepages.cwi.nl

Schöning, Uwe (Oct 1999). "A probabilistic algorithm for k-SAT and constraint satisfaction problems" (PDF). 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 410–414. doi:10.1109/SFFCS.1999.814612. ISBN 0-7695-0409-4. S2CID 123177576. Archived (PDF) from the original on 2022-10-09.

doi.org (Global: 2^nd place; English: 2^nd place)

Fortnow, L. (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186. S2CID 5969255.
Ohrimenko, Olga; Stuckey, Peter J.; Codish, Michael (2007), "Propagation = Lazy Clause Generation", Principles and Practice of Constraint Programming – CP 2007, Lecture Notes in Computer Science, vol. 4741, pp. 544–558, CiteSeerX 10.1.1.70.5471, doi:10.1007/978-3-540-74970-7_39, ISBN 978-3-540-74969-1, modern SAT solvers can often handle problems with millions of constraints and hundreds of thousands of variables.
Hong, Ted; Li, Yanjing; Park, Sung-Boem; Mui, Diana; Lin, David; Kaleq, Ziyad Abdel; Hakim, Nagib; Naeimi, Helia; Gardner, Donald S.; Mitra, Subhasish (November 2010). "QED: Quick Error Detection tests for effective post-silicon validation". 2010 IEEE International Test Conference. pp. 1–10. doi:10.1109/TEST.2010.5699215. ISBN 978-1-4244-7206-2. S2CID 7909084.
Massacci, Fabio; Marraro, Laura (2000-02-01). "Logical Cryptanalysis as a SAT Problem". Journal of Automated Reasoning. 24 (1): 165–203. doi:10.1023/A:1006326723002. S2CID 3114247.
Mironov, Ilya; Zhang, Lintao (2006). "Applications of SAT Solvers to Cryptanalysis of Hash Functions". In Biere, Armin; Gomes, Carla P. (eds.). Theory and Applications of Satisfiability Testing - SAT 2006. Lecture Notes in Computer Science. Vol. 4121. Springer. pp. 102–115. doi:10.1007/11814948_13. ISBN 978-3-540-37207-3.
Vizel, Y.; Weissenbacher, G.; Malik, S. (2015). "Boolean Satisfiability Solvers and Their Applications in Model Checking". Proceedings of the IEEE. 103 (11): 2021–2035. doi:10.1109/JPROC.2015.2455034. S2CID 10190144.
Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (PDF). Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. pp. 151–158. CiteSeerX 10.1.1.406.395. doi:10.1145/800157.805047. S2CID 7573663. Archived (PDF) from the original on 2022-10-09.
Levin, Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы Передачи Информа́ции, Problemy Peredachi Informatsii). 9 (3): 115–116. (pdf) (in Russian), translated into English by Trakhtenbrot, B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. 6 (4): 384–400. Bibcode:1984IAHC....6d.384T. doi:10.1109/MAHC.1984.10036. S2CID 950581.
Schöning, Uwe (Oct 1999). "A probabilistic algorithm for k-SAT and constraint satisfaction problems" (PDF). 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 410–414. doi:10.1109/SFFCS.1999.814612. ISBN 0-7695-0409-4. S2CID 123177576. Archived (PDF) from the original on 2022-10-09.
Selman, Bart; Mitchell, David; Levesque, Hector (1996). "Generating Hard Satisfiability Problems". Artificial Intelligence. 81 (1–2): 17–29. CiteSeerX 10.1.1.37.7362. doi:10.1016/0004-3702(95)00045-3.
Arkin, Esther M.; Banik, Aritra; Carmi, Paz; Citovsky, Gui; Katz, Matthew J.; Mitchell, Joseph S. B.; Simakov, Marina (2018-12-11). "Selecting and covering colored points". Discrete Applied Mathematics. 250: 75–86. doi:10.1016/j.dam.2018.05.011. ISSN 0166-218X.
Buning, H.K.; Karpinski, Marek; Flogel, A. (1995). "Resolution for Quantified Boolean Formulas". Information and Computation. 117 (1). Elsevier: 12–18. doi:10.1006/inco.1995.1025.
Schaefer, Thomas J. (1978). "The complexity of satisfiability problems" (PDF). Proceedings of the 10th Annual ACM Symposium on Theory of Computing. San Diego, California. pp. 216–226. CiteSeerX 10.1.1.393.8951. doi:10.1145/800133.804350.
Akmal, Shyan; Williams, Ryan (2022). MAJORITY-3SAT (and Related Problems) in Polynomial Time. pp. 1033–1043. arXiv:2107.02748. doi:10.1109/FOCS52979.2021.00103. ISBN 978-1-6654-2055-6.
Blass, Andreas; Gurevich, Yuri (1982-10-01). "On the unique satisfiability problem". Information and Control. 55 (1): 80–88. doi:10.1016/S0019-9958(82)90439-9. hdl:2027.42/23842. ISSN 0019-9958.
Valiant, L.; Vazirani, V. (1986). "NP is as easy as detecting unique solutions" (PDF). Theoretical Computer Science. 47: 85–93. doi:10.1016/0304-3975(86)90135-0.
Buldas, Ahto; Lenin, Aleksandr; Willemson, Jan; Charnamord, Anton (2017). "Simple Infeasibility Certificates for Attack Trees". In Obana, Satoshi; Chida, Koji (eds.). Advances in Information and Computer Security. Lecture Notes in Computer Science. Vol. 10418. Springer International Publishing. pp. 39–55. doi:10.1007/978-3-319-64200-0_3. ISBN 9783319642000.
Gi-Joon Nam; Sakallah, K. A.; Rutenbar, R. A. (2002). "A new FPGA detailed routing approach via search-based Boolean satisfiability" (PDF). IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 21 (6): 674. Bibcode:2002ITCAD..21..674N. doi:10.1109/TCAD.2002.1004311. Archived from the original (PDF) on 2016-03-15. Retrieved 2015-09-04.
Junqiang Peng and Mingyu Xiao (Oct 2023). "Further improvements for SAT in terms of formula length". Information and Computation. 294 105085: Article number 105085. doi:10.1016/j.ic.2023.105085.
Huairui Chu and Mingyu Xiao and Zhe Zhang (Oct 2021). "An improved upper bound for SAT". Theoretical Computer Science. 887: 51–62. doi:10.1016/j.tcs.2021.06.045.
S. Liu (Jul 2018). I. Chatzigiannakis and C. Kaklamanis and D. Marx and D. Sannella (ed.). Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. Proc. ICALP. LIPIcs. Vol. 107. Schloss Dagstuhl. pp. 88:1–13. doi:10.4230/LIPIcs.ICALP.2018.88.

fortnow.com (Global: low place; English: low place)

lance.fortnow.com

Fortnow, L. (2021). "Fifty Years of P Versus NP and the Possibility of the Impossible" (PDF). Proceedings of ACM Conference (Conference'17).

ghostarchive.org (Global: 32^nd place; English: 21^st place)

Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (PDF). Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. pp. 151–158. CiteSeerX 10.1.1.406.395. doi:10.1145/800157.805047. S2CID 7573663. Archived (PDF) from the original on 2022-10-09.
Schöning, Uwe (Oct 1999). "A probabilistic algorithm for k-SAT and constraint satisfaction problems" (PDF). 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 410–414. doi:10.1109/SFFCS.1999.814612. ISBN 0-7695-0409-4. S2CID 123177576. Archived (PDF) from the original on 2022-10-09.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Blass, Andreas; Gurevich, Yuri (1982-10-01). "On the unique satisfiability problem". Information and Control. 55 (1): 80–88. doi:10.1016/S0019-9958(82)90439-9. hdl:2027.42/23842. ISSN 0019-9958.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Levin, Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы Передачи Информа́ции, Problemy Peredachi Informatsii). 9 (3): 115–116. (pdf) (in Russian), translated into English by Trakhtenbrot, B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. 6 (4): 384–400. Bibcode:1984IAHC....6d.384T. doi:10.1109/MAHC.1984.10036. S2CID 950581.
Gi-Joon Nam; Sakallah, K. A.; Rutenbar, R. A. (2002). "A new FPGA detailed routing approach via search-based Boolean satisfiability" (PDF). IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 21 (6): 674. Bibcode:2002ITCAD..21..674N. doi:10.1109/TCAD.2002.1004311. Archived from the original (PDF) on 2016-03-15. Retrieved 2015-09-04.

illinois.edu (Global: 1,349^th place; English: 866^th place)

cs-rutenbar.web.engr.illinois.edu

Gi-Joon Nam; Sakallah, K. A.; Rutenbar, R. A. (2002). "A new FPGA detailed routing approach via search-based Boolean satisfiability" (PDF). IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 21 (6): 674. Bibcode:2002ITCAD..21..674N. doi:10.1109/TCAD.2002.1004311. Archived from the original (PDF) on 2016-03-15. Retrieved 2015-09-04.

mathnet.ru (Global: 8,783^rd place; English: low place)

Levin, Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы Передачи Информа́ции, Problemy Peredachi Informatsii). 9 (3): 115–116. (pdf) (in Russian), translated into English by Trakhtenbrot, B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. 6 (4): 384–400. Bibcode:1984IAHC....6d.384T. doi:10.1109/MAHC.1984.10036. S2CID 950581.

neu.edu (Global: low place; English: 7,273^rd place)

ccs.neu.edu

Schaefer, Thomas J. (1978). "The complexity of satisfiability problems" (PDF). Proceedings of the 10th Annual ACM Symposium on Theory of Computing. San Diego, California. pp. 216–226. CiteSeerX 10.1.1.393.8951. doi:10.1145/800133.804350.

princeton.edu (Global: 741^st place; English: 577^th place)

cs.princeton.edu

Valiant, L.; Vazirani, V. (1986). "NP is as easy as detecting unique solutions" (PDF). Theoretical Computer Science. 47: 85–93. doi:10.1016/0304-3975(86)90135-0.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Ohrimenko, Olga; Stuckey, Peter J.; Codish, Michael (2007), "Propagation = Lazy Clause Generation", Principles and Practice of Constraint Programming – CP 2007, Lecture Notes in Computer Science, vol. 4741, pp. 544–558, CiteSeerX 10.1.1.70.5471, doi:10.1007/978-3-540-74970-7_39, ISBN 978-3-540-74969-1, modern SAT solvers can often handle problems with millions of constraints and hundreds of thousands of variables.
Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (PDF). Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. pp. 151–158. CiteSeerX 10.1.1.406.395. doi:10.1145/800157.805047. S2CID 7573663. Archived (PDF) from the original on 2022-10-09.
Selman, Bart; Mitchell, David; Levesque, Hector (1996). "Generating Hard Satisfiability Problems". Artificial Intelligence. 81 (1–2): 17–29. CiteSeerX 10.1.1.37.7362. doi:10.1016/0004-3702(95)00045-3.
Schaefer, Thomas J. (1978). "The complexity of satisfiability problems" (PDF). Proceedings of the 10th Annual ACM Symposium on Theory of Computing. San Diego, California. pp. 216–226. CiteSeerX 10.1.1.393.8951. doi:10.1145/800133.804350.

satcompetition.org (Global: low place; English: low place)

"The international SAT Competitions web page". Retrieved 2007-11-15.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Fortnow, L. (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186. S2CID 5969255.
Hong, Ted; Li, Yanjing; Park, Sung-Boem; Mui, Diana; Lin, David; Kaleq, Ziyad Abdel; Hakim, Nagib; Naeimi, Helia; Gardner, Donald S.; Mitra, Subhasish (November 2010). "QED: Quick Error Detection tests for effective post-silicon validation". 2010 IEEE International Test Conference. pp. 1–10. doi:10.1109/TEST.2010.5699215. ISBN 978-1-4244-7206-2. S2CID 7909084.
Massacci, Fabio; Marraro, Laura (2000-02-01). "Logical Cryptanalysis as a SAT Problem". Journal of Automated Reasoning. 24 (1): 165–203. doi:10.1023/A:1006326723002. S2CID 3114247.
Vizel, Y.; Weissenbacher, G.; Malik, S. (2015). "Boolean Satisfiability Solvers and Their Applications in Model Checking". Proceedings of the IEEE. 103 (11): 2021–2035. doi:10.1109/JPROC.2015.2455034. S2CID 10190144.
Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (PDF). Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. pp. 151–158. CiteSeerX 10.1.1.406.395. doi:10.1145/800157.805047. S2CID 7573663. Archived (PDF) from the original on 2022-10-09.
Levin, Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы Передачи Информа́ции, Problemy Peredachi Informatsii). 9 (3): 115–116. (pdf) (in Russian), translated into English by Trakhtenbrot, B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. 6 (4): 384–400. Bibcode:1984IAHC....6d.384T. doi:10.1109/MAHC.1984.10036. S2CID 950581.
Schöning, Uwe (Oct 1999). "A probabilistic algorithm for k-SAT and constraint satisfaction problems" (PDF). 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 410–414. doi:10.1109/SFFCS.1999.814612. ISBN 0-7695-0409-4. S2CID 123177576. Archived (PDF) from the original on 2022-10-09.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Mironov, Ilya; Zhang, Lintao (2006). "Applications of SAT Solvers to Cryptanalysis of Hash Functions". In Biere, Armin; Gomes, Carla P. (eds.). Theory and Applications of Satisfiability Testing - SAT 2006. Lecture Notes in Computer Science. Vol. 4121. Springer. pp. 102–115. doi:10.1007/11814948_13. ISBN 978-3-540-37207-3.

springer.com

Kozen, Dexter C. (2006). "Supplementary Lecture F: Unique Satisfiability". Theory of Computation. Texts in Computer Science. Springer. p. 180. ISBN 9781846282973.

toronto.edu (Global: low place; English: 8,821^st place)

cs.toronto.edu

Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (PDF). Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. pp. 151–158. CiteSeerX 10.1.1.406.395. doi:10.1145/800157.805047. S2CID 7573663. Archived (PDF) from the original on 2022-10-09.

uwaterloo.ca (Global: 3,153^rd place; English: 2,332^nd place)

complexityzoo.uwaterloo.ca

"Complexity Zoo:U - Complexity Zoo". complexityzoo.uwaterloo.ca. Archived from the original on 2019-07-09. Retrieved 2019-12-05.

web.archive.org (Global: 1^st place; English: 1^st place)

Karp, Richard M. (1972). "Reducibility Among Combinatorial Problems" (PDF). In Raymond E. Miller; James W. Thatcher (eds.). Complexity of Computer Computations. New York: Plenum. pp. 85–103. ISBN 0-306-30707-3. Archived from the original (PDF) on 2011-06-29. Retrieved 2020-05-07. Here: p.86
"Complexity Zoo:U - Complexity Zoo". complexityzoo.uwaterloo.ca. Archived from the original on 2019-07-09. Retrieved 2019-12-05.
Gi-Joon Nam; Sakallah, K. A.; Rutenbar, R. A. (2002). "A new FPGA detailed routing approach via search-based Boolean satisfiability" (PDF). IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 21 (6): 674. Bibcode:2002ITCAD..21..674N. doi:10.1109/TCAD.2002.1004311. Archived from the original (PDF) on 2016-03-15. Retrieved 2015-09-04.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Arkin, Esther M.; Banik, Aritra; Carmi, Paz; Citovsky, Gui; Katz, Matthew J.; Mitchell, Joseph S. B.; Simakov, Marina (2018-12-11). "Selecting and covering colored points". Discrete Applied Mathematics. 250: 75–86. doi:10.1016/j.dam.2018.05.011. ISSN 0166-218X.
Blass, Andreas; Gurevich, Yuri (1982-10-01). "On the unique satisfiability problem". Information and Control. 55 (1): 80–88. doi:10.1016/S0019-9958(82)90439-9. hdl:2027.42/23842. ISSN 0019-9958.

Boolean satisfiability problem (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

arxiv.org (Global: 69th place; English: 59th place)

berkeley.edu (Global: 580th place; English: 462nd place)

cs.berkeley.edu

books.google.com (Global: 3rd place; English: 3rd place)

cmu.edu (Global: 1,564th place; English: 1,028th place)

cs.cmu.edu

cwi.nl (Global: low place; English: low place)

homepages.cwi.nl

doi.org (Global: 2nd place; English: 2nd place)

fortnow.com (Global: low place; English: low place)

lance.fortnow.com

ghostarchive.org (Global: 32nd place; English: 21st place)

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

illinois.edu (Global: 1,349th place; English: 866th place)

cs-rutenbar.web.engr.illinois.edu

mathnet.ru (Global: 8,783rd place; English: low place)

neu.edu (Global: low place; English: 7,273rd place)

ccs.neu.edu

princeton.edu (Global: 741st place; English: 577th place)

cs.princeton.edu

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

satcompetition.org (Global: low place; English: low place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 274th place; English: 309th place)

link.springer.com

springer.com

toronto.edu (Global: low place; English: 8,821st place)

cs.toronto.edu

uwaterloo.ca (Global: 3,153rd place; English: 2,332nd place)

complexityzoo.uwaterloo.ca

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

acm.org (Global: 1,185^th place; English: 840^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

berkeley.edu (Global: 580^th place; English: 462^nd place)

books.google.com (Global: 3^rd place; English: 3^rd place)

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

ghostarchive.org (Global: 32^nd place; English: 21^st place)

handle.net (Global: 102^nd place; English: 76^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

illinois.edu (Global: 1,349^th place; English: 866^th place)

mathnet.ru (Global: 8,783^rd place; English: low place)

neu.edu (Global: low place; English: 7,273^rd place)

princeton.edu (Global: 741^st place; English: 577^th place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

springer.com (Global: 274^th place; English: 309^th place)

toronto.edu (Global: low place; English: 8,821^st place)

uwaterloo.ca (Global: 3,153^rd place; English: 2,332^nd place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)