Robert Cori

Orcid: 0000-0001-9776-1196

According to our database1, Robert Cori authored at least 44 papers between 1972 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Special Issue dedicated to the memory of Pierre Rosenstiehl.
Eur. J. Comb., 2024

A few words about maps.
Eur. J. Comb., 2024

Spanning hypertrees, vertex tours and meanders.
Eur. J. Comb., 2024

2021
On doubly symmetric Dyck words.
Theor. Comput. Sci., 2021

2018
Counting Partitions of a Fixed Genus.
Electron. J. Comb., 2018

2017
On Sillke's bijection.
Theor. Comput. Sci., 2017

A Permutation on Words in a Two Letter Alphabet.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Some permutations on Dyck words.
Theor. Comput. Sci., 2016

Hall-Littlewood symmetric functions via the chip-firing game.
Eur. J. Comb., 2016

On Computation of Baker and Norine's Rank on Complete Graphs.
Electron. J. Comb., 2016

2013
Signed Chip Firing Games and symmetric Sandpile Models on the cycles.
RAIRO Theor. Informatics Appl., 2013

2012
Odd permutations are nicer than even ones.
Eur. J. Comb., 2012

On the Number of Indecomposable Permutations with a Given Number of Cycles.
Electron. J. Comb., 2012

2011
Monotone Triangles and 312 Pattern Avoidance.
Electron. J. Comb., 2011

2009
Indecomposable permutations, hypermaps and labeled Dyck paths.
J. Comb. Theory A, 2009

Hypermaps and indecomposable permutations.
Eur. J. Comb., 2009

2003
Description trees and Tutte formulas.
Theor. Comput. Sci., 2003

A Note on Linearizability and the Global Time Axiom.
Parallel Process. Lett., 2003

The sand-pile model and Tutte polynomials.
Adv. Appl. Math., 2003

2002
Polynomial ideals for sandpiles and their Gröbner bases.
Theor. Comput. Sci., 2002

Enumeration of (<i>p, q</i>)-parking functions .
Discret. Math., 2002

Foreword.
Discret. Math., 2002

2000
On the Sandpile Group of Dual Graphs.
Eur. J. Comb., 2000

1998
Counting Non-Isomorphic Chord Diagrams.
Theor. Comput. Sci., 1998

1997
Introduction à l'algorithmique des objets partagés.
RAIRO Theor. Informatics Appl., 1997

1994
On the Orbits of the Product of two Permutations.
Theor. Comput. Sci., 1994

Exotic Behaviour of Consensus Numbers.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

1993
Asynchronous Mappings and Asynchronous Cellular Automata
Inf. Comput., October, 1993

Some Combinatorial Aspects of Time-stamp Systems.
Eur. J. Comb., 1993

1991
On the Number of Partially Abelian Square-Free Words on a Three-Letter Alphabet.
Theor. Comput. Sci., 1991

1990
Partially Abelian squarefree words.
RAIRO Theor. Informatics Appl., 1990

1988
2-Asynchronous Automata.
Theor. Comput. Sci., 1988

Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1986
Shuffle of parenthesis systems and baxter permutations.
J. Comb. Theory A, 1986

Colourings of Planar Maps and the Equality of Two Languages.
Proceedings of the CAAP '86, 1986

1985
Recognizable Subsets of Some Partially Abelian Monoids.
Theor. Comput. Sci., 1985

Automates et Commutations Partielles.
RAIRO Theor. Informatics Appl., 1985

1982
Construction of Maps with Prescribed Automorphism Group.
Theor. Comput. Sci., 1982

Une Preuve Combinatiore de la Rationalité d'une Série Génératrice Associée aux Arbres.
RAIRO Theor. Informatics Appl., 1982

1981
On the Automorphism Group of a Planar Hypermap.
Eur. J. Comb., 1981

1973
Un code pour les graphes planaires et ses applications.
PhD thesis, 1973

1972
Enumeration des graphes planaires a l'aide des series formelles en variables non commutatives.
Discret. Math., 1972

Sur la rationalité de certaines séries génératrices.
Discret. Math., 1972

Sur des langages vérifiant des équations avec opérateur.
Proceedings of the Automata, 1972


  Loading...