• Whirlpool

• Referenced in 46 articles [sw13339]
• less than 2256 bits in length, and produces a message digest of 512 bits. Historically...

• Poly1305-AES

• Referenced in 21 articles [sw26748]
• state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305 ... byte authenticator of a variable-length message, using a 16-byte...

• CRYPTIM

• Referenced in 28 articles [sw02442]
• graph as messages and walks of a certain length as encryption tools. We study ... comparing the probability to guess the message (vertex) at random with the probability to break...

• MPI-CHECK

• Referenced in 6 articles [sw00599]
• source/destination array; (iii) negative message lengths; (iv) illegal MPI calls before MPI_INITIALIZE or after ... inconsistencies between the declared type of a message and its associated DATATYPE argument...

• COMMS1

• Referenced in 2 articles [sw07691]
• message-passing computer. A message of variable length, n, is sent from a master processor ... slave processor. The slave receives the message into a Fortran data array, and immediately returns ... time, t, to send a message of length, n. In the COMMS2 benchmark there ... time as a function of message length is fitted by least squares using the parameters...

• Algorithm 673

• Referenced in 9 articles [sw13893]
• each letter of the message is proportional to the length of its codeword. The number...

• Saturnin

• Referenced in 4 articles [sw41873]
• authenticated cipher intended for messages with a length strictly smaller than 128 bits which uses...

• CRYPTALL

• Referenced in 6 articles [sw06981]
• graph as messages and arcs of a certain length as encryption tools. The encryption algorithm...

• SIMSON

• Referenced in 43 articles [sw13385]
• direct numerical simulation (DNS) in which all length and time scales are resolved ... with shared memory parallelization through the Message Passing Interface (MPI) or OpenMP, respectively. The wall...

• BLACS

• Referenced in 16 articles [sw08578]
• create a linear algebra oriented message passing interface that may be implemented efficiently and uniformly ... large range of distributed memory platforms. The length of time required to implement efficient distributed...

• CAR30

• Referenced in 3 articles [sw08370]
• Cellular Automata (CA) along with a Maximum Length Linear Hybrid CA. This design ... messages. The generic design of the cipher enables to scale up for any length...

• OTRU

• Referenced in 3 articles [sw32108]
• discuss the issues regarding key security, message security, and probability of successful decryption. OTRU ... high levels of parallelism with full operand length. By reducing the dimension of the underlying...

• EpiChord

• Referenced in 2 articles [sw11774]
• reduce both lookup latencies and path lengths by a factor of 3 by issuing only ... additional communication overhead and the number of messages generated per lookup is no more than...

• FINDSTEM

• Referenced in 1 article [sw02772]
• queries in natural language with average length of 17 search words, and a complete relevancy ... algorithm (FINDSTEM), and a Turkish translation at message level. Our results based on average precision...

• gmp

• Referenced in 282 articles [sw00363]
• GMP is a free library for arbitrary precision...

• LAPACK

• Referenced in 1702 articles [sw00503]
• LAPACK is written in Fortran 90 and provides...

• Maple

• Referenced in 5373 articles [sw00545]
• The result of over 30 years of cutting...

• MapReduce

• Referenced in 263 articles [sw00546]
• MapReduce is a new parallel programming model initially...

• Matlab

• Referenced in 13544 articles [sw00558]
• MATLAB® is a high-level language and interactive...

• mclust

• Referenced in 309 articles [sw00563]
• R package mclust: Normal Mixture Modeling for Model...