25 citations to 10.1016/0196-6774(91)90011-M (Crossref Cited-By Service)
  1. Joan Birman, Ki Hyoung Ko, Sang Jin Lee, “A New Approach to the Word and Conjugacy Problems in the Braid Groups”, Advances in Mathematics, 139, no. 2, 1998, 322  crossref
  2. Iris Anshel, Derek Atkins, Dorian Goldfeld, Paul E. Gunnells, “WalnutDSA™: a group theoretic digital signature algorithm”, International Journal of Computer Mathematics: Computer Systems Theory, 6, no. 4, 2021, 260  crossref
  3. Volker Diekert, Jonathan Kausch, “Logspace computations in graph products”, Journal of Symbolic Computation, 75, 2016, 94  crossref
  4. JOAN S. BIRMAN, WILLIAM W. MENASCO, “A NOTE ON CLOSED 3-BRAIDS”, Commun. Contemp. Math., 10, no. supp01, 2008, 1033  crossref
  5. Ki Hyoung Ko, Sang Jin Lee, Jung Hee Cheon, Jae Woo Han, Ju-sung Kang, Choonsik Park, 1880, Advances in Cryptology — CRYPTO 2000, 2000, 166  crossref
  6. Natalia Mosina, Alexander Ushakov, “Strong law of large numbers on graphs and groups”, Groups – Complexity – Cryptology, 3, no. 1, 2011  crossref
  7. Matvei Kotov, Anton Menshov, Alexander Ushakov, “An attack on the Walnut digital signature algorithm”, Des. Codes Cryptogr., 87, no. 10, 2019, 2231  crossref
  8. Patrick Dehornoy, “Efficient solutions to the braid isotopy problem”, Discrete Applied Mathematics, 156, no. 16, 2008, 3091  crossref
  9. Joan S. Birman, Tara E. Brendle, Handbook of Knot Theory, 2005, 19  crossref
  10. Marko Budišić, Jean-Luc Thiffeault, “Finite-time braiding exponents”, Chaos: An Interdisciplinary Journal of Nonlinear Science, 25, no. 8, 2015, 087407  crossref
Previous
1
2
3
Next