Miklós Ruszinkó

Publication Activity (10 Years)

Years Active: 1994-2022
Publications (10 Years): 8

Top Topics

Application Specific Integrated Circuits

Biologically Plausible

Spiking Neural Networks

Top Venues

J. Graph Theory

Publications

Erik Carlson, Ryan R. Martin, Bo Peng, Miklós Ruszinkó
Large monochromatic components of small diameter. J. Graph Theory 99 (2) (2022)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy
Linear Turán numbers of acyclic triple systems. Eur. J. Comb. 99 (2022)
Svante Janson, Robert Kozma, Miklós Ruszinkó, Yury Sokolov
A modified bootstrap percolation on a random graph coupled with a lattice. Discret. Appl. Math. 258 (2019)
Daniel J. Saunders, Hava T. Siegelmann, Robert Kozma, Miklós Ruszinkó
STDP Learning of Image Patches with Convolutional Spiking Neural Networks. IJCNN (2018)
Gabriel P. Andrade, Miklós Ruszinkó, Robert Kozma
Graph Models of Neurodynamics to Support Oscillatory Associative Memories. IJCNN (2018)
Daniel J. Saunders, Hava T. Siegelmann, Robert Kozma, Miklós Ruszinkó
STDP Learning of Image Patches with Convolutional Spiking Neural Networks. CoRR (2018)
Raymond Noack, Chetan Manjesh, Miklós Ruszinkó, Hava T. Siegelmann, Robert Kozma
Resting state neural networks and energy metabolism. IJCNN (2017)
Robert Kozma, Yury Sokolov, Marko Puljic, Sanqing Hu, Miklós Ruszinkó
Modeling learning and strategy formation as phase transitions in cortical networks. SMC (2016)
Zoltán Nagy, Csaba Nemes, Antal Hiba, Árpád Csík, András Kiss, Miklós Ruszinkó, Péter Szolgay
Accelerating unstructured finite volume computations on field-programmable gate arrays. Concurr. Comput. Pract. Exp. 26 (3) (2014)
Zoltán Nagy, Csaba Nemes, Antal Hiba, Árpád Csík, András Kiss, Miklós Ruszinkó, Péter Szolgay
Accelerating unstructured finite volume computations on field-programmable gate arrays. CoRR (2014)
Miklós Ruszinkó
have diameter at most five. J. Graph Theory 69 (3) (2012)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp
Long rainbow cycles in proper edge-colorings of complete graphs. Australas. J Comb. 50 (2011)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electron. J. Comb. 18 (1) (2011)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-color Ramsey numbers for paths. Comb. 28 (4) (2008)
Zoltán Füredi, Miklós Ruszinkó
Large convex cones in hypercubes. Discret. Appl. Math. 156 (9) (2008)
Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Clifford D. Smyth
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30 (1-2) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Tripartite Ramsey numbers for paths. J. Graph Theory 55 (2) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-Color Ramsey Numbers For Paths. Comb. 27 (1) (2007)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Codes identifying sets of vertices in random networks. Discret. Math. 307 (9-10) (2007)
Bálint Laczay, Miklós Ruszinkó
Multiple User Tracing Codes. ISIT (2006)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
An improved bound for the monochromatic cycle partition number. J. Comb. Theory, Ser. B 96 (6) (2006)
Miklós Csürös, Miklós Ruszinkó
Single-user tracing and disjointly superimposed codes. IEEE Trans. Inf. Theory 51 (4) (2005)
Zoltán Füredi, Miklós Ruszinkó
Large Convex Cones in Hypercubes. Electron. Notes Discret. Math. 21 (2005)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Identifying codes in random networks. ISIT (2005)
Miklós Csürös, Miklós Ruszinkó
Single user tracing superimposed codes. ISIT (2004)
Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003)
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
)-free families. Discret. Math. 257 (2-3) (2002)
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
G-Intersecting Families. Comb. Probab. Comput. 10 (5) (2001)
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
Vertex Covers by Edge Disjoint Cliques. Comb. 21 (2) (2001)
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
On the Maximum Size of (p, Q) - free Families. Electron. Notes Discret. Math. 10 (2001)
Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó
Anti-Ramsey Colorings in Several Rounds. J. Comb. Theory, Ser. B 82 (1) (2001)
Noga Alon, András Gyárfás, Miklós Ruszinkó
Decreasing the diameter of bounded degree graphs. J. Graph Theory 35 (3) (2000)
Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
A Note on Random Minimum Length Spanning Trees. Electron. J. Comb. 7 (2000)
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
Note on Sparse Random Graphs and Cover Graphs. Electron. J. Comb. 7 (2000)
Zoltán Füredi, Miklós Ruszinkó
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. IEEE Trans. Inf. Theory 45 (2) (1999)
Paul Erdös, András Gyárfás, Miklós Ruszinkó
How to decrease the diameter of triangle-free graphs. Comb. 18 (4) (1998)
Noga Alon, Miklós Ruszinkó
Short Certificates for Tournaments. Electron. J. Comb. 4 (1) (1997)
Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
Intersecting Systems. Comb. Probab. Comput. 6 (2) (1997)
Miklós Ruszinkó, Peter Vanroose
How an Erdöos-Rényi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback. IEEE Trans. Inf. Theory 43 (1) (1997)
Miklós Ruszinkó
On the Upper Bound of the Size of the r-Cover-Free Families. J. Comb. Theory, Ser. A 66 (2) (1994)