Corpus ID: 14594484

Optimizing Integer Sorting in O ( n log log n ) Expected Time in Linear Space

@inproceedings{Singh2011OptimizingIS,
  title={Optimizing Integer Sorting in O ( n log log n ) Expected Time in Linear Space},
  author={A. Singh and D. Garg},
  year={2011}
}
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,2... m − 1} in linear space in O(n log log n) expected time. This improves the traditional… Expand

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Faster deterministic sorting and searching in linear space
  • A. Andersson
  • Computer Science
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
  • 121
  • Highly Influential
  • PDF
Improved Nonconservative Sequential and Parallel Integer Sorting
  • 24
Deterministic sorting in O(nlog log n) time and linear space
  • Yijie Han
  • Mathematics, Computer Science
  • STOC '02
  • 2002
  • 114
  • Highly Influential
Sorting in linear time?
  • 198
  • PDF
Conservative Algorithms for Parallel and Sequential Integer Sorting
  • 18
Integer Sorting in Expected Time and Linear Space
  • 55
Upper Bounds for Sorting Integers on Random Access Machines
  • 98
Faster deterministic sorting and priority queues in linear space
  • M. Thorup
  • Mathematics, Computer Science
  • SODA '98
  • 1998
  • 49
  • PDF
Improved fast integer sorting in linear space
  • Yijie Han
  • Computer Science, Mathematics
  • SODA '01
  • 2001
  • 36
A Reliable Randomized Algorithm for the Closest-Pair Problem
  • 208
  • PDF
...
1
2
3
...