DocumentCode :
962472
Title :
Lower Bounds for Sorting with Realistic Instruction Sets
Author :
Dittert, Eric ; O´Donnell, Michael J.
Author_Institution :
Department of Computer Science, New Mexico State University, Las Cruces, NM 88003.
Issue :
4
fYear :
1985
fDate :
4/1/1985 12:00:00 AM
Firstpage :
311
Lastpage :
317
Abstract :
¿(n log n) time is required to sort n integers using comparison, addition, subtraction, multiplication, division, indirect addressing, and mildly restricted truncation.
Keywords :
Decision trees; Geometry; Instruction sets; Interpolation; Read-write memory; Sorting; Decision tree; RAM; division; interpolation; lower bounds; random access machine; rational functions; sorting;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1985.5009381
Filename :
5009381
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=962472
بازگشت