The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

János Körner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rudolf Ahlswede, János Körner
    Appendix: On Common Information and Related Characteristics of Correlated Information Sources. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:664-677 [Conf]
  2. 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]
  3. János Körner, Gábor Simonyi
    Graph Pairs and their Entropies: Modularity Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:2, pp:227-240 [Journal]
  4. János Körner, Gábor Simonyi, Zsolt Tuza
    Perfect couples of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:179-192 [Journal]
  5. Noga Alon, Emanuela Fachini, János Körner
    Locally Thin Set Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:6, pp:- [Journal]
  6. Noga Alon, János Körner, Angelo Monti
    String Quartets In Binary. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:5, pp:- [Journal]
  7. Emanuela Fachini, János Körner
    A Note On Counting Very Different Sequences. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:6, pp:- [Journal]
  8. Caterina De Simone, János Körner
    On the Odd Cycles of Normal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:161-169 [Journal]
  9. 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]
  10. Emanuela Fachini, János Körner
    Tight Packings of Hamming Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:2, pp:292-294 [Journal]
  11. Emanuela Fachini, János Körner, Angelo Monti
    A Better Bound for Locally Thin Set Families. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:2, pp:209-218 [Journal]
  12. Luisa Gargano, János Körner, Ugo Vaccaro
    Qualitative Independence and Sperner Problems for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:173-192 [Journal]
  13. Luisa Gargano, János Körner, Ugo Vaccaro
    Capacities: From Information Theory to Extremal Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:68, n:2, pp:296-316 [Journal]
  14. Henk D. L. Hollmann, János Körner, Simon Litsyn
    Tiling Hamming Space with Few Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:388-393 [Journal]
  15. Frank K. Hwang, János Körner, V. K.-W. Wei
    Selecting Non-consecutive Balls Arranged in Many Lines. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:327-336 [Journal]
  16. János Körner
    On the Extremal Combinatorics of the Hamming Space. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:71, n:1, pp:112-126 [Journal]
  17. János Körner, Angelo Monti
    Delta-Systems and Qualitative (In)Dependence. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:99, n:1, pp:75-84 [Journal]
  18. János Körner, Concetta Pilotto, Gábor Simonyi
    Local chromatic number and Sperner capacity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:101-117 [Journal]
  19. János Körner, Gábor Simonyi
    A Sperner-Type Theorem and Qualitative Independence. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:90-103 [Journal]
  20. János Körner, Angelo Monti
    Compact Representations of the Intersection Structure of Families of Finite Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:181-192 [Journal]
  21. János Körner, Claudia Malvenuto
    Pairwise colliding permutations and the capacity of infinite graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:203-212 [Journal]
  22. 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]
  23. János Körner, Gábor Simonyi
    Separating Partition System and Locally Different Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:355-359 [Journal]
  24. Imre Csiszár, János Körner
    Graph decomposition: A new key to coding theorems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:1, pp:5-11 [Journal]
  25. Imre Csiszár, János Körner
    Feedback does not affect the reliability function of a DMC at rates above capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:1, pp:92-0 [Journal]
  26. Thomas H. E. Ericson, János Körner
    Successive encoding of correlated sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:390-395 [Journal]
  27. Emanuela Fachini, János Körner
    Codes for a long silence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:8, pp:2020-2023 [Journal]
  28. János Körner
    OPEC or a basic problem in source networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:1, pp:68-77 [Journal]
  29. János Körner, M. Lucertini
    Compressing inconsistent data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:706-715 [Journal]
  30. 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]
  31. 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]
  32. János Körner, Alon Orlitsky
    Zero-Error Information Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2207-2229 [Journal]
  33. János Körner, Victor K. Wei
    Odd and even hamming spheres also have minimum boundary. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:2, pp:147-165 [Journal]
  34. János Körner, Victor K. Wei
    Addendum to "odd and even hamming spheres also have minimum boundary". [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:1, pp:105-106 [Journal]

  35. On types of growth for graph-different permutations [Citation Graph (, )][DBLP]


  36. On the permutation capacity of digraphs [Citation Graph (, )][DBLP]


  37. On Cancellative Set Families. [Citation Graph (, )][DBLP]


  38. Search problems for two irregular coins with incomplete feedback: the underweight model. [Citation Graph (, )][DBLP]


Search in 0.153secs, Finished in 0.154secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002