Jean-Camille Birget

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 10

Top Topics

Positive Semi Definite

Digital Circuits

Symmetric Matrices

Top Venues

Int. J. Algebra Comput.

J. Appl. Probab.

Publications

Jean-Camille Birget
Some properties of Higman-Thompson monoids and digital circuits. CoRR (2024)
Jean-Camille Birget
On the complexity of the word problem of the R. Thompson group V. CoRR (2022)
Jean-Camille Birget, Alexey L. Talambutsa
The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups. Int. J. Algebra Comput. 32 (6) (2022)
Jean-Camille Birget, A. L. Talambutsa
The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups. CoRR (2021)
Jean-Camille Birget
Evaluation problems for the Thompson group and the Brin-Thompson group, and their relation to the word problem. CoRR (2021)
Jean-Camille Birget
The word problem of the Brin-Thompson groups is coNP-complete. CoRR (2019)
Jean-Camille Birget
Polynomial-time right-ideal morphisms and congruences. Int. J. Algebra Comput. 28 (5) (2018)
Jean-Camille Birget
Infinitely generated semigroups and polynomial complexity. Int. J. Algebra Comput. 26 (4) (2016)
Jean-Camille Birget
Infinitely generated semigroups and polynomial complexity. CoRR (2015)
Jean-Camille Birget
Semigroups and one-way functions. Int. J. Algebra Comput. 25 (1-2) (2015)
Dawei Hong, Shushuang Man, Jean-Camille Birget, Desmond S. Lun
A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm. J. Appl. Probab. 51 (1) (2014)
Jean-Camille Birget
Semigroups and one-way functions. CoRR (2013)
Jean-Camille Birget, Desmond S. Lun, Anthony Wirth, Dawei Hong
A theoretical approach to gene network identification. ITW (2012)
Jean-Camille Birget, Desmond S. Lun, Anthony Wirth, Dawei Hong
Identification of binary gene networks. Allerton Conference (2012)
Jean-Camille Birget
On the Circuit-Size of inverses. Int. J. Found. Comput. Sci. 22 (8) (2011)
Jean-Camille Birget
: The J-Order, The D-Relation, and their Complexity. Int. J. Algebra Comput. 21 (1-2) (2011)
Jean-Camille Birget
and their Complexity. Int. J. Algebra Comput. 20 (4) (2010)
Jean-Camille Birget
On the circuit-size of inverses CoRR (2009)
Jean-Camille Birget
Factorizations of the Thompson-higman Groups, and Circuit Complexity. Int. J. Algebra Comput. 18 (2) (2008)
Ahmet Emir Dirik, Nasir D. Memon, Jean-Camille Birget
Modeling user choice in the PassPoints graphical password scheme. SOUPS (2007)
Jean-Camille Birget, Dawei Hong, Nasir D. Memon
Graphical passwords based on robust discretization. IEEE Trans. Inf. Forensics Secur. 1 (3) (2006)
Jean-Camille Birget
Circuits, the Groups of Richard Thompson, and Conp-completeness. Int. J. Algebra Comput. 16 (1) (2006)
Susan Wiedenbeck, Jim Waters, Leonardo Sobrado, Jean-Camille Birget
Design and evaluation of a shoulder-surfing resistant graphical password scheme. AVI (2006)
Jean-Camille Birget, Spyros S. Magliveras, Michal Sramka
On public-key cryptosystems based on combinatorial group theory. IACR Cryptol. ePrint Arch. 2005 (2005)
Susan Wiedenbeck, Jim Waters, Jean-Camille Birget, Alex Brodskiy, Nasir D. Memon
PassPoints: Design and longitudinal evaluation of a graphical password system. Int. J. Hum. Comput. Stud. 63 (1-2) (2005)
Susan Wiedenbeck, Jim Waters, Jean-Camille Birget, Alex Brodskiy, Nasir D. Memon
Authentication using graphical passwords: effects of tolerance and image choice. SOUPS (2005)
Jean-Camille Birget
Functions on Groups and Computational Complexity. Int. J. Algebra Comput. 14 (4) (2004)
Jean-Camille Birget
The Groups of Richard Thompson and Complexity. Int. J. Algebra Comput. 14 (5-6) (2004)
Dawei Hong, Jean-Camille Birget, Shushuang Man
Probabilistic behavior of hash tables CoRR (2003)
Jean-Camille Birget, Dawei Hong, Nasir D. Memon
Robust discretization, with an application to graphical passwords. IACR Cryptol. ePrint Arch. 2003 (2003)
Dawei Hong, Jean-Camille Birget
Deviation bounds for wavelet shrinkage. IEEE Trans. Inf. Theory 49 (7) (2003)
Dawei Hong, Jean-Camille Birget
Approximation of some NP-hard optimization problems by finite machines, in probability. Theor. Comput. Sci. 259 (1-2) (2001)
Jean-Camille Birget, Xukai Zou, Guevara Noubir, Byrav Ramamurthy
Hierarchy-based access control in distributed environments. ICC (2001)
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
PSPACE-complete problems for subgroups of free groups and inverse finite automata. Theor. Comput. Sci. 242 (1-2) (2000)
Jean-Camille Birget
Reductions and functors from problems to word problems. Theor. Comput. Sci. 237 (1-2) (2000)
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin
On the Word Problem for Tensor Products and Amalgams of Monoids. Int. J. Algebra Comput. 9 (3-4) (1999)
Jean-Camille Birget
Infinite String Rewrite Systems and Complexity. J. Symb. Comput. 25 (6) (1998)
Jean-Camille Birget
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem. Int. J. Algebra Comput. 8 (2) (1998)
Dawei Hong, Jean-Camille Birget
Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines. RANDOM (1997)
Jean-Camille Birget
The State Complexity of \Sigma * L and its Connection with Temporal Logic. Inf. Process. Lett. 58 (4) (1996)
Jean-Camille Birget
Two-Way Automata and Length-Preserving Homomorphisms. Math. Syst. Theory 29 (3) (1996)
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. ICALP (1994)
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin
The Word Problem for Inverse Monoids Presented by One Idempotent Relator. Theor. Comput. Sci. 123 (2) (1994)
Jean-Camille Birget, Joseph B. Stephen
Formal Languages Defined by Uniform Substitutions. Theor. Comput. Sci. 132 (2) (1994)
Jean-Camille Birget
Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity. Theor. Comput. Sci. 119 (2) (1993)
Jean-Camille Birget
State-Complexity of Finite-State Devices, State Compressibility and Incompressibility. Math. Syst. Theory 26 (3) (1993)
Jean-Camille Birget
Positional Simulation of Two-Way Automata: Proof of a Conjecture of R. Kannan and Generalizations. J. Comput. Syst. Sci. 45 (2) (1992)
Jean-Camille Birget
Intersection and Union of Regular Languages and State Complexity. Inf. Process. Lett. 43 (4) (1992)
Jean-Camille Birget
Strict Local Testability of the Finite Control of Two-Way Automata and of Regular Picture Description Languages. Int. J. Algebra Comput. 1 (2) (1991)
Jean-Camille Birget
Intersection of Regular Languages and State Complexity. SIGACT News 22 (2) (1991)
David A. Klarner, Jean-Camille Birget, Wade Satterfield
On the Undecidability of the Freeness of Integer Matrix Semigroups. Int. J. Algebra Comput. 1 (2) (1991)
Jean-Camille Birget
Two-way automaton computations. RAIRO Theor. Informatics Appl. 24 (1990)
Jean-Camille Birget
Concatenation of Inputs in a Two-Way Automaton. Theor. Comput. Sci. 63 (2) (1989)
Jean-Camille Birget
Proof of a Conjecture of R. Kannan STOC (1989)
Jean-Camille Birget
Basic techniques for two-way finite automata. Formal Properties of Finite Automata and Applications (1988)