Sciweavers

120
Voted
STOC
2001
ACM
137views Algorithms» more  STOC 2001»
16 years 3 months ago
Computing with continuous-time Liapunov systems
Jirí Síma, Pekka Orponen
126
Voted
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
16 years 3 months ago
Extractor codes
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
102
Voted
STOC
2001
ACM
133views Algorithms» more  STOC 2001»
16 years 3 months ago
Loss-less condensers, unbalanced expanders, and extractors
Amnon Ta-Shma, Christopher Umans, David Zuckerman
109
Voted
STOC
2001
ACM
144views Algorithms» more  STOC 2001»
16 years 3 months ago
Decidability of string graphs
Marcus Schaefer, Daniel Stefankovic
STOC
2001
ACM
109views Algorithms» more  STOC 2001»
16 years 3 months ago
Stackelberg scheduling strategies
Tim Roughgarden
101
Voted
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
16 years 3 months ago
Regular resolution lower bounds for the weak pigeonhole principle
Toniann Pitassi, Ran Raz
75
Voted
STOC
2001
ACM
114views Algorithms» more  STOC 2001»
16 years 3 months ago
Testing metric properties
Michal Parnas, Dana Ron
127
Voted
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
16 years 3 months ago
Algorithms, games, and the internet
Christos H. Papadimitriou
143
Voted
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 3 months ago
On the cell probe complexity of membership and perfect hashing
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