Katalin Marton On the Shannon Capacity of Probabilistic Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:57, n:2, pp:183-195 [Journal]

Katalin Marton A simple proof of the blowing-up lemma. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:445-0 [Journal]

Katalin Marton Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:443-0 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP