Sciweavers

ECCC
2010
153views more  ECCC 2010»
13 years 6 months ago
Local list decoding with a constant number of queries
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 6 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
OPODIS
2010
13 years 9 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak
ANOR
2005
81views more  ANOR 2005»
13 years 11 months ago
Managing Stochastic, Finite Capacity, Multi-Project Systems through the Cross-Entropy Methodology
This paper addresses the problem of loading a finite capacity, stochastic (random) and dynamic multi-project system. The system is controlled by keeping a constant number of projec...
Izack Cohen, Boaz Golany, Avraham Shtub
ECCC
2007
88views more  ECCC 2007»
13 years 11 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 11 months ago
Approximate Capacity of Gaussian Relay Networks
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
13 years 11 months ago
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
Patrik Floréen, Petteri Kaski, Valentin Pol...
SIROCCO
2007
14 years 26 days ago
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
Rastislav Kralovic, Richard Královic
DCOSS
2008
Springer
14 years 1 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
ATAL
2008
Springer
14 years 1 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...