Unary numeral system (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Unary numeral system" in English language version.

refsWebsite

Global rank English rank

9doi.org

2^nd place

7books.google.com

3^rd place

4ams.org

451^st place

277^th place

2jstor.org

26^th place

20^th place

2archive.org

6^th place

1web.archive.org

1^st place

1americanscientist.org

7,231^st place

5,635^th place

1unicode.org

311^th place

239^th place

1princeton.edu

741^st place

577^th place

1semanticscholar.org

11^th place

8^th place

1earth.li

low place

1uillinois.edu

low place

americanscientist.org

Brian Hayes (2001), "Third Base", American Scientist, 89 (6): 490, doi:10.1511/2001.40.3268, archived from the original on 2014-01-11, retrieved 2013-07-28

ams.org

mathscinet.ams.org

Zdanowski, Konrad (2022), "On efficiency of notations for natural numbers", Theoretical Computer Science, 915: 1–10, doi:10.1016/j.tcs.2022.02.015, MR 4410388
Sazonov, Vladimir Yu. (1995), "On feasible numbers", Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Comput. Sci., vol. 960, Springer, Berlin, pp. 30–51, doi:10.1007/3-540-60178-3_78, ISBN 978-3-540-60178-4, MR 1449655. See in particular p. 48.
Garey, M. R.; Johnson, D. S. (1978), "'Strong' NP-completeness results: Motivation, examples, and implications", Journal of the ACM, 25 (3): 499–508, doi:10.1145/322077.322090, MR 0478747, S2CID 18371269.
Magaud, Nicolas; Bertot, Yves (2002), "Changing data structures in type theory: a study of natural numbers", Types for proofs and programs (Durham, 2000), Lecture Notes in Comput. Sci., vol. 2277, Springer, Berlin, pp. 181–196, doi:10.1007/3-540-45842-5_12, ISBN 978-3-540-43287-6, MR 2044538.

archive.org

Sazonov, Vladimir Yu. (1995), "On feasible numbers", Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Comput. Sci., vol. 960, Springer, Berlin, pp. 30–51, doi:10.1007/3-540-60178-3_78, ISBN 978-3-540-60178-4, MR 1449655. See in particular p. 48.
Hopcroft, John E.; Ullman, Jeffrey D. (1979), Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Example 7.7, pp. 158–159, ISBN 978-0-201-02988-8.

books.google.com

Hodges, Andrew (2009), One to Nine: The Inner Life of Numbers, Anchor Canada, p. 14, ISBN 9780385672665.
Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (1994), Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Computer Science and Scientific Computing (2nd ed.), Academic Press, p. 117, ISBN 9780122063824.
Woodruff, Charles E. (1909), "The Evolution of Modern Numerals from Ancient Tally Marks", American Mathematical Monthly, 16 (8–9): 125–33, doi:10.2307/2970818, JSTOR 2970818.
Blaxell, David (1978), "Record linkage by bit pattern matching", in Hogben, David; Fife, Dennis W. (eds.), Computer Science and Statistics--Tenth Annual Symposium on the Interface, NBS Special Publication, vol. 503, U.S. Department of Commerce / National Bureau of Standards, pp. 146–156.
Dewdney, A. K. (1989), The New Turing Omnibus: Sixty-Six Excursions in Computer Science, Computer Science Press, p. 209, ISBN 9780805071665.
Rendell, Paul (2015), "5.3 Larger Example TM: Unary Multiplication", Turing Machine Universality of the Game of Life, Emergence, Complexity and Computation, vol. 18, Springer, pp. 83–86, ISBN 9783319198422.
Moore, Cristopher; Mertens, Stephan (2011), The Nature of Computation, Oxford University Press, p. 29, ISBN 9780199233212.

doi.org

Brian Hayes (2001), "Third Base", American Scientist, 89 (6): 490, doi:10.1511/2001.40.3268, archived from the original on 2014-01-11, retrieved 2013-07-28
Zdanowski, Konrad (2022), "On efficiency of notations for natural numbers", Theoretical Computer Science, 915: 1–10, doi:10.1016/j.tcs.2022.02.015, MR 4410388
Woodruff, Charles E. (1909), "The Evolution of Modern Numerals from Ancient Tally Marks", American Mathematical Monthly, 16 (8–9): 125–33, doi:10.2307/2970818, JSTOR 2970818.
Hsieh, Hui-Kuang (1981), "Chinese Tally Mark", The American Statistician, 35 (3): 174, doi:10.2307/2683999, JSTOR 2683999
Sazonov, Vladimir Yu. (1995), "On feasible numbers", Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Comput. Sci., vol. 960, Springer, Berlin, pp. 30–51, doi:10.1007/3-540-60178-3_78, ISBN 978-3-540-60178-4, MR 1449655. See in particular p. 48.
Garey, M. R.; Johnson, D. S. (1978), "'Strong' NP-completeness results: Motivation, examples, and implications", Journal of the ACM, 25 (3): 499–508, doi:10.1145/322077.322090, MR 0478747, S2CID 18371269.
Golomb, S.W. (1966), "Run-length encodings", IEEE Transactions on Information Theory, IT-12 (3): 399–401, doi:10.1109/TIT.1966.1053907.
Magaud, Nicolas; Bertot, Yves (2002), "Changing data structures in type theory: a study of natural numbers", Types for proofs and programs (Durham, 2000), Lecture Notes in Comput. Sci., vol. 2277, Springer, Berlin, pp. 181–196, doi:10.1007/3-540-45842-5_12, ISBN 978-3-540-43287-6, MR 2044538.
Jansen, Jan Martin (2013), "Programming in the λ-calculus: from Church to Scott and back", The Beauty of Functional Code, Lecture Notes in Computer Science, vol. 8106, Springer-Verlag, pp. 168–180, doi:10.1007/978-3-642-40355-2_12, ISBN 978-3-642-40354-5.

earth.li

urchin.earth.li

Golomb, S.W. (1966), "Run-length encodings", IEEE Transactions on Information Theory, IT-12 (3): 399–401, doi:10.1109/TIT.1966.1053907.

jstor.org

Woodruff, Charles E. (1909), "The Evolution of Modern Numerals from Ancient Tally Marks", American Mathematical Monthly, 16 (8–9): 125–33, doi:10.2307/2970818, JSTOR 2970818.
Hsieh, Hui-Kuang (1981), "Chinese Tally Mark", The American Statistician, 35 (3): 174, doi:10.2307/2683999, JSTOR 2683999

princeton.edu

cs.princeton.edu

Arora, Sanjeev; Barak, Boaz (2007), "The computational model —and why it doesn't matter" (PDF), Computational Complexity: A Modern Approach (January 2007 draft ed.), Cambridge University Press, §17, pp. 32–33, retrieved May 10, 2017.

semanticscholar.org

api.semanticscholar.org

Garey, M. R.; Johnson, D. S. (1978), "'Strong' NP-completeness results: Motivation, examples, and implications", Journal of the ACM, 25 (3): 499–508, doi:10.1145/322077.322090, MR 0478747, S2CID 18371269.

uillinois.edu

answers.uillinois.edu

Email, Spam Control, How to get service for departmental email servers

unicode.org

Lunde, Ken; Miura, Daisuke (January 27, 2016), "Proposal to Encode Five Ideographic Tally Marks", Unicode Consortium (PDF), Proposal L2/16-046

web.archive.org

Brian Hayes (2001), "Third Base", American Scientist, 89 (6): 490, doi:10.1511/2001.40.3268, archived from the original on 2014-01-11, retrieved 2013-07-28