On the Upper Bound of the Size of the r-Cover-Free Families. - Miklós Ruszinkó (J. Comb. Theory A, 1994)

Short Certificates for Tournaments. - Noga Alon; Miklós Ruszinkó (Electron. J. Comb., 1997)

Intersecting Systems. - Rudolf Ahlswede; Noga Alon; Péter L. Erdös; Miklós Ruszinkó; László A. Székely (Comb. Probab. Comput., 1997)

How an Erdöos-Rényi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback. - Miklós Ruszinkó; Peter Vanroose (IEEE Trans. Inf. Theory, 1997)

How to decrease the diameter of triangle-free graphs. - Paul Erdös; András Gyárfás; Miklós Ruszinkó (Comb., 1998)

An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. - Zoltán Füredi; Miklós Ruszinkó (IEEE Trans. Inf. Theory, 1999)

Note on Sparse Random Graphs and Cover Graphs. - Tom Bohman; Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Electron. J. Comb., 2000)

A Note on Random Minimum Length Spanning Trees. - Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Electron. J. Comb., 2000)

Decreasing the diameter of bounded degree graphs. - Noga Alon; András Gyárfás; Miklós Ruszinkó (J. Graph Theory, 2000)

Vertex Covers by Edge Disjoint Cliques. - Tom Bohman; Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Comb., 2001)

G-Intersecting Families. - Tom Bohman; Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Comb. Probab. Comput., 2001)

On the Maximum Size of (p, Q) - free Families. - Zoltán Füredi; András Gyárfás; Miklós Ruszinkó (Electron. Notes Discret. Math., 2001)

Anti-Ramsey Colorings in Several Rounds. - Aart Blokhuis; Ralph J. Faudree; András Gyárfás; Miklós Ruszinkó (J. Comb. Theory B, 2001)

On the maximum size of (p, Q)-free families. - Zoltán Füredi; András Gyárfás; Miklós Ruszinkó (Discret. Math., 2002)

On Randomly Generated Intersecting Hypergraphs. - Tom Bohman; Colin Cooper; Alan M. Frieze; Ryan R. Martin; Miklós Ruszinkó (Electron. J. Comb., 2003)

Single user tracing superimposed codes. - Miklós Csürös; Miklós Ruszinkó (ISIT, 2004)

Identifying codes in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (ISIT, 2005)

Single-user tracing and disjointly superimposed codes. - Miklós Csürös; Miklós Ruszinkó (IEEE Trans. Inf. Theory, 2005)

Multiple User Tracing Codes. - Bálint Laczay; Miklós Ruszinkó (ISIT, 2006)

An improved bound for the monochromatic cycle partition number. - András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi (J. Comb. Theory B, 2006)

Codes identifying sets of vertices in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (Discret. Math., 2007)

Tripartite Ramsey numbers for paths. - András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi (J. Graph Theory, 2007)

Randomly generated intersecting hypergraphs II. - Tom Bohman; Alan M. Frieze; Ryan R. Martin; Miklós Ruszinkó; Cliff Smyth 001 (Random Struct. Algorithms, 2007)

Three-color Ramsey numbers for paths. - András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi (Comb., 2008)

Large convex cones in hypercubes. - Zoltán Füredi; Miklós Ruszinkó (Discret. Appl. Math., 2008)

Long rainbow cycles in proper edge-colorings of complete graphs. - András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Richard H. Schelp (Australas. J Comb., 2011)

Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. - András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi (Electron. J. Comb., 2011)

Large components in r-edge-colorings of Kn have diameter at most five. - Miklós Ruszinkó (J. Graph Theory, 2012)

Accelerating unstructured finite volume computations on field-programmable gate arrays. - Zoltán Nagy 001; Csaba Nemes; Antal Hiba; Árpád Csík; András Kiss; Miklós Ruszinkó; Péter Szolgay (Concurr. Comput. Pract. Exp., 2014)

Modeling learning and strategy formation as phase transitions in cortical networks. - Robert Kozma 001; Yury Sokolov; Marko Puljic; Sanqing Hu; Miklós Ruszinkó (SMC, 2016)

Resting state neural networks and energy metabolism. - Raymond Noack; Chetan Manjesh; Miklós Ruszinkó; Hava T. Siegelmann; Robert Kozma 001 (IJCNN, 2017)

Graph Models of Neurodynamics to Support Oscillatory Associative Memories. - Gabriel P. Andrade; Miklós Ruszinkó; Robert Kozma 001 (IJCNN, 2018)

STDP Learning of Image Patches with Convolutional Spiking Neural Networks. - Daniel J. Saunders; Hava T. Siegelmann; Robert Kozma 001; Miklós Ruszinkó (IJCNN, 2018)

A modified bootstrap percolation on a random graph coupled with a lattice. - Svante Janson; Robert Kozma 001; Miklós Ruszinkó; Yury Sokolov (Discret. Appl. Math., 2019)

Linear Turán numbers of acyclic triple systems. - András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy (Eur. J. Comb., 2022)

Large monochromatic components of small diameter. - Erik Carlson; Ryan R. Martin; Bo Peng; Miklós Ruszinkó (J. Graph Theory, 2022)

Proper edge colorings of planar graphs with rainbow C4 ${C}_{4}$-s. - András Gyárfás; Ryan R. Martin; Miklós Ruszinkó; Gábor N. Sárközy (J. Graph Theory, 2024)