7 search results - page 1 / 2 » On Sorting an Intransitive Total Ordered Set Using Semi-Heap |
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...