MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Sorting in Linear Time?" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

60 documents found, showing 1 through 10. Next 10 →

ATOM

Sorting in Linear Time?
by Arne Andersson, Torben Hagerup, Stefan Nilsson — 1995
…Sorting in Linear Time? Arne Andersson y Torben Hagerup z Stefan Nilsson y Rajeev Raman x…
Cited by 64 (14 self) – Add To MetaCart

Tandem TR 86.3
by Fastsort An External, Alex Tsukerman, Jim Gray, Michael Stewart, Susan Uren, Bonnie Vaughan
… write the target file -- that is it sorts in linear time rather than the traditional Nlog(N) time…
Add To MetaCart

I 8 Perez, M. A. Abidi, and D. W. Bouldin "The Use of VLSI Sorter Coprocessor to Find the Convex Hull," Proc. VLSI and Computers:
by Compeuro' Hamburg Germany, Arnulfo Psrez, Mongi A. Abidi, Donald Xv. Bouldin — 1987
… Sorting is linear-time transformable to the convex hull problem and all convex hull algorithms…
Add To MetaCart

Undirected Single Source Shortest Paths in Linear Time
by Mikkel Thorup — 1997 — J. Assoc. Comput. Mach
… s. However, we do not know how to sort in linear time. Here, a deterministic linear time and linear…
Cited by 37 (2 self) – Add To MetaCart

Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit
by Mikkel Thorup — 1996
…DIMACS Technical Report 96-14 July 1996 Randomized sorting in O(n log log n) time and linear space…
Cited by 9 (2 self) – Add To MetaCart

Technical Report containing detail proofs for paper: Sorting suffixes of two-pattern strings
by F. Franek, W. F. Smyth — 2004
… show that the suffixes of two-pattern strings can be sorted in linear time using a variant of the three…
Add To MetaCart

Sorting the suffixes of a two-pattern string
by Frantisek Franek W. F. Smyth — 2004 — Internat. J. Foundations of Computer Sci
… show that the suffixes of two-pattern strings can be sorted in linear time using a variant of the three…
Cited by 1 (1 self) – Add To MetaCart

Median Bounds and their Application
by Alan Siegel — 1999 — Journal of Algorithms
… to show that n random numbers can be sorted in linear time with probability 1−2 −cn , for any fixed…
Cited by 3 (0 self) – Add To MetaCart

On adaptive integer sorting
by Anna Pagh, Rasmus Pagh, Mikkel Thorup — 2004 — In 12th Annual European Symposium on Algorithms, ESA 2004
… that multisorting and adaptive inversion sorting can be performed in (log n)1−ε linear time if q ≤ 2 . We also show…
Cited by 4 (0 self) – Add To MetaCart

Arne Andersson
by Arne Andersson, Torben Hagerup, Stefan Nilsson
…Sorting in Linear Time? Arne Andersson y Torben Hagerup z Stefan Nilsson x Rajeev Raman…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB