Codrut Grosu

According to our database, Codrut Grosu authored at least 8 papers between 2009 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Almost all trees are almost graceful.

Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký

Random Struct. Algorithms, July, 2020

2016

On the algebraic and topological structure of the set of Turán densities.

Codrut Grosu

J. Comb. Theory B, 2016

A New Lower Bound for the Towers of Hanoi Problem.

Codrut Grosu

Electron. J. Comb., 2016

2014

On the rank of higher inclusion matrices.

Codrut Grosu, Yury Person, Tibor Szabó

J. Lond. Math. Soc., 2014

픽_<i>p</i> is locally like ℂ.

Codrut Grosu

J. Lond. Math. Soc., 2014

2012

The extremal function for partial bipartite tilings.

Codrut Grosu, Jan Hladký

Eur. J. Comb., 2012

2011

Scalable Chord-Based, Cluster-Enhanced Peer-to-Peer Architecture Supporting Range Queries.

Codrut Grosu, Eliana-Dina Tirsa, Ciprian Dobre, Valentin Cristea, Mugurel Ionut Andreica

Proceedings of the 10th International Symposium on Parallel and Distributed Computing, 2011

2009

Disjoint Maximum-Sized Matchings: 11305 [2007, 640].

Vahan Mkrtchyan, Codrut Grosu

Am. Math. Mon., 2009