Jean-Camille Birget

According to our database¹, Jean-Camille Birget authored at least 51 papers between 1988 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Some properties of Higman-Thompson monoids and digital circuits.

[BibT_eX]

[DOI]

Jean-Camille Birget

CoRR, 2024

2022

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Alexey L. Talambutsa

Int. J. Algebra Comput., 2022

On the complexity of the word problem of the R. Thompson group V.

[BibT_eX]

[DOI]

Jean-Camille Birget

CoRR, 2022

2021

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

[BibT_eX]

[DOI]

Jean-Camille Birget

CoRR, 2021

2019

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

[BibT_eX]

[DOI]

Jean-Camille Birget

CoRR, 2019

2018

Polynomial-time right-ideal morphisms and congruences.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2018

2016

Infinitely generated semigroups and polynomial complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2016

2015

Semigroups and one-way functions.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2015

2014

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

[BibT_eX]

[DOI]

J. Appl. Probab., 2014

2012

A theoretical approach to gene network identification.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Identification of binary gene networks.

[BibT_eX]

[DOI]

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

2011

On the Circuit-Size of inverses.

[BibT_eX]

[DOI]

Jean-Camille Birget

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

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2011

2010

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2010

2008

Factorizations of the Thompson-higman Groups, and Circuit Complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2008

2007

Modeling user choice in the PassPoints graphical password scheme.

[BibT_eX]

[DOI]

Ahmet Emir Dirik

Nasir D. Memon

Jean-Camille Birget

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

2006

Graphical passwords based on robust discretization.

[BibT_eX]

[DOI]

Jean-Camille Birget

Dawei Hong

Nasir D. Memon

IEEE Trans. Inf. Forensics Secur., 2006

Circuits, the Groups of Richard Thompson, and Conp-completeness.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2006

Design and evaluation of a shoulder-surfing resistant graphical password scheme.

[BibT_eX]

[DOI]

Proceedings of the working conference on Advanced visual interfaces, 2006

2005

PassPoints: Design and longitudinal evaluation of a graphical password system.

[BibT_eX]

[DOI]

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

On public-key cryptosystems based on combinatorial group theory.

[BibT_eX]

[DOI]

Jean-Camille Birget

Spyros S. Magliveras

Michal Sramka

IACR Cryptol. ePrint Arch., 2005

Authentication using graphical passwords: effects of tolerance and image choice.

[BibT_eX]

[DOI]

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

2004

The Groups of Richard Thompson and Complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2004

Functions on Groups and Computational Complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 2004

2003

Deviation bounds for wavelet shrinkage.

[BibT_eX]

[DOI]

Dawei Hong

Jean-Camille Birget

IEEE Trans. Inf. Theory, 2003

Robust discretization, with an application to graphical passwords.

[BibT_eX]

[DOI]

Jean-Camille Birget

Dawei Hong

Nasir D. Memon

IACR Cryptol. ePrint Arch., 2003

Probabilistic behavior of hash tables

[BibT_eX]

[DOI]

Dawei Hong

Jean-Camille Birget

Shushuang Man

CoRR, 2003

2001

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

[BibT_eX]

[DOI]

Dawei Hong

Jean-Camille Birget

Theor. Comput. Sci., 2001

Hierarchy-based access control in distributed environments.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2001

2000

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Reductions and functors from problems to word problems.

[BibT_eX]

[DOI]

Jean-Camille Birget

Theor. Comput. Sci., 2000

1999

On the Word Problem for Tensor Products and Amalgams of Monoids.

[BibT_eX]

[DOI]

Jean-Camille Birget

Stuart W. Margolis

John C. Meakin

Int. J. Algebra Comput., 1999

1998

Infinite String Rewrite Systems and Complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

J. Symb. Comput., 1998

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 1998

1997

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

[BibT_eX]

[DOI]

Dawei Hong

Jean-Camille Birget

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

1996

Two-Way Automata and Length-Preserving Homomorphisms.

[BibT_eX]

[DOI]

Jean-Camille Birget

Math. Syst. Theory, 1996

The State Complexity of \Sigma * L and its Connection with Temporal Logic.

[BibT_eX]

[DOI]

Jean-Camille Birget

Inf. Process. Lett., 1996

1994

Formal Languages Defined by Uniform Substitutions.

[BibT_eX]

[DOI]

Jean-Camille Birget

Joseph B. Stephen

Theor. Comput. Sci., 1994

The Word Problem for Inverse Monoids Presented by One Idempotent Relator.

[BibT_eX]

[DOI]

Jean-Camille Birget

Stuart W. Margolis

John C. Meakin

Theor. Comput. Sci., 1994

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

[BibT_eX]

[DOI]

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

1993

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Theor. Comput. Sci., 1993

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Math. Syst. Theory, 1993

1992

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

[BibT_eX]

[DOI]

Jean-Camille Birget

J. Comput. Syst. Sci., 1992

Intersection and Union of Regular Languages and State Complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

Inf. Process. Lett., 1992

1991

Intersection of Regular Languages and State Complexity.

[BibT_eX]

[DOI]

Jean-Camille Birget

SIGACT News, 1991

On the Undecidability of the Freeness of Integer Matrix Semigroups.

[BibT_eX]

[DOI]

David A. Klarner

Jean-Camille Birget

Wade Satterfield

Int. J. Algebra Comput., 1991

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

[BibT_eX]

[DOI]

Jean-Camille Birget

Int. J. Algebra Comput., 1991

1990

Two-way automaton computations.

[BibT_eX]

[DOI]

Jean-Camille Birget

RAIRO Theor. Informatics Appl., 1990

1989

Concatenation of Inputs in a Two-Way Automaton.

[BibT_eX]

[DOI]

Jean-Camille Birget

Theor. Comput. Sci., 1989

Proof of a Conjecture of R. Kannan

[BibT_eX]

[DOI]

Jean-Camille Birget

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

1988

Basic techniques for two-way finite automata.

[BibT_eX]

[DOI]

Jean-Camille Birget

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

Jean-Camille Birget

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...