Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 210,200,651 papers from all fields of science

Search

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

Highly Cited

2016

Highly Cited

2016

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

2016

2016

Quantum Lovász number is a quantum generalization of the Lovász number in graph theory. It is the best known efficiently…

Highly Cited

2016

Highly Cited

2016

Highly Cited

2014

Highly Cited

2014

2013

2013

We study zero-error entanglement-assisted source-channel coding (communication in the presence of side information). Adapting a…

Highly Cited

2010

Highly Cited

2010

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

2010

2010

The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor…

Highly Cited

1991

Highly Cited

1991

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…