Sistem unar (Romanian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Sistem unar" in Romanian language version.
refsWebsite
Global rank
Romanian rank
3rd place
6th place
6th place
23rd place
311th place
1,792nd place
741st place
687th place
ams.org
- en Sazonov, Vladimir Yu. (), „On feasible numbers”, Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Comput. Sci., 960, Springer, Berlin, pp. 30–51, doi:10.1007/3-540-60178-3_78, ISBN 978-3-540-60178-4, MR 1449655. V. în special p. 48
- en Garey, M. R.; Johnson, D. S. (), „'Strong' NP-completeness results: Motivation, examples, and implications”, Journal of the ACM, 25 (3): 499–508, doi:10.1145/322077.322090, MR 0478747
- en Magaud, Nicolas; Bertot, Yves (), „Changing data structures in type theory: a study of natural numbers”, Types for proofs and programs (Durham, 2000), Lecture Notes in Comput. Sci., 2277, Springer, Berlin, pp. 181–196, doi:10.1007/3-540-45842-5_12, ISBN 978-3-540-43287-6, MR 2044538
archive.org
- en Sazonov, Vladimir Yu. (), „On feasible numbers”, Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Comput. Sci., 960, Springer, Berlin, pp. 30–51, doi:10.1007/3-540-60178-3_78, ISBN 978-3-540-60178-4, MR 1449655. V. în special p. 48
- en Hopcroft, John E.; Ullman, Jeffrey D. (), Introduction to Automata Theory, Languages, and Computation
, Addison Wesley, Example 7.7, pp. 158–159, ISBN 978-0-201-02988-8
books.google.com
- en Hodges, Andrew (), One to Nine: The Inner Life of Numbers, Anchor Canada, p. 14, ISBN 9780385672665
- en Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (), Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Computer Science and Scientific Computing (ed. 2nd), Academic Press, p. 117, ISBN 9780122063824
- en Woodruff, Charles E. (), „The Evolution of Modern Numerals from Ancient Tally Marks”, American Mathematical Monthly, 16 (8–9): 125–33, doi:10.2307/2970818, JSTOR 2970818
- en Blaxell, David (), „Record linkage by bit pattern matching”, În Hogben, David; Fife, Dennis W., Computer Science and Statistics--Tenth Annual Symposium on the Interface, NBS Special Publication, 503, U.S. Department of Commerce / National Bureau of Standards, pp. 146–156
- en Dewdney, A. K. (), The New Turing Omnibus: Sixty-Six Excursions in Computer Science, Computer Science Press, p. 209, ISBN 9780805071665
- en Rendell, Paul (), „5.3 Larger Example TM: Unary Multiplication”, Turing Machine Universality of the Game of Life, Emergence, Complexity and Computation, 18, Springer, pp. 83–86, ISBN 9783319198422
- en Moore, Cristopher; Mertens, Stephan (), The Nature of Computation, Oxford University Press, p. 29, ISBN 9780199233212
doi.org
- en Woodruff, Charles E. (), „The Evolution of Modern Numerals from Ancient Tally Marks”, American Mathematical Monthly, 16 (8–9): 125–33, doi:10.2307/2970818, JSTOR 2970818
- en Hsieh, Hui-Kuang (), „Chinese Tally Mark”, The American Statistician, 35 (3): 174, doi:10.2307/2683999
- en Sazonov, Vladimir Yu. (), „On feasible numbers”, Logic and computational complexity (Indianapolis, IN, 1994), Lecture Notes in Comput. Sci., 960, Springer, Berlin, pp. 30–51, doi:10.1007/3-540-60178-3_78, ISBN 978-3-540-60178-4, MR 1449655. V. în special p. 48
- en Garey, M. R.; Johnson, D. S. (), „'Strong' NP-completeness results: Motivation, examples, and implications”, Journal of the ACM, 25 (3): 499–508, doi:10.1145/322077.322090, MR 0478747
- en Golomb, Solomon W. (), „Run-length encodings”, IEEE Transactions on Information Theory, IT-12 (3): 399–401, doi:10.1109/TIT.1966.1053907
- en Magaud, Nicolas; Bertot, Yves (), „Changing data structures in type theory: a study of natural numbers”, Types for proofs and programs (Durham, 2000), Lecture Notes in Comput. Sci., 2277, Springer, Berlin, pp. 181–196, doi:10.1007/3-540-45842-5_12, ISBN 978-3-540-43287-6, MR 2044538
- en Jansen, Jan Martin (), „Programming in the λ-calculus: from Church to Scott and back”, The Beauty of Functional Code: Essays Dedicated to Rinus Plasmeijer on the Occasion of His 61st Birthday, Lecture Notes in Computer Science, 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
- en Golomb, Solomon W. (), „Run-length encodings”, IEEE Transactions on Information Theory, IT-12 (3): 399–401, doi:10.1109/TIT.1966.1053907
jstor.org
- en Woodruff, Charles E. (), „The Evolution of Modern Numerals from Ancient Tally Marks”, American Mathematical Monthly, 16 (8–9): 125–33, doi:10.2307/2970818, JSTOR 2970818
princeton.edu
cs.princeton.edu
- en Arora, Sanjeev; Barak, Boaz (), „The computational model —and why it doesn't matter” (PDF), Computational Complexity: A Modern Approach (ed. January 2007 draft), Cambridge University Press, §17, pp. 32–33, accesat în
unicode.org
- en Lunde, Ken; Miura, Daisuke (), „Proposal to Encode Five Ideographic Tally Marks”, Unicode Consortium (PDF), Proposal L2/16-046
yale.edu
zoo.cs.yale.edu
- en Feigenbaum, Joan (), CPSC 468/568 HW1 Solution Set (PDF), Computer Science Department, Yale University, accesat în