Join Our Newsletter

ECCC

2010

11 years 5 days ago
2010

We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by th...

EJC

2007

11 years 1 months ago
2007

We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...

DM

2008

11 years 1 months ago
2008

A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...

SODA

2001

ACM

11 years 3 months ago
2001

ACM

Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...

FOCS

2004

IEEE

11 years 5 months ago
2004

IEEE

Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...

FIWAC

1993

11 years 5 months ago
1993

Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...

CRYPTO

2001

Springer

11 years 6 months ago
2001

Springer

Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...

CDC

2009

IEEE

11 years 6 months ago
2009

IEEE

Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....

ESA

2003

Springer

11 years 6 months ago
2003

Springer

We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be eﬃciently approximated to within any constant factor unless P = NP. This ...

IPTPS

2005

Springer

11 years 7 months ago
2005

Springer

In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...