Miklos Ruszinko

17
Documents
Affiliations actuelles
  • Sorbonne University Abu Dhabi (SUAD)
  • SUAD_SAFIR
Identifiants chercheurs

Publications

Publications

Proper edge colorings of planar graphs with rainbow ${C}_{4}$‐s

András Gyárfás , Ryan Martin , Miklos Ruszinko , Gábor N. Sárközy
Journal of Graph Theory, 2024, 107 (4), pp.833-846. ⟨10.1002/jgt.23163⟩
Article dans une revue hal-04928597 v1

Large monochromatic components of small diameter

Erik Carlson , Ryan Martin , Bo Peng , Miklós Ruszinkó
Journal of Graph Theory, 2021, 99 (2), pp.247-250. ⟨10.1002/jgt.22739⟩
Article dans une revue hal-04928637 v1

How to decrease the diameter of triangle-free graphs

Paul Erdős , András Gyárfás , Miklos Ruszinko
Combinatorica, 1998, 18 (4), pp.493-501. ⟨10.1007/s004930050035⟩
Article dans une revue hal-05034392 v1

Prediction of retention data when using incremental multiple development techniques

B. Szabady , Miklos Ruszinko , Sz. Nyiredy
Chromatographia, 1997, 45 (1), pp.369-372. ⟨10.1007/BF02505586⟩
Article dans une revue hal-05034361 v1

How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback

Miklos Ruszinko , P. Vanroose
IEEE Transactions on Information Theory, 1997, 43 (1), pp.368-373. ⟨10.1109/18.567769⟩
Article dans une revue hal-05034341 v1

Intersecting Systems

R. Ahlswede , N. Alon , P. Erdős , Miklos Ruszinko , L. Székely
Combinatorics, Probability and Computing, 1997, 6 (2), pp.127-137. ⟨10.1017/S0963548397003003⟩
Article dans une revue hal-05034290 v1

On a search problem in multidimensional grids

Miklos Ruszinko , Gábor Tardos
Journal of Statistical Planning and Inference, 1997, 59 (1), pp.101-109. ⟨10.1016/S0378-3758(96)00104-8⟩
Article dans une revue hal-05034331 v1

Short Certificates for Tournaments

Noga Alon , Miklos Ruszinko
The Electronic Journal of Combinatorics, 1997, 4 (1), ⟨10.37236/1297⟩
Article dans une revue hal-05034302 v1

Prediction of retention data when using incremental multiple development techniques, Part I. Linearly inrceasing development distances

B. Szabady , Miklos Ruszinko , Sz. Nyiredy
Journal of Planar Chromatography, 1995, 8 (4), pp.279-283
Article dans une revue hal-05034282 v1

On the upper bound of the size of the r-cover-free families

Miklos Ruszinko
Journal of Combinatorial Theory, Series A, 1994, 66 (2), pp.302-310. ⟨10.1016/0097-3165(94)90067-1⟩
Article dans une revue hal-05034254 v1

On a 2-dimensional search problem

Miklos Ruszinko
Journal of Statistical Planning and Inference, 1993, 37 (3), pp.371-383. ⟨10.1016/0378-3758(93)90113-K⟩
Article dans une revue hal-05034216 v1

Application of Multiple Development

B. Szabady , Miklos Ruszinko , Sz. Nyiredy
Proceedings of the Sixth international symposium on Instrumental planar chromatography, Apr 1997, Interlaken, Switzerland. 1997
Proceedings/Recueil des communications hal-05034382 v1

Superimposed codes are almost big distance ones

Z. Furedi , Miklos Ruszinko
IEEE International Symposium on Information Theory, Jun 1997, Ulm, Germany. IEEE, pp.118, 1997, ⟨10.1109/ISIT.1997.613033⟩
Proceedings/Recueil des communications hal-05034351 v1

On the equivalence of some different definitions of capacity of the multiple-access collision channel with multiplicity feedback

Miklos Ruszinko
1995 IEEE International Symposium on Information Theory, Sep 1995, Whistler, Canada. IEEE, pp.76, 1995, ⟨10.1109/ISIT.1995.531178⟩
Proceedings/Recueil des communications hal-05034275 v1

A constructive code reaching capacity 1 for the multiple-access collision channel with multiplicity feedback

Miklos Ruszinko , P. Vanroose
1994 IEEE International Symposium on Information Theory, Jun 1994, Trondheim, Norway. IEEE, pp.287, 1994, ⟨10.1109/ISIT.1994.394731⟩
Proceedings/Recueil des communications hal-05034270 v1

On a 2 and 3-dimensional search problem

Miklos Ruszinko
Proceedings of the Sixth Joint Swedish-Russian International Workshop on Information Theory, Aug 1993, Mölle, Sweden. 1993
Proceedings/Recueil des communications hal-05034223 v1

Coding Methods For Asynchronous Multiple Acces Collision Channels Without Feedback

Miklos Ruszinko
1991 IEEE International Symposium on Information Theory, Jun 1991, Budapest, Hungary. IEEE, pp.341-341, 1991, ⟨10.1109/ISIT.1991.695397⟩
Proceedings/Recueil des communications hal-05034214 v1