Improved Fast Integer Sorting in Linear Space
نویسندگان
چکیده
منابع مشابه
Fast Parallel Space Allocation, Estimation and Integer Sorting
Fast Parallel Space Allocation, Estimation and Integer Sorting (revised) •
متن کاملImproved in-place associative integer sorting
A novel integer sorting technique was proposed replacing bucket sort, distribution counting sort and address calculation sort family of algorithms which requires only constant amount of additional memory. The technique was inspired from one of the ordinal theories of “serial order in behavior” and explained by the analogy with the three main stages in the formation and retrieval of memory in co...
متن کاملOptimizing Integer Sorting in O(n log log n) Expected Time in Linear Space
The traditional algorithms for integer sorting give a bound of O(n log n) expected time without randomization and O(n) with randomization. Recent researches have optimized lower bound for deterministic algorithms for integer sorting [4, 5, 7]. We present a fast deterministic algorithm for integer sorting in linear space. The algorithm discussed in this paper sorts n integers in the range {0, 1,...
متن کاملInteger Sorting in O(nplog logn) Expected Time and Linear Space
We present a randomized algorithm sorting n integers in O(nplog logn) expected time and linear space. This improves the previous O(n log logn) bound by Anderson et al. from STOC’95. As an immediate consequence, if the integers are bounded by U , we can sort them in O(nplog logU) expected time. This is the first improvement over the O(n log logU) bound obtained with van Emde Boas’ data structure...
متن کاملImproved Linear Integer Programming Formulations of Nonlinear Integer Problems*
A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer programming problem. However, the standard devices for doing this often produce an inordinate number of variables and constraints, putting the problem beyond the practical reach of available integer programming methods. This paper presents new formulation techniques for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2001
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3053