Jean-Camille Birget

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