K. Marton

2.9k total citations
30 papers, 1.6k citations indexed

About

K. Marton is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, K. Marton has authored 30 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 9 papers in Artificial Intelligence and 7 papers in Electrical and Electronic Engineering. Recurrent topics in K. Marton's work include Wireless Communication Security Techniques (6 papers), Bayesian Methods and Mixture Models (5 papers) and Limits and Structures in Graph Theory (5 papers). K. Marton is often cited by papers focused on Wireless Communication Security Techniques (6 papers), Bayesian Methods and Mixture Models (5 papers) and Limits and Structures in Graph Theory (5 papers). K. Marton collaborates with scholars based in Hungary, United States and Slovakia. K. Marton's co-authors include János Körner, Paul C. Shields, Imre Csiszár, László Lovász and Gábor Simonyi and has published in prestigious journals such as IEEE Transactions on Information Theory, The Annals of Probability and Probability Theory and Related Fields.

In The Last Decade

K. Marton

26 papers receiving 1.5k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
K. Marton Hungary	16	970	820	333	302	219	30	1.6k
John C. Kieffer United States	23	388 0.4×	350 0.4×	575 1.7×	903 3.0×	385 1.8×	109	1.8k
James B. Shearer United States	17	406 0.4×	239 0.3×	632 1.9×	337 1.1×	74 0.3×	50	1.3k
Chandra Nair Hong Kong	17	782 0.8×	633 0.8×	197 0.6×	122 0.4×	151 0.7×	79	1.1k
L. H. Harper United States	12	265 0.3×	309 0.4×	482 1.4×	146 0.5×	29 0.1×	36	1.0k
Thomas A. Courtade United States	21	584 0.6×	623 0.8×	147 0.4×	326 1.1×	184 0.8×	67	1.2k
Igal Sason Israel	21	1.2k 1.3×	1.2k 1.5×	134 0.4×	407 1.3×	140 0.6×	85	1.6k
Michael Scheutzow Germany	26	461 0.5×	284 0.3×	395 1.2×	44 0.1×	46 0.2×	112	1.9k
J.-M. Goethals Netherlands	19	834 0.9×	219 0.3×	377 1.1×	884 2.9×	43 0.2×	31	1.7k
L. L. Campbell Canada	16	220 0.2×	178 0.2×	122 0.4×	277 0.9×	81 0.4×	52	915
Simon Litsyn Israel	27	1.8k 1.9×	1.5k 1.8×	562 1.7×	1.2k 3.9×	257 1.2×	155	2.7k

Countries citing papers authored by K. Marton

Since Specialization

Citations

This map shows the geographic impact of K. Marton's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by K. Marton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K. Marton more than expected).

Fields of papers citing papers by K. Marton

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by K. Marton. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by K. Marton. The network helps show where K. Marton may publish in the future.

Co-authorship network of co-authors of K. Marton

This figure shows the co-authorship network connecting the top 25 collaborators of K. Marton. A scholar is included among the top collaborators of K. Marton based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with K. Marton. K. Marton is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Marton, K.. (2019). Logarithmic Sobolev inequalities in discrete product spaces. Combinatorics Probability Computing. 28(6). 919–935. 10 indexed citations

Marton, K. & Paul C. Shields. (2005). Entropy and the Consistent Estimation of Joint Distributions. 189–189. 2 indexed citations

Marton, K. & Paul C. Shields. (2005). Ergodic Processes And Zero Divergence. 5. 76–76.

Marton, K.. (2004). Measure concentration for Euclidean distance in the case of dependent random variables. The Annals of Probability. 32(3B). 18 indexed citations

Marton, K. & Paul C. Shields. (2002). How many future measures can there be?. Ergodic Theory and Dynamical Systems. 22(1). 257–280. 4 indexed citations

Körner, János & K. Marton. (2001). Relative capacity and dimension of graphs. Discrete Mathematics. 235(1-3). 307–315. 3 indexed citations

Marton, K.. (1998). Measure concentration for a class of random processes. Probability Theory and Related Fields. 110(3). 427–439. 31 indexed citations

Marton, K. & Paul C. Shields. (1996). Correction: "Entropy and the consistent estimation of joint distributions". The Annals of Probability. 24(1). 541–545. 5 indexed citations

Marton, K.. (1996). Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration. The Annals of Probability. 24(2). 126 indexed citations

10.

Marton, K. & Paul C. Shields. (1995). Almost-sure waiting time results for weak and very weak Bernoulli processes. Ergodic Theory and Dynamical Systems. 15(5). 951–960. 15 indexed citations

11.

Marton, K. & Paul C. Shields. (1994). Entropy and the Consistent Estimation of Joint Distributions. The Annals of Probability. 22(2). 37 indexed citations

12.

Marton, K.. (1993). On the Shannon Capacity of Probabilistic Graphs. Journal of Combinatorial Theory Series B. 57(2). 183–195. 21 indexed citations

13.

Körner, János & K. Marton. (1990). On the capacity of uniform hypergraphs. IEEE Transactions on Information Theory. 36(1). 153–156. 7 indexed citations

14.

Csiszár, Imre, János Körner, László Lovász, K. Marton, & Gábor Simonyi. (1990). Entropy splitting for antiblocking corners and perfect graphs. COMBINATORICA. 10(1). 27–40. 51 indexed citations

15.

Körner, János & K. Marton. (1988). New Bounds for Perfect Hashing via Information Theory. European Journal of Combinatorics. 9(6). 523–530. 68 indexed citations

16.

Körner, János & K. Marton. (1988). Random access communication and graph entropy. IEEE Transactions on Information Theory. 34(2). 312–314. 15 indexed citations

17.

Marton, K.. (1987). Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless (Corresp.). IEEE Transactions on Information Theory. 33(3). 443–448.

18.

Marton, K.. (1986). A simple proof of the blowing-up lemma (Corresp.). IEEE Transactions on Information Theory. 32(3). 445–446. 107 indexed citations

19.

Marton, K.. (1979). A coding theorem for the discrete memoryless broadcast channel. IEEE Transactions on Information Theory. 25(3). 306–311. 383 indexed citations

20.

Marton, K.. (1974). Error exponent for source coding with a fidelity criterion. IEEE Transactions on Information Theory. 20(2). 197–199. 116 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact