Clifford Bergman

Orcid: 0000-0002-1221-8459

According to our database1, Clifford Bergman authored at least 9 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Universal Algebraic Methods for Constraint Satisfaction Problems.
Log. Methods Comput. Sci., 2022

2011
An Automatic, Time-Based, Secure Pairing Protocol for Passive RFID.
Proceedings of the RFID. Security and Privacy - 7th International Workshop, 2011

2005
Unitary embedding for data hiding with the SVD.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VII, 2005

2002
Computational complexity of some problems involving congruences on algebras.
Theor. Comput. Sci., 2002

Computational Complexity of Generators and Nongenerators in Algebra.
Int. J. Algebra Comput., 2002

2000
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras.
SIAM J. Comput., 2000

1999
Computational Complexity of Term-Equivalence.
Int. J. Algebra Comput., 1999

Complexity of Some Problems in Universal Algebra.
Proceedings of the STACS 99, 1999

1998
Algorithms for Categorical Equivalence.
Math. Struct. Comput. Sci., 1998


  Loading...