Search results
Jump to navigation
Jump to search
Page title matches
- In mathematics or computer science, an '''algorithm''' is a sequence of steps for one particular method of solving a problem, s ...s, preferably data maintained in a consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on w2 KB (286 words) - 07:49, 10 February 2021
- 80 bytes (12 words) - 19:52, 20 May 2008
- ...or finding the [[greatest common divisor]] (gcd) of two [[integer]]s. The algorithm does not require [[prime number|prime factorizations]] and runs efficiently == The algorithm ==7 KB (962 words) - 12:05, 3 May 2016
- | title = The advent of the algorithm : the idea that rules the world1 KB (212 words) - 17:42, 20 February 2012
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 14:37, 8 August 2007
- ...orithm''' is the best known and most widely used [[public key]] encryption algorithm. Like any public key system, it can be used to create [[digital signature]] The algorithm was patented <ref>{{US patent|4405829}}</ref> in 1983 by [[MIT]], but relea7 KB (1,171 words) - 05:48, 8 April 2024
- 12 bytes (1 word) - 11:05, 24 September 2007
- <!-- Text is transcluded from the Algorithm (finance)/Definition subpage-->88 bytes (11 words) - 05:21, 12 July 2010
- The '''Naranjo algorithm''' is a questionnaire designed by Naranjo ''et al''<ref name="pmid7249508"> * [http://mqa.dhs.state.tx.us/QMWeb/MedSim/Naranjo.htm Naranjo algorithm]3 KB (432 words) - 17:35, 10 February 2024
- 12 bytes (1 word) - 12:13, 18 January 2008
- ...://mathworld.wolfram.com/Algorithm.html Mathworld]<span> - Definition of ''algorithm'' on Mathworld.1 KB (150 words) - 07:48, 10 February 2021
- Algorithm for finding the greatest common divisor of two integers101 bytes (13 words) - 15:31, 20 May 2008
- The '''Tiny Encryption Algorithm''', or '''TEA''' | title = TEA, a Tiny Encryption Algorithm3 KB (367 words) - 05:49, 8 April 2024
- 255 bytes (37 words) - 17:34, 10 February 2024
- {{r|Euclidean algorithm}}888 bytes (123 words) - 17:03, 13 July 2008
- 182 bytes (25 words) - 05:20, 12 July 2010
- A widely used [[public key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.152 bytes (19 words) - 18:53, 29 July 2010
- 12 bytes (1 word) - 11:47, 26 September 2007
- 39 bytes (4 words) - 06:05, 28 November 2008
- 39 bytes (4 words) - 07:25, 29 November 2008
- 259 bytes (33 words) - 18:53, 29 July 2010
- The '''International Data Encryption Algorithm''' or '''IDEA'''4 KB (558 words) - 05:49, 8 April 2024
- Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human. {{r|Algorithm}}618 bytes (80 words) - 16:24, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Naranjo algorithm]]. Needs checking by a human.500 bytes (64 words) - 18:51, 11 January 2010
- 190 bytes (27 words) - 00:46, 1 October 2009
- 176 bytes (23 words) - 14:27, 22 May 2011
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 18:44, 6 May 2007
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 15:00, 8 August 2007
Page text matches
- ...cipher, named because it applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.223 bytes (32 words) - 00:50, 1 October 2009
- ...res/lec20/lec20.htm Cornell University lecture on Dijkstra's Shortest Path Algorithm] ...c.jp/ikeda/suuri/dijkstra/Dijkstra.shtml Shortest Path Problem: Dijkstra's Algorithm]406 bytes (51 words) - 19:42, 12 October 2013
- ...text]], a form unintelligible to any recipient that does not know both the algorithm and a randomizing factor called a [[cryptographic key]]352 bytes (48 words) - 22:02, 31 July 2008
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:53, 29 July 2010
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 14:37, 8 August 2007
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 15:00, 8 August 2007
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:56, 29 July 2010
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:55, 29 July 2010
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:59, 29 July 2010
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 18:44, 6 May 2007
- #REDIRECT [[RSA algorithm/Definition]]38 bytes (4 words) - 18:53, 29 July 2010
- #REDIRECT [[RSA algorithm/Related Articles]]44 bytes (5 words) - 18:53, 29 July 2010
- {{r|International Data Encryption Algorithm}} {{r|RSA algorithm}}251 bytes (31 words) - 18:32, 13 March 2024
- A widely used sorting algorithm invented by Hoare.86 bytes (11 words) - 02:15, 14 November 2010
- <!-- Text is transcluded from the Algorithm (finance)/Definition subpage-->88 bytes (11 words) - 05:21, 12 July 2010
- The study of [[nervous system]]s with [[algorithm]]ic approaches.101 bytes (13 words) - 08:30, 14 September 2009
- Data structured in a way that they lend themselves to [[algorithm]]ic analysis.115 bytes (16 words) - 16:07, 31 March 2010
- Algorithm for finding the greatest common divisor of two integers101 bytes (13 words) - 15:31, 20 May 2008
- ...case of multiple encryption, ciphertext is still the result of applying an algorithm and key to ciphertext produced by a different cryptosystem.411 bytes (57 words) - 18:12, 28 July 2008
- Methods for attacking the Rivest, Shamir and Adleman public-key cryptography algorithm.124 bytes (14 words) - 06:55, 1 October 2009
- In mathematics or computer science, an '''algorithm''' is a sequence of steps for one particular method of solving a problem, s ...s, preferably data maintained in a consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on w2 KB (286 words) - 07:49, 10 February 2021
- A widely used [[public key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.152 bytes (19 words) - 18:53, 29 July 2010
- An algorithm that sequences elements of a list in a certain order.103 bytes (15 words) - 19:33, 4 September 2009
- Value used by a computer together with a complex algorithm to encrypt and decrypt messages.128 bytes (18 words) - 06:28, 4 September 2009
- The result of applying a [[encryption]] algorithm and an [[encryption key]] to [[plaintext]]]129 bytes (16 words) - 18:11, 28 July 2008
- ...est known for his PhD thesis design of the [[International Data Encryption Algorithm]] at [[ETH Zurich]] under advisor [[James Massey]].191 bytes (24 words) - 14:23, 22 May 2011
- Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human. {{r|Algorithm}}618 bytes (80 words) - 16:24, 11 January 2010
- ...ptography|Cryptographer]] who teaches at [[MIT]], co-inventor of the [[RSA algorithm]], the most widely used public key encryption technique.182 bytes (22 words) - 20:04, 29 July 2010
- In [[computer graphics]], an algorithm for constructing a 3D surface mesh from scalar 3D data, e.g. as obtained fr170 bytes (24 words) - 05:15, 5 February 2010
- An algorithm that produces a fixed-size digest from an input of essentially arbitrary si127 bytes (17 words) - 01:10, 27 November 2008
- *[[Evolutionary algorithm]] *[[Genetic algorithm]]1 KB (106 words) - 12:08, 15 November 2008
- {{r|Diamond-square algorithm}} {{r|Box-counting algorithm}}1 KB (184 words) - 06:32, 3 February 2010
- ...], [[image processing|processing]] or interpreting of images by means of [[algorithm]]s executed on a [[computer]].176 bytes (22 words) - 16:46, 7 September 2010
- '''Quicksort''' is a sorting [[algorithm]] developed by C. A. R. Hoare. ...ter moving the pivot value between the two separated groups, the quicksort algorithm is recursivly performed on the smaller groups.1 KB (181 words) - 09:18, 14 September 2013
- * [[International Data Encryption Algorithm]], a topic in [[cryptography]]212 bytes (26 words) - 12:51, 31 May 2009
- ...te]]; basic of [[Open Shortest Path First]]; sometimes called the Dijkstra algorithm217 bytes (28 words) - 10:40, 23 October 2009
- "Euclid's algorithm": 98% "Euclid's Algorithm": 2%739 bytes (70 words) - 17:12, 10 May 2007
- ...[[Clipper chip]]. It was to be used only in tamperproof hardware, and the algorithm was originally classified. This added to the controversy, with many people ...Feistel cipher]] with 64-bit blocks, an 80-bit key and 32 rounds. Once the algorithm was public, the first paper describing an attack on a reduced-round version1 KB (187 words) - 05:48, 8 April 2024
- Bioinformatics algorithm for comparing primary biological sequence information, such as the amino-ac208 bytes (25 words) - 02:09, 5 September 2009
- ...student [[Xuejia Lai]], co-designer of the [[International Data Encryption Algorithm]].197 bytes (24 words) - 14:30, 22 May 2011
- ..., [[El Gamal]] (encrypt-only, not for signatures), and [[Digital Signature Algorithm]]. Supported [[block cipher]]s are [[IDEA]], [[Triple DES]], [[CAST-128]],910 bytes (125 words) - 05:49, 8 April 2024
- The [[algorithm]]ic representation of one surface (e.g. that of the [[earth]]) on another (150 bytes (24 words) - 08:12, 1 March 2010
- ...nted by Joan Daemen and Vincent Rijmen, and a forerunner to the [[Rijndael algorithm]], which has been adopted as the [[Advanced Encryption Standard]].211 bytes (29 words) - 17:13, 22 January 2010
- ...in the field of [[geometry]]. Most problems involve efficient and robust [[algorithm]]s which can be executed on a computer.210 bytes (28 words) - 19:05, 12 February 2008
- Sequential procedure or algorithm for constructing a set of mutually orthogonal vectors from a given set of l173 bytes (23 words) - 12:20, 22 January 2009
- ...d and some preset algorithm can be performed on the base sized input. The algorithm then performs some function on the separate parts which have already been p789 bytes (131 words) - 10:30, 13 February 2009
- ...r algebra]], Gram-Schmidt orthogonalization is a sequential procedure or [[algorithm]] for constructing a set of mutually orthogonal [[vector space|vectors]] fr ==The Gram-Schmidt orthogonalization algorithm==2 KB (301 words) - 06:39, 21 October 2007
- ...eristics and generation of data which, in combination with a cryptographic algorithm, introduces or removes the concealment applied to [[plaintext]] or taken to346 bytes (45 words) - 11:07, 30 October 2008
- <!--A function which subsumes the functionality of a large number of algorithm-based functions in other systems.!-->255 bytes (39 words) - 07:52, 5 July 2011
- ...eterministic, is based upon how the tags respond during the anti-collision algorithm. ...dentification number. The simplest deterministic scheme is the binary tree algorithm.3 KB (407 words) - 21:13, 21 February 2009
- ...student [[Xuejia Lai]], co-designer of the [[International Data Encryption Algorithm]], IDEA.296 bytes (41 words) - 05:48, 8 April 2024
- ...ute]] in Israel. He is the "S" in "RSA", one of the inventors of the [[RSA algorithm]].265 bytes (43 words) - 08:38, 22 October 2010
- == An algorithm involving prime factorizations == == An algorithm not involving prime numbers ==4 KB (570 words) - 18:05, 1 July 2009
- ...king whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time.245 bytes (34 words) - 16:08, 27 July 2023
- ...urce authentication]]. The term '''HMAC''' is often used for both the HMAC algorithm and for the HMAC token that is appended to a message. HMACs use a [[cryptographic hash]] algorithm and a [[cryptographic key|symmetric key]] that is shared by the sender and2 KB (313 words) - 05:49, 8 April 2024
- {{r|Euclidean algorithm}}209 bytes (27 words) - 05:38, 3 July 2009
- {{r|Algorithm}}251 bytes (28 words) - 12:25, 20 February 2024
- ...the '''complexity of an algorithm''' is a way to classify how efficient an algorithm is, compared to alternative ones. The focus is on how [[execution time]] i ...arameters extend towards their extremes), the actual execution time of the algorithm is bounded by <math>K\times f(x_1,x_2,\ldots,x_n)</math> for some positive7 KB (1,080 words) - 07:53, 10 August 2008
- In mathematics, the ''sieve of Eratosthenes'' is an [[Algorithm|algorithm]] for finding all prime numbers up to a certain value, say ''N''. After fir1 KB (172 words) - 20:13, 7 December 2020
- ...sor named "Threefish", used in the [[Skein (hash algorithm) | Skein]] hash algorithm, a candidate in the [[Advanced Hash Standard]] contest. That is another new1 KB (176 words) - 05:48, 8 April 2024
- * [[Algorithm|Algorithms]]509 bytes (52 words) - 20:02, 19 April 2011
- {{r|Euclidean algorithm}}147 bytes (16 words) - 07:52, 29 June 2009
- {{r|Algorithm}}274 bytes (38 words) - 11:28, 7 August 2008
- {{r|Risch algorithm}}368 bytes (47 words) - 07:54, 13 July 2008
- '''MAGENTA''' or '''Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications'' | title = The MAGENTA Block Cipher Algorithm2 KB (235 words) - 05:49, 8 April 2024
- ...ened up may prove to have drastic consequences for the future: e.g. Shor's algorithm relevance to cryptography. ===Deutsch algorithm===8 KB (1,344 words) - 23:59, 8 February 2010
- ...+a_nx_n=b</math>, which may be solved by means of the extended [[Euclidean algorithm]].542 bytes (82 words) - 19:39, 7 April 2009
- ...er is accurate to only two significant figures! On the other hand, if the algorithm was somehow set up to subtract the 2,000,000 before adding 0.33333333, the1 KB (225 words) - 22:09, 3 September 2010
- {{r|Algorithm}}542 bytes (63 words) - 14:59, 1 November 2014
- * In [[computer science]], the repeated application of some algorithm, code, program, using the result of the previous application as input.449 bytes (65 words) - 00:41, 10 July 2013
- ...mber generator, in which the numbers are not truly random, but based on an algorithm which creates a diverse range of numbers.450 bytes (71 words) - 00:44, 3 August 2009
- ...computer program capable of translating a unambiguous description of an [[algorithm]] into a form which can be executed by a machine. To design a compiler req ...hm will always perform the task properly, and analyze how efficiently said algorithm performs its task against criteria such as time or memory complexity before4 KB (608 words) - 13:08, 17 April 2013
- {{r|Euclidean algorithm}}350 bytes (42 words) - 12:01, 12 June 2009
- ...yptographer]] best known for designing the [[International Data Encryption Algorithm]]. That work was his PhD Thesis634 bytes (89 words) - 05:48, 8 April 2024
- {{r|Algorithm}}353 bytes (42 words) - 12:12, 12 April 2011
- * [[Sergei Brin]] ( - ) - Co-developer of page-rank search algorithm and co-founder of [[Google]]. * [[Larry Page]] ( - ) - Co-developer of page-rank search algorithm and co-founder of [[Google]].2 KB (232 words) - 18:13, 8 November 2008
- * [[Algorithm|Algorithms]] - Ways of solving problems with computer programs.495 bytes (65 words) - 03:16, 9 June 2008
- {{r|International Data Encryption Algorithm}}315 bytes (47 words) - 14:26, 22 May 2011
- {{r|RSA algorithm}}398 bytes (43 words) - 20:00, 29 July 2010
- {{r|Algorithm}}433 bytes (55 words) - 20:29, 11 January 2010
- {{r|Genetic algorithm}}506 bytes (63 words) - 01:21, 13 March 2009
- {{r|Algorithm}}460 bytes (59 words) - 16:01, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Naranjo algorithm]]. Needs checking by a human.500 bytes (64 words) - 18:51, 11 January 2010
- Finally, a <i>[[calendar]]</i> is an algorithm for systematically assigning names to dates552 bytes (93 words) - 18:25, 25 September 2007
- {{r|Algorithm}}512 bytes (63 words) - 16:57, 11 January 2010
- * IDEA, the [[International Data Encryption Algorithm]], a European standard, not a Feistel cipher, with only 8 rounds and no S-b * The [[Tiny Encryption Algorithm]], or '''TEA''', designed to be very small and fast but still secure, a 32-4 KB (551 words) - 12:36, 13 April 2016
- {{r|Evolutionary algorithm}}655 bytes (73 words) - 13:21, 14 April 2021
- ...Ananth N, Implementation of Decision Tree Classifier Using Classification Algorithm for Some Inborn Errors of Metabolism, Proc. Global Convention and Expositio ...n Algorithm http://www.cs.mdx.ac.uk/staffpages/serengul/The.Classification.algorithm.htm (Accessed July 2006).2 KB (263 words) - 15:37, 26 April 2008
- {{r|Algorithm}}566 bytes (76 words) - 15:51, 11 January 2010
- '''Basic Local Alignment Search Tool''' (BLAST) is an [[algorithm]] in [[bioinformatics]] with the purpose of searching a preprocessed [[data759 bytes (108 words) - 16:00, 4 March 2009
- ...or finding the [[greatest common divisor]] (gcd) of two [[integer]]s. The algorithm does not require [[prime number|prime factorizations]] and runs efficiently == The algorithm ==7 KB (962 words) - 12:05, 3 May 2016
- ...tage is non-free distribution. It can be useful to understand, how does an algorithm works; then in order to make some software and distribute it, the algorithm should be re-written.2 KB (338 words) - 17:26, 7 February 2009
- {{r|RSA algorithm}}568 bytes (75 words) - 20:10, 29 July 2010
- ...r scientist]], known for his work in the design and analysis of computer [[algorithm]]s. He is the James S. McDonnell Distinguished University Professor of Comp ...nd 1972, respectively. His Ph.D. dissertation was ''An Efficient Planarity Algorithm'', and his advisor was eminent computer scientist [[Robert Floyd]].<ref>{{c5 KB (696 words) - 22:43, 11 February 2010
- {{r|Evolutionary algorithm}}732 bytes (98 words) - 16:57, 10 November 2010
- ...compiler must solve such a problem. Thus, a compiler uses a [[heuristic]] algorithm to produce a sub-optimal solution to the vertex coloring problem, attemptin ==The Algorithm==9 KB (1,338 words) - 10:00, 16 July 2013
- ...://mathworld.wolfram.com/Algorithm.html Mathworld]<span> - Definition of ''algorithm'' on Mathworld.1 KB (150 words) - 07:48, 10 February 2021
- {{r|Algorithm}}586 bytes (76 words) - 19:57, 11 January 2010
- ...r theory]], the Chinese remainder theorem forms the theoretical basis of [[algorithm]]s for [[storing integers]] and in [[cryptography]]. The Chinese remainder ...es not help us to find it. We can do this by appealing to the [[Euclidean algorithm]]. If <math>n_1</math> and <math>n_2</math> are coprime, then there exist3 KB (535 words) - 15:02, 22 November 2008
- {{r|RSA algorithm}}707 bytes (89 words) - 20:09, 29 July 2010