Codrin M. Nichitiu

According to our database, Codrin M. Nichitiu authored at least 9 papers between 1998 and 2004.

Collaborative distances:

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

2004

Leader election in plane cellular automata, only with left-right global convention.

Codrin M. Nichitiu, Christophe Papazian, Eric Rémila

Theor. Comput. Sci., 2004

A Monotonic On-Line Linear Algorithm for Hierarchical Agglomerative Classification.

Andreea B. Dragut, Codrin M. Nichitiu

Inf. Technol. Manag., 2004

2002

On the presence of periodic configurations in Turing machines and in counter machines.

Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu

Theor. Comput. Sci., 2002

Effective Simulations on Hyperbolic Networks.

Codrin M. Nichitiu, Eric Rémila

Fundam. Informaticae, 2002

2001

Algorithms for Leader Election by Cellular Automata.

Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila

J. Algorithms, 2001

On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.

Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu

Proceedings of the Machines, 2001

1999

Compass Permits Leader Election.

Jacques Mazoyer, Codrin M. Nichitiu, Eric Rémila

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Leader Election by d Dimensional Cellular Automata.

Codrin M. Nichitiu, Eric Rémila

Proceedings of the Automata, 1999

1998

A Polynominal Time Incremental Algorithm for Learning DFA.

Rajesh Parekh, Codrin M. Nichitiu, Vasant G. Honavar

Proceedings of the Grammatical Inference, 4th International Colloquium, 1998