Sciweavers

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

88

WADS
1993
Springer

87views Algorithms» more WADS 1993»

A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms

15 years 7 months ago

A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms

Download www.daimi.au.dk

Lars Arge, Mikael Knudsen, Kirsten Larsen

Real-time Traffic

Algorithms | WADS 1993 |

claim paper

Related Content

» CacheOblivious ComparisonBased Algorithms on Multisets

» General Lower Bounds for the Running Time of Evolutionary Algorithms

» Parallel Randomized Load Balancing A Lower Bound for a More General Model

» A General Scheme for Multiple Lower Bound Computation in Constraint Optimization

» Lower and upper bounds on obtaining history independence

» Sufficient Conditions for Intractability over BlackBox Groups Generic Lower Bounds for Gen...

» Property Testing Lower Bounds via Communication Complexity

» Improved Approximation Guarantees for LowerBounded Facility Location

» Timespace tradeoffs in resolution superpolynomial lower bounds for superlinear space

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	WADS
Authors	Lars Arge, Mikael Knudsen, Kirsten Larsen

Comments (0)