Items where Author is "Ruszinkó, Miklós"
 | Up a level |
Number of items: 48.
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2014 | Nagy, Zoltán and Nemes, Csaba and Hiba, Antal and Csík, Árpád and Kiss, András and Ruszinkó, Miklós and Szolgay, Péter Accelerating unstructured finite volume computations on field-programmable gate arrays |  | ISI Article |
| 2014 | Hiba, Antal and Nagy, Zoltán and Ruszinkó, Miklós and Szolgay, Péter Data locality-based mesh partitioning methods for dataflow machines | | Book Section |
| 2012 | Hiba, Antal and Nagy, Zoltán and Ruszinkó, Miklós Memory access optimization for computations on unstructured meshes | Conference or Workshop Item | |
| 2011 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Schelp, R Long rainbow cycles in proper edge-colorings of complete graphs | Article | |
| 2011 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Partitioning 3-colored complete graphs into three monochromatic cycles | ISI Article | |
| 2010-09-05 | Nemes, Cs. and Nagy, Zoltán and Ruszinkó, Miklós and Kiss, András and Szolgay, Péter Mapping of high performance data-flow graphs into programmable logic devices | Conference or Workshop Item | |
| 2008 | Füredi, Zoltán and Ruszinkó, Miklós Large convex cones in hypercubes | ISI Article | |
| 2008 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Three-color Ramsey numbers for paths | ISI Article | |
| 2007 | Frieze, Alan and Martin, Ryan and Moncel, Julien and Ruszinkó, Miklós and Smyth, Cliff Codes identifying sets of vertices in random networks | ISI Article | |
| 2007 | Laczay, Bálint and Ruszinkó, Miklós Collision channel with multiplicity feedback | Book Section | |
| 2007 | Danev, Danyo and Laczay, Bálint and Ruszinkó, Miklós Multiple access Euclidean channel | Book Section | |
| 2007 | Danev, Danyo and Füredi, Zoltán and Ruszinkó, Miklós Multiple access adder channel | Book Section | |
| 2007 | Bohman, Tom and Frieze, Alan and Martin, Ryan and Ruszinkó, Miklós and Smyth, Cliff Randomly generated intersecting hypergraphs II | ISI Article | |
| 2007 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Three-color Ramsey numbers for paths | ISI Article | |
| 2007 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Tripartite Ramsey numbers for paths | ISI Article | |
| 2006 | Laczay, Bálint and Ruszinkó, Miklós Multiple user tracing codes | Conference or Workshop Item | |
| 2006 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemeredi, E. One-sided coverings of colored complete bipartite graphs | Book Section | |
| 2006 | Ruszinkó, Miklós Turán Systems | Book Section | |
| 2006 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemeredi, E. An improved bound for the monochromatic cycle partition number | | ISI Article |
| 2005 | Frieze, A. and Martin, R. and Moncel, J. and Ruszinkó, Miklós and Smyth, C. Identifying codes in random networks | Conference or Workshop Item | |
| 2005 | Csűrös, M. and Ruszinkó, Miklós Single-user tracing and disjointly superimposed codes | Article | |
| 2004 | Csűrös, M. and Ruszinkó, Miklós Single user tracing superimposed codes | Conference or Workshop Item | |
| 2003 | Bohman, T. and Cooper, C. and Frieze, A. and Martin, R. and Ruszinkó, Miklós On randomly generated intersecting hypergraphs | Article | |
| 2002 | Füredi, Z. and Gyárfás, András and Ruszinkó, Miklós On the maximum size of (p,Q)-free families | Article | |
| 2001 | Blokhuis, A. and Faudree, R. and Gyárfás, András and Ruszinkó, Miklós Anti-Ramsey colorings in several rounds | Article | |
| 2001 | Bohman, T. and Frieze, A. and Ruszinkó, Miklós and Thoma, L. G-intersecting families | Article | |
| 2001 | Bohman, T. and Frieze, A. and Ruszinkó, Miklós and Thoma, L. Vertex covers by edge disjoint cliques | Article | |
| 2000 | Alon, N. and Gyárfás, András and Ruszinkó, Miklós Decreasing the diameter of bounded degree graphs | Article | |
| 2000 | Bohman, T. and Ruszinkó, Miklós and Thoma, L. Shannon capacity of large odd cycles | Conference or Workshop Item | |
| 2000 | Frieze, A. and Ruszinkó, Miklós and Thoma, L. A note on random minimum length spanning trees | Article | |
| 2000 | Bohman, T. and Frieze, A. and Ruszinkó, Miklós and Thoma, L. A note on sparse random graphs and cover graphs | Article | |
| 1999 | Füredi, Z. and Ruszinkó, Miklós An improved upper bound of the rate of Eucledian superimposed codes | Article | |
| 1998 | Erdős, P. and Gyárfás, András and Ruszinkó, Miklós How to decrease the diameter of triangle-free graphs | Article | |
| 1998 | Füredi, Z. and Ruszinkó, Miklós An improved upper bound the rate of Euclidean superimposed codes | Conference or Workshop Item | |
| 1997 | Szabady, B. and Ruszinkó, Miklós and Nyiredy, SZ Application of multiple development | Conference or Workshop Item | |
| 1997 | Ruszinkó, Miklós and Vanroose, P. How an Erdős-Rényi-type search approach gives explicit code construction of rate 1 for random access with multiplicity feedback | Article | |
| 1997 | Ahlswede, R. and Alon, N. and Erdős, PL and Ruszinkó, Miklós and Székely, L. Intersecting systems | Article | |
| 1997 | Ruszinkó, Miklós and Tardos, G. On a search problem in multidimensional grids | Article | |
| 1997 | Szabady, B. and Ruszinkó, Miklós and Nyiredy, SZ Prediction of retention data when using incremental multiple development techniques | Article | |
| 1997 | Alon, N. and Ruszinkó, Miklós Short certificates for tournaments | Article | |
| 1997 | Füredi, Z. and Ruszinkó, Miklós Superimposed codes are almost big distance ones | Conference or Workshop Item | |
| 1995 | Ruszinkó, Miklós On the equivalence of some different definitions of capacity of the multiple-access collision channel with multiplicity feedback | Conference or Workshop Item | |
| 1995 | Szabady, B. and Ruszinkó, Miklós and Nyiredy, SZ Prediction of retention data in multiple development. Part 1. Linearly increasing development distances | Article | |
| 1994 | Ruszinkó, Miklós On the upper bound of the size of the r-cover-free families | Article | |
| 1994 | Ruszinkó, Miklós and Vanroose, P. A constructive code reaching capacity 1 for the multiple-access collision channel with multiplicity feedback | Conference or Workshop Item | |
| 1993 | Ruszinkó, Miklós On a 2- and 3-dimensional search problem | Conference or Workshop Item | |
| 1993 | Ruszinkó, Miklós On a 2-dimensional search problem | Article | |
| 1991 | Ruszinkó, Miklós Coding methods for asynchronous multiple access communication channels without feedback | Conference or Workshop Item |
