Hakan Temiz
- ANSI and IEEE, ANSI/IEEE Std 1084-1986, IEEE Standard Glossary of Mathematics of Computing Terminology. 1986; https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=26589Google Scholar
- Binary prefix---Stage One Wiki; https://wiki.cs.auckland.ac.nz/stageonewiki/index.php/Binary_prefix.Google Scholar
- Givens, W. Letters to the editor: Proposed abbreviation for 1024: Bk. Commun. ACM 11, 6 (Nov. 1968), 391 Google ScholarDigital Library
- IEEE. IEEE Standard for Prefixes for Binary Multiples. 2009; https://standards.ieee.org/standard/1541-2002.htmlGoogle Scholar
- IEEE. IEEE 1212-1991 - IEEE Standard Control and Status Register (CSR) Architecture for Microcomputer Buses. 1991; https://standards.ieee.org/standard/1212-1991.htmlGoogle Scholar
- IEEE Std 610.10-1994. IEEE Standard Glossary of Computer Hardware Terminology. 1994; https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=477873Google Scholar
- ISO. IEC 80000-13:2008 Quantities and units---Part 13: Information science and technology. 2008; https://www.iso.org/standard/31898.htmlGoogle Scholar
- IUCR. IUCr 1995 Report---IUPAC Interdivisional Committee on Nomenclature and Symbols (IDCNS), Guildford. 1995; http://ww1.iucr.org/iucr-top/cexec/rep95/idcns.htmGoogle Scholar
- Knuth, D.E. et al. The Art of Computer Programming, Sorting Search 3 (1999), 426--458.Google Scholar
- Kuhn, M. Standardized units for use in information technology. 1996; https://www.cl.cam.ac.uk/~mgk25/information-units.txtGoogle Scholar
- Martin, B.A. Letters to the editor: On binary notation. Commun. ACM 11, 10 (Oct. 1968), 658 Google ScholarDigital Library
- Morrison, D.R. Letters to the editor: Abbreviations for computer and memory sizes. Commun. ACM 11, 3 (Mar. 1968), 150 Google ScholarDigital Library
- Safier v. Western Digital Corporation, casetext.com. 2006; https://casetext.com/case/safier-v-western-digital-corporationGoogle Scholar
Index Terms
- SI and Binary Prefixes: Clearing the Confusion
Recommendations
Palindromic prefixes and episturmian words
Let w be an infinite word on an alphabet A. We denote by (ni)i ≥ 1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1 ≤ 2ni + 1 for ...
Open and Closed Prefixes of Sturmian Words
Proceedings of the 9th International Conference on Combinatorics on Words - Volume 8079A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this ...
Square-free words obtained from prefixes by permutations
An infinite square-free word w over a three letter alphabet T is said to have a k-stem @s if w=@sw"1w"2... where for each i, there exists a permutation @p"i of T which extended to a morphism gives w"i=@p"i(@s). We show that there exists an infinite k-...
Comments