MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the adaptiveness of Quicksort." – sorted by Relevance.

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

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

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

ATOM

G.: On the adaptiveness of quicksort
by Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz — 2005 — In: Workshop on Algorithm Engineering & Experiments, SIAM
…On the Adaptiveness of Quicksort Gerth Stølting Brodal ∗,† Rolf Fagerberg ‡,§ Gabriel Moruz…
Cited by 1 (0 self) – Add To MetaCart

Basic Research in Computer Science
by On The Adaptiveness, Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz, Copyright C, Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz, Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz — 2004
…BRICS RS-04-27 Brodal et al.: On the Adaptiveness of Quicksort BRICS Basic Research in Computer…
Add To MetaCart

Adaptive Functional Programming
by Umut A. Acar , Guy E. Blelloch, Robert Harper — 2001 — IN PROCEEDINGS OF THE 29TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
… it takes to adapt the output, and based on this, show that an adaptive Quicksort adapts its output…
Cited by 34 (17 self) – Add To MetaCart

Adaptive Functional Programming
by Umut Acar Guy, Guy E. Blelloch, Robert Harper — 2001 — In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages
… it takes to adapt the output, and based on this, show that an adaptive Quicksort adapts its output…
Add To MetaCart

Efficient Bulk Loading of Large High-Dimensional Indexes
by Christian Böhm, Hans-Peter Kriegel — 1999 — Proc. Int. Conf. on Data Warehousing and Knowledge Discovery
… is to adapt Quicksort as follows: Quicksort makes a bisection of the data according to a heuristically chosen…
Cited by 3 (1 self) – Add To MetaCart

Implementing Radixsort
by Arne Andersson, Stefan Nilsson — 1998 — ACM Jour. of Experimental Algorithmics
… by quicksort. We take a different approach and study two new algorithms: Adaptive radixsort and Forward…
Cited by 10 (1 self) – Add To MetaCart

An Associative Implementation of Classical Convex Hull Algorithms
by Maher M. Atwah, Johnnie W. Baker, Selim Akl, Johnnie W. Baker Selim Akl — 1996 — Proceedings of Eighth IASTED International Conference on Parallel and Distributed Computing and Systems
… The Quickhull algorithm is an adaptation of the Quicksort algorithm, a recursive method which uses the divide…
Cited by 11 (4 self) – Add To MetaCart

Improving the Query Performance of High-Dimensional Index Structures by Bulk Load Operations
by Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel — 1998 — IN PROC. CONFERENCE ON EXTENDING DATABASE TECHNOLOGY, LNCS 1377
… fuzzily defined as an interval. The basic idea of our algorithm is to adapt Quicksort as follows…
Cited by 43 (11 self) – Add To MetaCart

Efficient Bulk Loading
by Of Large High-Dimensional, Christian Bhm, Hans-peter Kriegel — 1999 — Proc. Int. Conf. on Data Warehousing and Knowledge Discovery
… is to adapt Quicksort as follows: Quicksort makes a bisection of the data according to a heuristically chosen…
Add To MetaCart

Sorting Multisets Stably in Minimum Space
by Jyrki Katajainen And, Jyrki Katajainen, Tomi Pasanen — 1994
… this result by showing that Quicksort can be adapted to sort multisets stably in O( P m i=1 n i log(n=n i…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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