Ilmu komputer teoretis (Indonesian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ilmu komputer teoretis" in Indonesian language version.

refsWebsite

Global rank Indonesian rank

10doi.org

2^nd place

4^th place

4springer.com

274^th place

596^th place

3quantamagazine.org

6,413^th place

low place

3worldcat.org

5^th place

7^th place

3stanford.edu

179^th place

224^th place

3acm.org

1,185^th place

2,434^th place

2britannica.com

40^th place

36^th place

2wolfram.com

513^th place

419^th place

2brown.edu

2,481^st place

4,355^th place

1sigact.org

low place

1frontiersin.org

4,679^th place

4,584^th place

1mit.edu

415^th place

544^th place

1mathnet.ru

8,783^rd place

low place

1ieee.org

652^nd place

1,575^th place

1archive.org

6^th place

2^nd place

1caltech.edu

887^th place

731^st place

1digitaltonto.com

low place

1arxiv.org

69^th place

207^th place

1buffalo.edu

4,241^st place

2,016^th place

1web.archive.org

1^st place

1nih.gov

4^th place

13^th place

1ox.ac.uk

613^th place

703^rd place

1ems.press

low place

1cornell.edu

332^nd place

218^th place

1computersciencedegreehub.com

low place

1machinelearningmastery.com

low place

acm.org

portal.acm.org

Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (dalam bahasa Inggris). ACM Press: 151–158. doi:10.1145/800157.805047.
Angluin, Dana (1992). "Computational learning theory: survey and selected bibliography" (dalam bahasa Inggris). ACM Press: 351–369. doi:10.1145/129712.129746. ISBN 978-0-89791-511-3.

dl.acm.org

Wagstaff, Jr., Samuel S. (2010). "Computational Number Theory". Dalam Atallah, Mikhail J.; Blanton, Marina. Algorithms and theory of computation handbook. 1: General concepts and techniques (edisi ke-2. ed). Chapman & Hall. ISBN 978-1-58488-822-2. Pemeliharaan CS1: Teks tambahan (link)

archive.org

Rieffel, Eleanor; Polak, Wolfgang (2014). Quantum computing: a gentle introduction. Scientific and engineering computation (edisi ke-First MIT Press paperback edition). Cambridge, Massachusetts London, England: The Mit Press. ISBN 978-0-262-52667-8. Pemeliharaan CS1: Teks tambahan (link)

arxiv.org

Shor, Peter W. (1997-10). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. doi:10.1137/S0097539795293172. ISSN 0097-5397.

britannica.com

Rankin, Bayard; Nelson, R.J. "Automata theory | Finite State Machines, Turing Machines & Algorithms | Britannica". Encyclopaedia Britannica (dalam bahasa Inggris). Diakses tanggal 2023-12-20.
Searls, David B. "Computational biology | Algorithms, Data Analysis & Modeling | Britannica". www.britannica.com (dalam bahasa Inggris). Diakses tanggal 2023-12-19.

brown.edu

"About the CCMB". Center for Computational Molecular Biology. Diakses tanggal 18 August 2012.

cs.brown.edu

Savage, John E. (2003). "Circuit Commplexity" (PDF). Models of computation: exploring the power of computing (edisi ke-cetak ulang). Reading, Mass.: Addison-Wesley. ISBN 978-0-201-89539-1.

buffalo.edu

cse.buffalo.edu

Guruswami, Venkatesan; Rudra, Atri; Sudan, Madhu (2023). Essential Coding Theory. New York: Department of Computer Science and Engineering, University at Buffalo, SUNY.

caltech.edu

feynmanlectures.caltech.edu

Feynman, Richard (2013). "Quantum Behavior". Dalam Gottlieb, Michael A.; Pfeiffer, Rudolf. The Feynman Lectures. California: California Institute of Technology.

computersciencedegreehub.com

"What is Computational Geometry?". Computer Science Degree Hub (dalam bahasa Inggris). Diakses tanggal 2023-12-20.

cornell.edu

ecommons.cornell.edu

Wylie, James C. (1979). The Complexity of Parallel Computations. Cornell University.

digitaltonto.com

"The Very Strange—And Fascinating— Ideas Behind Quantum Computing | Digital Tonto". Digital Tonto | (dalam bahasa Inggris). 2016-07-31. Diakses tanggal 2023-12-19.

doi.org

O'Regan, Gerard (2016). Introduction to the History of Computing. Undergraduate Topics in Computer Science. Cham: Springer International Publishing. doi:10.1007/978-3-319-33138-6. ISBN 978-3-319-33137-9.
Langille, Jesse J.; Brown, Richard E. (2018-10-26). "The Synaptic Theory of Memory: A Historical Survey and Reconciliation of Recent Opposition". Frontiers in Systems Neuroscience. 12. doi:10.3389/fnsys.2018.00052. ISSN 1662-5137.
Karaminis, Themis N.; Thomas, Michael S. C. (2012). Seel, Norbert M., ed. Connectionist Theories of Learning (dalam bahasa Inggris). Boston, MA: Springer US. hlm. 771–774. doi:10.1007/978-1-4419-1428-6_398. ISBN 978-1-4419-1427-9.
Cook, Stephen A. (1971). "The complexity of theorem-proving procedures" (dalam bahasa Inggris). ACM Press: 151–158. doi:10.1145/800157.805047.
Trakhtenbrot, B.A. (1984-10). "A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms". IEEE Annals of the History of Computing. 6 (4): 384–400. doi:10.1109/MAHC.1984.10036. ISSN 1058-6180.
Shor, Peter W. (1997-10). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. doi:10.1137/S0097539795293172. ISSN 0097-5397.
van Lint, J. H. (1999). Introduction to Coding Theory. Graduate Texts in Mathematics. 86. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-58575-3. ISBN 978-3-642-63653-0.
Braverman, Mark (2023-12-15). Communication and information complexity. hlm. 284–320. doi:10.4171/icm2022/208.
Fürer, Martin (2008). Floudas, Christodoulos A.; Pardalos, Panos M., ed. Parallel Computing: Complexity Classes (dalam bahasa Inggris). Boston, MA: Springer US. hlm. 2900–2903. doi:10.1007/978-0-387-74759-0_498. ISBN 978-0-387-74758-3.
Angluin, Dana (1992). "Computational learning theory: survey and selected bibliography" (dalam bahasa Inggris). ACM Press: 351–369. doi:10.1145/129712.129746. ISBN 978-0-89791-511-3.

ems.press

Braverman, Mark (2023-12-15). Communication and information complexity. hlm. 284–320. doi:10.4171/icm2022/208.

frontiersin.org

Langille, Jesse J.; Brown, Richard E. (2018-10-26). "The Synaptic Theory of Memory: A Historical Survey and Reconciliation of Recent Opposition". Frontiers in Systems Neuroscience. 12. doi:10.3389/fnsys.2018.00052. ISSN 1662-5137.

ieee.org

ieeexplore.ieee.org

Trakhtenbrot, B.A. (1984-10). "A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms". IEEE Annals of the History of Computing. 6 (4): 384–400. doi:10.1109/MAHC.1984.10036. ISSN 1058-6180.

machinelearningmastery.com

Brownlee, Jason (2020-09-07). "A Gentle Introduction to Computational Learning Theory". Machine Learning Mastery. Diakses tanggal 2023-12-21.

mathnet.ru

Levin, Leonid A. (1973). "Universal Sequential Search Problems". Probl. Peredachi Inf. (dalam bahasa Rusia). 9 (3): 265–266.

mit.edu

dspace.mit.edu

Lee, Chuang-Chung (2008). "Kinetic modeling of amyloid fibrillation and synaptic plasticity as memory loss and formation mechanisms" (Academic dissertation). Massachusetts Institute of Technology.

nih.gov

bisti.nih.gov

"NIH working definition of bioinformatics and computational biology" (PDF). Biomedical Information Science and Technology Initiative. 17 July 2000. Diarsipkan dari versi asli (PDF) tanggal 5 September 2012. Diakses tanggal 18 August 2012.

ox.ac.uk

seh.ox.ac.uk

Goldberg, Lesile Ann (2019). "Computational Complexity Theory: An introduction". Research - St. Edmund Hall - University of Oxford (dalam bahasa Inggris). Diakses tanggal 2023-12-20.

quantamagazine.org

Wolchover, Natalie, ed. (2020-07-20). "How Gödel's Proof Works". Quanta Magaznie. Diakses tanggal 2023-12-19.
Tse, David, ed. (2020-12-22). "How Claude Shannon Invented the Future". Quanta Magazine. Diakses tanggal 2023-12-19.
Brubaker, Ben (2023-10-17). "Thirty Years Later, a Speed Boost for Quantum Factoring". Quanta Magazine. Diakses tanggal 2023-12-19.

sigact.org

"SIGACT". Diakses tanggal 2017-01-19.

springer.com

link.springer.com

O'Regan, Gerard (2016). Introduction to the History of Computing. Undergraduate Topics in Computer Science. Cham: Springer International Publishing. doi:10.1007/978-3-319-33138-6. ISBN 978-3-319-33137-9.
Karaminis, Themis N.; Thomas, Michael S. C. (2012). Seel, Norbert M., ed. Connectionist Theories of Learning (dalam bahasa Inggris). Boston, MA: Springer US. hlm. 771–774. doi:10.1007/978-1-4419-1428-6_398. ISBN 978-1-4419-1427-9.
van Lint, J. H. (1999). Introduction to Coding Theory. Graduate Texts in Mathematics. 86. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-58575-3. ISBN 978-3-642-63653-0.
Fürer, Martin (2008). Floudas, Christodoulos A.; Pardalos, Panos M., ed. Parallel Computing: Complexity Classes (dalam bahasa Inggris). Boston, MA: Springer US. hlm. 2900–2903. doi:10.1007/978-0-387-74759-0_498. ISBN 978-0-387-74758-3.

stanford.edu

plato.stanford.edu

Raatikainen, Panu (2022). "Gödel's Incompleteness Theorems". Dalam Zalta, Edward N. Stanford Encyclopedia of Philosophy (edisi ke-Spring 2022). Metaphysics Research Lab, Stanford University.
Dean, Walter (2021). Zalta, Edward N., ed. Computational Complexity Theory (edisi ke-Fall 2021). Metaphysics Research Lab, Stanford University.

cs.stanford.edu

Aziz, Amar Dar; Cackler, Joe; Yung, Raylene. "Basics of Automata Theory". Automata Theory (dalam bahasa Inggris). Stanford Computer Science Department. Diakses tanggal 2023-12-19.

web.archive.org

"NIH working definition of bioinformatics and computational biology" (PDF). Biomedical Information Science and Technology Initiative. 17 July 2000. Diarsipkan dari versi asli (PDF) tanggal 5 September 2012. Diakses tanggal 18 August 2012.

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W. "Coding Theory". mathworld.wolfram.com (dalam bahasa Inggris). Diakses tanggal 2023-12-19.
Weisstein, Eric W. "Computational Number Theory". mathworld.wolfram.com (dalam bahasa Inggris). Diakses tanggal 2023-12-21.

worldcat.org

Langille, Jesse J.; Brown, Richard E. (2018-10-26). "The Synaptic Theory of Memory: A Historical Survey and Reconciliation of Recent Opposition". Frontiers in Systems Neuroscience. 12. doi:10.3389/fnsys.2018.00052. ISSN 1662-5137.
Trakhtenbrot, B.A. (1984-10). "A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms". IEEE Annals of the History of Computing. 6 (4): 384–400. doi:10.1109/MAHC.1984.10036. ISSN 1058-6180.
Shor, Peter W. (1997-10). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Computing. 26 (5): 1484–1509. doi:10.1137/S0097539795293172. ISSN 0097-5397.