Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Computer Program
Related Publications
(220)
A Generalized Su...
Introduction to Algorithms, Second Edition
Animating Formal Proof at the Surface: The Jape Proof Calculator
The Ubiquitous BTree
Optimal Computer Search Trees and VariableLength Alphabetical Codes
Subscribe
Academic
Publications
The Art of Computer Programming, Volume III: Sorting and Searching
The Art of Computer Programming, Volume III: Sorting and Searching,Donald E. Knuth
Edit
The Art of Computer Programming, Volume III: Sorting and Searching
(
Citations: 2428
)
BibTex

RIS

RefWorks
Download
Donald E. Knuth
Published in 1973.
Cumulative
Annual
Citation Context
(993)
...Friend (
1956
) and Knuth (
1998
)...
Ahmad Taherkhani
,
et al.
Categorizing variations of studentimplemented sorting algorithms
...A numeral system is a linguistic system and mathematical notation for representing numbers of a given set by symbols in a consistent manner [
13
]...
...The most commonly used numeral systems are positional numeral systems [
13
], where given a positive natural number , a string represents a number . For example, the binary and decimal numeral systems use powers of two and powers of ten, respectively, as bases...
Xuebin Wu
,
et al.
Efficient CODEC Designs for Crosstalk Avoidance Codes Based on Numeral...
...2) Memory Units: The memory units are designed as binary heap [
11
] data structures, which keep the stored elements in order according to the selected cost metric...
...The storing of a new element requires a time complexity of in the worst case [
11
], where is the size of the memory...
...The possible new partial candidate(s) (child and father) are first compared to the minimum candidate, and if the candidate on the top of the heap has the minimum PED, the first stored candidate is located at the top of the heap and sorted via the downheap operation [
11
]...
...new candidate is added to the next free memory address and the heap is sorted via the upheap operation [
11
]...
Markus Myllylä
,
et al.
Architecture Design and Implementation of the Metric First List Sphere...
... of S(F, F ) is dominated by (7), yielding a complexity of O(nc · nc · m). In a retrieval operation over a fingerprint database, the time needed to compute a single score S(F, F ) can be assumed constant since it is independent of the number of fingerprints N . The computational complexity is then dominated by the selection of the top NT scores, which can be performed in O(N + NT logNT ) using a specialized partial sorting algorithm ...
Raffaele Cappelli
.
Fast and Accurate Fingerprint Indexing Based on Ridge Orientation and ...
...It can even be computed using floatingpoint operations [
24
]...
...The genericity of the theorem with respect to formats can be seen on Figure 2: the Fprop plus error file does not depend on the specialized formats defined in Fcore FIX, FLX, and so on. 4) Error of the multiplication: It is also wellknown that the error of a floatingpoint multiplication is a floatingpoint number, whatever the rounding, but provided no underflow occur [
24
]...
Sylvie Boldo
,
et al.
Flocq: A Unified Library for Proving FloatingPoint Algorithms in Coq
Sort by:
Citations
(2428)
Categorizing variations of studentimplemented sorting algorithms
Ahmad Taherkhani
,
Ari Korhonen
,
Lauri Malmi
Journal:
Computer Science Education
, vol. 22, no. 2, pp. 109138, 2012
Bromine as an ash forming element in a fluidised bed boiler combusting solid recovered fuel
(
Citations: 2
)
Pasi Vainikka
,
Sonja Enestam
,
Jaani Silvennoinen
,
Raili Taipale
,
Patrik Yrjas
,
Ari Frantsi
,
Janne Hannula
,
Mikko Hupa
Journal:
Fuel
, vol. 90, no. 3, pp. 11011112, 2011
Efficient CODEC Designs for Crosstalk Avoidance Codes Based on Numeral Systems
(
Citations: 2
)
Xuebin Wu
,
Zhiyuan Yan
Journal:
IEEE Transactions on Very Large Scale Integration Systems  VLSI
, vol. 19, no. 4, pp. 548558, 2011
Architecture Design and Implementation of the Metric First List Sphere Detector Algorithm
(
Citations: 1
)
Markus Myllylä
,
Joseph R. Cavallaro
,
Markku J. Juntti
Journal:
IEEE Transactions on Very Large Scale Integration Systems  VLSI
, vol. 19, no. 5, pp. 895899, 2011
Deriving a Slicing Algorithm via FermaT Transformations
(
Citations: 2
)
Martin P. Ward
,
Hussein Zedan
Journal:
IEEE Transactions on Software Engineering  TSE
, vol. 37, no. 1, pp. 2447, 2011