# Jean-Camille Birget

According to our database

Collaborative distances:

^{1}, Jean-Camille Birget authored at least 50 papers between 1988 and 2022.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2022

The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups.

Int. J. Algebra Comput., 2022

CoRR, 2022

2021

Evaluation problems for the Thompson group and the Brin-Thompson group, and their relation to the word problem.

CoRR, 2021

2019

CoRR, 2019

2018

Int. J. Algebra Comput., 2018

2016

Int. J. Algebra Comput., 2016

2015

Int. J. Algebra Comput., 2015

2014

A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm.

J. Appl. Probab., 2014

2012

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Int. J. Found. Comput. Sci., 2011

The Thompson-Higman Monoids M<sub>k, i</sub>: The J-Order, The D-Relation, and their Complexity.

Int. J. Algebra Comput., 2011

2010

The - and -Orders of the Thompson-Higman Monoid M<sub>k, 1</sub> and their Complexity.

Int. J. Algebra Comput., 2010

2008

Int. J. Algebra Comput., 2008

2007

Proceedings of the 3rd Symposium on Usable Privacy and Security, 2007

2006

IEEE Trans. Inf. Forensics Secur., 2006

Int. J. Algebra Comput., 2006

Proceedings of the working conference on Advanced visual interfaces, 2006

2005

Int. J. Hum. Comput. Stud., 2005

IACR Cryptol. ePrint Arch., 2005

Proceedings of the 1st Symposium on Usable Privacy and Security, 2005

2004

Int. J. Algebra Comput., 2004

Int. J. Algebra Comput., 2004

2003

IEEE Trans. Inf. Theory, 2003

IACR Cryptol. ePrint Arch., 2003

CoRR, 2003

2001

Approximation of some NP-hard optimization problems by finite machines, in probability.

Theor. Comput. Sci., 2001

Proceedings of the IEEE International Conference on Communications, 2001

2000

PSPACE-complete problems for subgroups of free groups and inverse finite automata.

Theor. Comput. Sci., 2000

Theor. Comput. Sci., 2000

1999

Int. J. Algebra Comput., 1999

1998

J. Symb. Comput., 1998

Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem.

Int. J. Algebra Comput., 1998

1997

Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines.

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

1996

Math. Syst. Theory, 1996

Inf. Process. Lett., 1996

1994

Theor. Comput. Sci., 1994

Theor. Comput. Sci., 1994

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups.

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity.

Theor. Comput. Sci., 1993

State-Complexity of Finite-State Devices, State Compressibility and Incompressibility.

Math. Syst. Theory, 1993

1992

Positional Simulation of Two-Way Automata: Proof of a Conjecture of R. Kannan and Generalizations.

J. Comput. Syst. Sci., 1992

Inf. Process. Lett., 1992

1991

SIGACT News, 1991

Int. J. Algebra Comput., 1991

Strict Local Testability of the Finite Control of Two-Way Automata and of Regular Picture Description Languages.

Int. J. Algebra Comput., 1991

1990

RAIRO Theor. Informatics Appl., 1990

1989

Theor. Comput. Sci., 1989

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

Proceedings of the Formal Properties of Finite Automata and Applications, 1988