The SCEAS System
Navigation Menu

Search the dblp DataBase


Katalin Marton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
    Entropy splitting for antiblocking corners and perfect graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:27-40 [Journal]
  2. János Körner, Katalin Marton
    Relative capacity and dimension of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:307-315 [Journal]
  3. 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]
  4. János Körner, Katalin Marton
    Graphs that Split Entropies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:1, pp:71-79 [Journal]
  5. János Körner, Katalin Marton
    Random access communication and graph entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:312-0 [Journal]
  6. János Körner, Katalin Marton
    On the capacity of uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:153-0 [Journal]
  7. 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]
  8. 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
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002