Name
Papers
Collaborators
MAURICE NIVAT
81
63
Citations 
PageRank 
Referers 
1261
277.74
1325
Referees 
References 
275
276
Search Limit
1001000
Title
Citations
PageRank
Year
The true story of TCS.00.342015
40th Anniversary of EATCS.10.382012
In Memoriam Attila Kuba (1953-2006)00.342008
Scanning integer matrices by means of two rectangular windows20.492008
Automata, tilings and tomography00.342008
Binary matrices under the microscope: A tomographical problem60.582007
An introduction to periodical discrete sets from a tomographical perspective70.662005
Salient and reentrant points of discrete sets161.262005
On The Palindromic Complexity Of Infinite Words462.692004
A bijection for the total area of parallelogram polyominoes10.372004
On a Tomographic Equivalence Between (0, 1)-Matrices30.472004
A codicity undecidable problem in the plane50.532003
Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections41.072003
Discrete Tomography: Reconstruction under Periodicity Constraints50.602002
The chords' problem41.512002
Reconstruction of Binary Matrices from Absorbed Projections61.562002
25 Years00.342001
Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays80.892001
Reconstruction of Discrete Sets from Three or More X-Rays30.702000
Medians of Discrete Sets according to a Linear Distance70.752000
Foundations of Software Science and Computation Structure, First International Conference, FoSSaCS'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings00.341998
Medians Of Polyominoes: A Property For Reconstruction232.111998
Foundations of Software Science and Computation Structure, First International Conference, FoSSaCS'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings181.811998
New Challenges for Theoretical Computer Science00.341997
Reconstructing Digital Sets from X-Rays00.341997
Reconstruction convex polyominoes from horizontal and vertical projections II152.191996
Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, Munich, Germany, July 1-5, 1996, Proceedings597.911996
Reconstructing convex polyominoes from horizontal and vertical projections958.711996
The number of convex polyominoes reconstructible from their orthogonal projections261.901996
Algebraic Methodology and Software Technology, 4th International Conference, AMAST '95, Montreal, Canada, July 3-7, 1995, Proceedings424.921995
Prefix and Period Languages of Rational omega-Languages10.401995
Tiling figures of the plane with two bars161.261995
Algebraic Methodology and Software Technology (AMAST '93), Proceedings of the Third International Conference on Methodology and Software Technology, University of Twente, Enschede, The Netherlands, 21-25 June, 19934610.671994
Efficient Parallel Shuffle Recognition51.381994
Ultimately Periodic Words of Rational w-Languages170.891993
Another variation on the common subexpression problem30.881993
The Effect of the Number of Successful Paths in a BüChi Tree Automaton.00.341993
Parallel Image Analysis, Second International Conference, ICPIA '92, Ube, Japan, December 21-23, 1992, Proceedings244.081992
Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching30.511992
A Parallel Algorithm for Recognizing the Shuffle of Two Strings00.341992
Algebraic Methodology and Software Technology (AMAST '91), Proceedings of the Second International Conference on Methodology and Software Technology, Iowa City, USA, 22-25 May 19913712.431992
A note about minimal non-deterministic automata252.881992
On Translating One Polyomino to Tile the Plane555.851991
About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions20.441991
Parallel Recognition of Two-Dimensional Images10.351991
Parallélisation d'algorithmes avec un nombre fixe de processeurs00.341990
Automata on infinite trees and Kleene closure of regular tree sets10.391988
CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings184.851988
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 19841817.111985
Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Germany, March 25-29, 1985, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85)258.611985
  • 1
  • 2