#### Filter Results:

#### Publication Year

2012

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Anaël Grandjean
- Automata
- 2016

- Anaël Grandjean, Victor Poupet
- ICALP
- 2016

Linear acceleration theorems are known for most computational models. Although such results have been proved for two-dimensional cellular automata working on specific neighborhoods, no general construction was known. We present here a technique of linear acceleration for all two-dimensional languages recognized by cellular automata working on complete… (More)

- Anaël Grandjean, Victor Poupet
- STACS
- 2015

We study the influence of the dimension of cellular automata (CA) for real time language recognition of one-dimensional languages with parallel input. Specifically, we focus on the question of determining whether every language that can be recognized in real time on a 2-dimensional CA working on the Moore neighborhood can also be recognized in real time by… (More)

- Anaël Grandjean, Victor Poupet
- Automata
- 2015

A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected inner path that changes direction at most once. The 2-dimensional language representing such polyominoes has been recently proved to be recognizable by tiling systems by S. Brocchi, A. Frosini, R. Pinzani and S. Rinaldi. In an attempt to compare recognition power of… (More)

- Bruno Durand, Guilhem Gamard, Anaël Grandjean
- Theor. Comput. Sci.
- 2014

In this paper we present a construction of Kari-Culik aperiodic tile set — the smallest known until now. With the help of this construction, we prove that this tileset has positive entropy. We also explain why this result was not expected.

- Anaël Grandjean, Bora Uçar
- 2014 22nd Euromicro International Conference on…
- 2014

We investigate the problem of partitioning finite difference meshes in two dimensions among the processors of a parallel computer. The objective is to achieve a perfect load balance while minimizing the communication cost. There are well-known graph, hypergraph, and geometry-based partitioning algorithms for this problem. The known geometric algorithms have… (More)

- Anaël Grandjean, Johannes Langguth, Bora Uçar
- 2012 IEEE International Conference on Cluster…
- 2012

We investigate one dimensional partitioning of sparse matrices under a given ordering of the rows/columns. The partitioning constraint is to have load balance across processors when different parts are assigned to different processors. The load is defined as the number of rows, or columns, or the nonzeros assigned to a processor. The partitioning objective… (More)

- Anaël Grandjean, Gaétan Richard, Véronique Terrier
- AUTOMATA & JAC
- 2012

Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional… (More)

- ‹
- 1
- ›