Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ECCC
2010
93views more  ECCC 2010»
11 years 5 days ago
Towards Coding for Maximum Errors in Interactive Communication
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...
Mark Braverman, Anup Rao
EJC
2007
11 years 1 months ago
Hypertree width and related hypergraph invariants
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...
Isolde Adler, Georg Gottlob, Martin Grohe
DM
2008
88views more  DM 2008»
11 years 1 months ago
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
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 ...
Tobias Müller, Attila Pór, Jean-S&eacu...
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
11 years 3 months ago
The diameter of random massive graphs
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...
Linyuan Lu
FOCS
2004
IEEE
11 years 5 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
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 ...
Subhash Khot
FIWAC
1993
139views Cryptology» more  FIWAC 1993»
11 years 5 months ago
Montgomery-Suitable Cryptosystems
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...
David Naccache, David M'Raïhi
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
11 years 6 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
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...
Ronald Cramer, Ivan Damgård, Serge Fehr
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
11 years 6 months ago
A constant-factor approximately optimal solution to the Witsenhausen counterexample
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
Se Yong Park, Pulkit Grover, Anant Sahai
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
11 years 6 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
IPTPS
2005
Springer
11 years 7 months ago
Dynamic Load Balancing in Distributed Hash Tables
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...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
books