Items where Author is "Ruszinkó, Miklós"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 48.

1991

DateAuthor/TitleDocument Type
1991Ruszinkó, Miklós
Coding methods for asynchronous multiple access communication channels without feedback
Conference or Workshop Item

1993

DateAuthor/TitleDocument Type
1993Ruszinkó, Miklós
On a 2- and 3-dimensional search problem
Conference or Workshop Item
1993Ruszinkó, Miklós
On a 2-dimensional search problem
Article

1994

DateAuthor/TitleDocument Type
1994Ruszinkó, Miklós
On the upper bound of the size of the r-cover-free families
Article
1994Ruszinkó, Miklós and Vanroose, P.
A constructive code reaching capacity 1 for the multiple-access collision channel with multiplicity feedback
Conference or Workshop Item

1995

DateAuthor/TitleDocument Type
1995Ruszinkó, Miklós
On the equivalence of some different definitions of capacity of the multiple-access collision channel with multiplicity feedback
Conference or Workshop Item
1995Szabady, B. and Ruszinkó, Miklós and Nyiredy, SZ
Prediction of retention data in multiple development. Part 1. Linearly increasing development distances
Article

1997

DateAuthor/TitleDocument Type
1997Szabady, B. and Ruszinkó, Miklós and Nyiredy, SZ
Application of multiple development
Conference or Workshop Item
1997Ruszinkó, 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
1997Ahlswede, R. and Alon, N. and Erdős, PL and Ruszinkó, Miklós and Székely, L.
Intersecting systems
Article
1997Ruszinkó, Miklós and Tardos, G.
On a search problem in multidimensional grids
Article
1997Szabady, B. and Ruszinkó, Miklós and Nyiredy, SZ
Prediction of retention data when using incremental multiple development techniques
Article
1997Alon, N. and Ruszinkó, Miklós
Short certificates for tournaments
Article
1997Füredi, Z. and Ruszinkó, Miklós
Superimposed codes are almost big distance ones
Conference or Workshop Item

1998

DateAuthor/TitleDocument Type
1998Erdős, P. and Gyárfás, András and Ruszinkó, Miklós
How to decrease the diameter of triangle-free graphs
Article
1998Füredi, Z. and Ruszinkó, Miklós
An improved upper bound the rate of Euclidean superimposed codes
Conference or Workshop Item

1999

DateAuthor/TitleDocument Type
1999Füredi, Z. and Ruszinkó, Miklós
An improved upper bound of the rate of Eucledian superimposed codes
Article

2000

DateAuthor/TitleDocument Type
2000Alon, N. and Gyárfás, András and Ruszinkó, Miklós
Decreasing the diameter of bounded degree graphs
Article
2000Bohman, T. and Ruszinkó, Miklós and Thoma, L.
Shannon capacity of large odd cycles
Conference or Workshop Item
2000Frieze, A. and Ruszinkó, Miklós and Thoma, L.
A note on random minimum length spanning trees
Article
2000Bohman, T. and Frieze, A. and Ruszinkó, Miklós and Thoma, L.
A note on sparse random graphs and cover graphs
Article

2001

DateAuthor/TitleDocument Type
2001Blokhuis, A. and Faudree, R. and Gyárfás, András and Ruszinkó, Miklós
Anti-Ramsey colorings in several rounds
Article
2001Bohman, T. and Frieze, A. and Ruszinkó, Miklós and Thoma, L.
G-intersecting families
Article
2001Bohman, T. and Frieze, A. and Ruszinkó, Miklós and Thoma, L.
Vertex covers by edge disjoint cliques
Article

2002

DateAuthor/TitleDocument Type
2002Füredi, Z. and Gyárfás, András and Ruszinkó, Miklós
On the maximum size of (p,Q)-free families
Article

2003

DateAuthor/TitleDocument Type
2003Bohman, T. and Cooper, C. and Frieze, A. and Martin, R. and Ruszinkó, Miklós
On randomly generated intersecting hypergraphs
Article

2004

DateAuthor/TitleDocument Type
2004Csűrös, M. and Ruszinkó, Miklós
Single user tracing superimposed codes
Conference or Workshop Item

2005

DateAuthor/TitleDocument Type
2005Frieze, A. and Martin, R. and Moncel, J. and Ruszinkó, Miklós and Smyth, C.
Identifying codes in random networks
Conference or Workshop Item
2005Csűrös, M. and Ruszinkó, Miklós
Single-user tracing and disjointly superimposed codes
Article

2006

DateAuthor/TitleDocument Type
2006Laczay, Bálint and Ruszinkó, Miklós
Multiple user tracing codes
Conference or Workshop Item
2006Gyá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
2006Ruszinkó, Miklós
Turán Systems
Book Section
2006Gyá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

2007

DateAuthor/TitleDocument Type
2007Frieze, Alan and Martin, Ryan and Moncel, Julien and Ruszinkó, Miklós and Smyth, Cliff
Codes identifying sets of vertices in random networks
ISI Article
2007Laczay, Bálint and Ruszinkó, Miklós
Collision channel with multiplicity feedback
Book Section
2007Danev, Danyo and Laczay, Bálint and Ruszinkó, Miklós
Multiple access Euclidean channel
Book Section
2007Danev, Danyo and Füredi, Zoltán and Ruszinkó, Miklós
Multiple access adder channel
Book Section
2007Bohman, Tom and Frieze, Alan and Martin, Ryan and Ruszinkó, Miklós and Smyth, Cliff
Randomly generated intersecting hypergraphs II
ISI Article
2007Gyá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
2007Gyá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

2008

DateAuthor/TitleDocument Type
2008Füredi, Zoltán and Ruszinkó, Miklós
Large convex cones in hypercubes
ISI Article
2008Gyá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

2010

DateAuthor/TitleDocument Type
2010-09-05Nemes, 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

2011

DateAuthor/TitleDocument Type
2011Gyá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
2011Gyá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

2012

DateAuthor/TitleDocument Type
2012Hiba, Antal and Nagy, Zoltán and Ruszinkó, Miklós
Memory access optimization for computations on unstructured meshes
Conference or Workshop Item

2014

DateAuthor/TitleDocument Type
2014Nagy, 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
2014Hiba, Antal and Nagy, Zoltán and Ruszinkó, Miklós and Szolgay, Péter
Data locality-based mesh partitioning methods for dataflow machines
Book Section
This list was generated on Fri Dec 27 03:09:31 2024 CET.