Jean-Camille Birget

According to our database1, Jean-Camille Birget authored at least 50 papers between 1988 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 




The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups.
Int. J. Algebra Comput., 2022

On the complexity of the word problem of the R. Thompson group V.
CoRR, 2022

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

The word problem of the Brin-Thompson groups is coNP-complete.
CoRR, 2019

Polynomial-time right-ideal morphisms and congruences.
Int. J. Algebra Comput., 2018

Infinitely generated semigroups and polynomial complexity.
Int. J. Algebra Comput., 2016

Semigroups and one-way functions.
Int. J. Algebra Comput., 2015

A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm.
J. Appl. Probab., 2014

A theoretical approach to gene network identification.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Identification of binary gene networks.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

On the Circuit-Size of inverses.
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

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

Factorizations of the Thompson-higman Groups, and Circuit Complexity.
Int. J. Algebra Comput., 2008

Modeling user choice in the PassPoints graphical password scheme.
Proceedings of the 3rd Symposium on Usable Privacy and Security, 2007

Graphical passwords based on robust discretization.
IEEE Trans. Inf. Forensics Secur., 2006

Circuits, the Groups of Richard Thompson, and Conp-completeness.
Int. J. Algebra Comput., 2006

Design and evaluation of a shoulder-surfing resistant graphical password scheme.
Proceedings of the working conference on Advanced visual interfaces, 2006

PassPoints: Design and longitudinal evaluation of a graphical password system.
Int. J. Hum. Comput. Stud., 2005

On public-key cryptosystems based on combinatorial group theory.
IACR Cryptol. ePrint Arch., 2005

Authentication using graphical passwords: effects of tolerance and image choice.
Proceedings of the 1st Symposium on Usable Privacy and Security, 2005

The Groups of Richard Thompson and Complexity.
Int. J. Algebra Comput., 2004

Functions on Groups and Computational Complexity.
Int. J. Algebra Comput., 2004

Deviation bounds for wavelet shrinkage.
IEEE Trans. Inf. Theory, 2003

Robust discretization, with an application to graphical passwords.
IACR Cryptol. ePrint Arch., 2003

Probabilistic behavior of hash tables
CoRR, 2003

Approximation of some NP-hard optimization problems by finite machines, in probability.
Theor. Comput. Sci., 2001

Hierarchy-based access control in distributed environments.
Proceedings of the IEEE International Conference on Communications, 2001

PSPACE-complete problems for subgroups of free groups and inverse finite automata.
Theor. Comput. Sci., 2000

Reductions and functors from problems to word problems.
Theor. Comput. Sci., 2000

On the Word Problem for Tensor Products and Amalgams of Monoids.
Int. J. Algebra Comput., 1999

Infinite String Rewrite Systems and Complexity.
J. Symb. Comput., 1998

Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem.
Int. J. Algebra Comput., 1998

Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Two-Way Automata and Length-Preserving Homomorphisms.
Math. Syst. Theory, 1996

The State Complexity of \Sigma * L and its Connection with Temporal Logic.
Inf. Process. Lett., 1996

Formal Languages Defined by Uniform Substitutions.
Theor. Comput. Sci., 1994

The Word Problem for Inverse Monoids Presented by One Idempotent Relator.
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

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

Positional Simulation of Two-Way Automata: Proof of a Conjecture of R. Kannan and Generalizations.
J. Comput. Syst. Sci., 1992

Intersection and Union of Regular Languages and State Complexity.
Inf. Process. Lett., 1992

Intersection of Regular Languages and State Complexity.
SIGACT News, 1991

On the Undecidability of the Freeness of Integer Matrix Semigroups.
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

Two-way automaton computations.
RAIRO Theor. Informatics Appl., 1990

Concatenation of Inputs in a Two-Way Automaton.
Theor. Comput. Sci., 1989

Proof of a Conjecture of R. Kannan
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Basic techniques for two-way finite automata.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988