Algorithms | Sciweavers

25

click to vote

STOC
2001
ACM

137views Algorithms» more STOC 2001»

Computing with continuous-time Liapunov systems

14 years 12 months ago

Download www.tcs.hut.fi

Jirí Síma, Pekka Orponen

claim paper

Read More »

33

click to vote

STOC
2001
ACM

163views Algorithms» more STOC 2001»

Extractor codes

14 years 12 months ago

Download www.cs.tau.ac.il

We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...

Amnon Ta-Shma, David Zuckerman

claim paper

Read More »

33

click to vote

STOC
2001
ACM

133views Algorithms» more STOC 2001»

Loss-less condensers, unbalanced expanders, and extractors

14 years 12 months ago

Download www.cs.tau.ac.il

Amnon Ta-Shma, Christopher Umans, David Zuckerman

claim paper

Read More »

30

click to vote

STOC
2001
ACM

144views Algorithms» more STOC 2001»

Decidability of string graphs

14 years 12 months ago

Download people.cs.uchicago.edu

Marcus Schaefer, Daniel Stefankovic

claim paper

Read More »

93

click to vote

STOC
2001
ACM

317views Algorithms» more STOC 2001»

Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time

14 years 12 months ago

Download page.mi.fu-berlin.de

Daniel A. Spielman, Shang-Hua Teng

claim paper

Read More »

27

click to vote

STOC
2001
ACM

109views Algorithms» more STOC 2001»

Stackelberg scheduling strategies

14 years 12 months ago

Download www.cs.nyu.edu

Tim Roughgarden

claim paper

Read More »

33

click to vote

STOC
2001
ACM

116views Algorithms» more STOC 2001»

Regular resolution lower bounds for the weak pigeonhole principle

14 years 12 months ago

Download www.cs.helsinki.fi

Toniann Pitassi, Ran Raz

claim paper

Read More »

19

click to vote

STOC
2001
ACM

114views Algorithms» more STOC 2001»

Testing metric properties

14 years 12 months ago

Download www.eng.tau.ac.il

Michal Parnas, Dana Ron

claim paper

Read More »

33

click to vote

STOC
2001
ACM

119views Algorithms» more STOC 2001»

Algorithms, games, and the internet

14 years 12 months ago

Download www.cse.iitb.ac.in

Christos H. Papadimitriou

claim paper

Read More »

41

click to vote

STOC
2001
ACM

151views Algorithms» more STOC 2001»

On the cell probe complexity of membership and perfect hashing

14 years 12 months ago

Download www.it-c.dk

We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...

Rasmus Pagh

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers