Sciweavers

2252 search results - page 18 / 451

» Lower Bounds for Dynamic Algorithms

16

SODA
2003
ACM

97views Algorithms» more SODA 2003»

Lower bounds for external memory dictionaries

13 years 9 months ago

Lower bounds for external memory dictionaries

Download www.daimi.au.dk

Gerth Stølting Brodal, Rolf Fagerberg

claim paper

Read More »

26

SODA
1992
ACM

96views Algorithms» more SODA 1992»

Lower Bounds for On-Line Graph Coloring

13 years 8 months ago

Lower Bounds for On-Line Graph Coloring

Download www.tcs.fudan.edu.cn

Magnús M. Halldórsson, Mario Szegedy

claim paper

Read More »

18

SODA
2010
ACM

121views Algorithms» more SODA 2010»

Lower bounds for Edit Distance and Product Metrics via Poincare-Type Inequalities

13 years 6 months ago

Lower bounds for Edit Distance and Product Metrics via Poincare-Type Inequalities

Download people.csail.mit.edu

Alexandr Andoni, T.S. Jayram, Mihai Patrascu

claim paper

Read More »

23

IWOCA
2010
Springer

195views Algorithms» more IWOCA 2010»

Upper and Lower I/O Bounds for Pebbling r-Pyramids

13 years 2 months ago

Upper and Lower I/O Bounds for Pebbling r-Pyramids

Download www.cs.brown.edu

Desh Ranjan, John E. Savage, Mohammad Zubair

claim paper

Read More »

23

APPROX
2010
Springer

120views Algorithms» more APPROX 2010»

Uniform Derandomization from Pathetic Lower Bounds

13 years 9 months ago

Uniform Derandomization from Pathetic Lower Bounds

Download www.cs.rutgers.edu

A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...

Eric Allender, Vikraman Arvind, Fengming Wang

claim paper

Read More »

« Prev « First page 18 / 451 Last » Next »