Zsigmond Nagy

Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel

Kenneth Zeger, Zsigmond Nagy, 1999, AAECC.

Capacity bounds for the three-dimensional (0, 1) run length limited channel

Kenneth Zeger, Zsigmond Nagy, K. Zeger, 2000, IEEE Trans. Inf. Theory.

Zero capacity region of multidimensional run length constraints

Hisashi Ito, Kenneth Zeger, Zsigmond Nagy, 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

Asymptotic capacity of two-dimensional channels with checkerboard constraints

Kenneth Zeger, Zsigmond Nagy, 2003, IEEE Trans. Inf. Theory.

Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions

Kenneth Zeger, Zsigmond Nagy, 2004, IEEE Transactions on Information Theory.

Capacity bounds for the hard-triangle model

Kenneth Zeger, Zsigmond Nagy, 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

Halmazelmélet és halmazelméleti topológia = Set-theory and set-theoretical topology

István Juhász, Zsigmond Nagy, Lajos Soukup, 2007 .

A Tribute to Paul Erdős: On the number of certain subgraphs of graphs without large cliques and independent subsets

Zsigmond Nagy, Andras Hajnal, Lajos Soukup, 1990 .