Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or…

2016

2016

We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the…

Highly Cited

2013

Highly Cited

2013

We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we…

2013

2013

In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n-bit word to n receivers…

Highly Cited

2005

Highly Cited

2005

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity

We prove that an ω(log3n) lower bound for the three-party number-on-the-forehead (NOF) communication complexity of the set…

Highly Cited

2004

Highly Cited

2004

We extend the Sherali--Adams, Lovasz--Schrijver, Balas--Ceria--Cornuejols, and Lasserre lift-and-project methods for 0-1…

2000

2000

Let F be a compact subset of the n-dimensional Euclidean space R represented by (finitely or infinitely many) quadratic…

Highly Cited

1994

Highly Cited

1994

We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of theL3…

Highly Cited

1988

Highly Cited

1988

We prove <italic>&thgr;</italic>(<italic>n</italic> log <italic>n</italic>) bounds for the deterministic 2-way communication…

Highly Cited

1979

Highly Cited

1979

Delsarte's linear programming bound (an upper bound on the cardinality of cliques in association schemes) is compared with Lov…