Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

VLDB
1989
ACM

favoriteEmaildiscussreport

67views Database» more VLDB 1989»

Percentile Finding Algorithm for Multiple Sorted Runs

13 years 8 months ago

Percentile Finding Algorithm for Multiple Sorted Runs

Download www.vldb.org

Balakrishna R. Iyer, Gary R. Ricard, Peter J. Varm

Real-time Traffic

Database | VLDB 1989 |

claim paper

Related Content

» Wheres the Winner MaxFinding and Sorting with Metric Costs

» Analyzing and enhancing the parallel sort operation on multithreaded architectures

» Finding the smallest image of a set

» Finding a Heaviest Triangle is not Harder than Matrix Multiplication

» Sorting by Reversals in Subquadratic Time

» Finding and counting cliques and independent sets in runiform hypergraphs

» Dynamic Memory Adjustment for External Mergesort

» Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences

» Algorithms for Loosely Constrained Multiple Sequence Alignment

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1989
Where	VLDB
Authors	Balakrishna R. Iyer, Gary R. Ricard, Peter J. Varman

Comments (0)