Arne Andersson, Stefan Nilsson  Home/Search
Context Related
| csd.uu.se/~arnea/ps/radix.ps cs.lth.se/Research/Algorit...stefan3.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: csd.uu.se/~arnea/ (more) From: cs.lth.se/Resea...ers.description (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present new improved algorithms for the sorting problem. The algorithms are not only efficient but also clear and simple. First, we introduce Forward Radix Sort which combines the advantages of traditional left-to-right and right-to-left radix sort in a simple manner. We argue that this algorithm will work very well in practice. Adding a preprocessing step, we obtain an algorithm with attractive theoretical properties. For example, n binary strings can be sorted in \Theta i n log i B n... (Update)
Context of citations to this paper: More
.... doubling technique of Karp Miller Rosenberg [8] ternary partitioning of Bentley Sedgewick [3] and numbering method of Andersson Nilsson [1] and ManberMyers [10] It requires only 9n bytes for sorting a text of length n by using a clever ordering of sorting and an integer...
.... of words (if there is no bound on the number of words per integer, we need to add the time it takes to read the distinguishing prefixes [4]) As discussed in [2] multiple word integers are not an exotic special case. For example, the IEEE 754 floating point standard is...
Cited by: More
Integer Sorting in O(n √(log log n)) Expected Time and.. - Han, Thorup (2005) (Correct)
Efficient Implementation of Suffix Trees - Andersson, Nilsson (1995) (Correct)
Unifying Text Search And Compression - Suffix Sorting, Block.. - Sadakane (2000) (Correct)
Similar documents (at the sentence level):
7.5%: Implementing Radixsort - Andersson, Nilsson (Correct)
Active bibliography (related documents): More All
0.6: Fast Updating of Well-Balanced Trees - Andersson, Lai (1990) (Correct)
0.5: Optical Communication for Pointer Based Algorithms - Anderson (1988) (Correct)
0.4: Using Difficulty of Prediction to Decrease Computation: Fast.. - Chen, Reif (1993) (Correct)
Similar documents based on text: More All
0.2: Top Speed FFTs for FMA Architectures - Karner, Auer, Ueberhuber (1998) (Correct)
0.2: Communication Conscious Radix Sort - Jiménez-González.. (1999) (Correct)
0.2: High Performance Rotation Architectures Based On.. - Antelo, Villalba.. (1997) (Correct)
Related documents from co-citation: More All
7: Fast algorithms for sorting and searching strings - Bentley, Sedgewick - 1997
6: A space-economical suffix tree construction algorithm (context) - McCreight - 1976
6: Improved parallel integer sorting without concurrent writing - Albers, Hagerup - 1992
BibTeX entry: (Update)
A. Andersson and S. Nilsson. A New Efficient Radix Sort. In 35th Symp. on Foundations of Computer Science, pages 714--721, 1994. http://citeseer.ist.psu.edu/andersson94new.html More
@inproceedings{ andersson94new,
author = "Andersson and Nilsson",
title = "A New Efficient Radix Sort",
booktitle = "{FOCS}: {IEEE} Symposium on Foundations of Computer Science ({FOCS})",
year = "1994",
url = "citeseer.ist.psu.edu/andersson94new.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
249 Volume 3: Sorting and Searching (context) - Knuth, of - 1973
201 Three partition refinement algorithms (context) - Paige, Tarjan - 1987
121 Handbook of Algorithms and Data Structures (context) - Gonnet, Baeza-Yates - 1991
91 Data Structures and Algorithms 1: Sorting and Searching (context) - Mehlhorn - 1984
78 Ergodic theory and information (context) - Billingsley - 1965
44 Communications of the ACM (context) - Fredkin - 1960
31 Improved parallel integer sorting without concurrent writing - Albers, Hagerup - 1992
28 Lecture Notes on Bucket Algorithms (context) - Devroye - 1985
20 Upper bounds for sorting integers on random access machines (context) - Kirkpatrick, Reisch - 1984
15 Algorithms and data structures: design (context) - Kingston - 1990
14 Asymptotical growth of a class of random trees (context) - Pittel - 1985
9 Using difficulty of prediction to decrease computation: Fast.. - Chen, Reif - 1993
7 Sorting by distributive partitioning (context) - Dobosiewicz - 1978
6 Searching unindexed and nonuniformly generated files in logl.. (context) - Willard - 1985
6 The complexity of searching an ordered random table (context) - Yao, Yao - 1976
5 expected behavior of typical suffix trees (context) - Szpankowski - 1992
2 Personal communication (context) - Reif - 1994
2 Interpolation and InterpolationHash Searching (context) - Gonnet - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csd.uu.se/~arnea/): More
Static Dictionaries on AC^0 RAMs: Query time.. - Andersson.. (Correct)
Improving Partial Rebuilding by Using Simple Balance Criteria - Andersson (1989) (Correct)
Fast Updating of Well-Balanced Trees - Andersson, Lai (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC