Miklós Ruszinkó

According to our database1, Miklós Ruszinkó authored at least 35 papers between 1994 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A modified bootstrap percolation on a random graph coupled with a lattice.
Discrete Applied Mathematics, 2019

2018
Graph Models of Neurodynamics to Support Oscillatory Associative Memories.
Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

2017
Resting state neural networks and energy metabolism.
Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

2016
Modeling learning and strategy formation as phase transitions in cortical networks.
Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

2014
Accelerating unstructured finite volume computations on field-programmable gate arrays.
Concurrency and Computation: Practice and Experience, 2014

2012
Large components in r-edge-colorings of Kn have diameter at most five.
Journal of Graph Theory, 2012

2011
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electr. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.
Australasian J. Combinatorics, 2011

2008
Large convex cones in hypercubes.
Discrete Applied Mathematics, 2008

Three-color Ramsey numbers for paths.
Combinatorica, 2008

2007
Randomly generated intersecting hypergraphs II.
Random Struct. Algorithms, 2007

Tripartite Ramsey numbers for paths.
Journal of Graph Theory, 2007

Codes identifying sets of vertices in random networks.
Discrete Mathematics, 2007

Three-Color Ramsey Numbers For Paths.
Combinatorica, 2007

2006
An improved bound for the monochromatic cycle partition number.
J. Comb. Theory, Ser. B, 2006

Multiple User Tracing Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Single-user tracing and disjointly superimposed codes.
IEEE Trans. Information Theory, 2005

Large Convex Cones in Hypercubes.
Electronic Notes in Discrete Mathematics, 2005

Identifying codes in random networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Single user tracing superimposed codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On Randomly Generated Intersecting Hypergraphs.
Electr. J. Comb., 2003

2002
On the maximum size of (p, Q)-free families.
Discrete Mathematics, 2002

2001
Anti-Ramsey Colorings in Several Rounds.
J. Comb. Theory, Ser. B, 2001

On the Maximum Size of (p, Q) - free Families.
Electronic Notes in Discrete Mathematics, 2001

G-Intersecting Families.
Combinatorics, Probability & Computing, 2001

Vertex Covers by Edge Disjoint Cliques.
Combinatorica, 2001

2000
Decreasing the diameter of bounded degree graphs.
Journal of Graph Theory, 2000

A Note on Random Minimum Length Spanning Trees.
Electr. J. Comb., 2000

Note on Sparse Random Graphs and Cover Graphs.
Electr. J. Comb., 2000

1999
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes.
IEEE Trans. Information Theory, 1999

1998
How to decrease the diameter of triangle-free graphs.
Combinatorica, 1998

1997
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. Information Theory, 1997

Intersecting Systems.
Combinatorics, Probability & Computing, 1997

Short Certificates for Tournaments.
Electr. J. Comb., 1997

1994
On the Upper Bound of the Size of the r-Cover-Free Families.
J. Comb. Theory, Ser. A, 1994


  Loading...