default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Fine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Carolina A. M. Heming, Mohamed Abdalla, Monish Ahluwalia, Linglin Zhang, Hari Trivedi, Minjae Woo
, Benjamin Fine, Judy Wawira Gichoya, Leo Anthony Celi, Laleh Seyyed-Kalantari:
Benchmarking bias: Expanding clinical AI model card to incorporate bias reporting of social and non-social factors. CoRR abs/2311.12560 (2023)- 2021
- [j13]Benjamin Fine, Martin Kreuzer, Gerhard Rosenberger:
Further potential applications of group theory in information security. Int. J. Comput. Math. Comput. Syst. Theory 6(4): 375-380 (2021)
2010 – 2019
- 2018
- [j12]Benjamin Fine, Anthony M. Gaglione, Gerhard Rosenberger, Dennis Spellman:
Orderable groups, elementary theory, and the Kaplansky conjecture. Groups Complex. Cryptol. 10(1): 43-52 (2018) - 2016
- [c3]Chi Sing Chum, Benjamin Fine, Anja I. S. Moldenhauer, Gerhard Rosenberger, Xiaowen Zhang:
On secret sharing protocols. AMS-EMS-SPM Joint Meeting 2016 - [c2]Benjamin Fine, Gerhard Rosenberger:
i as a Quadratic Residue in the Gaussian Integers. Computational Models of Rationality 2016: 23-30 - 2014
- [j11]Benjamin Fine, Anthony M. Gaglione, Gerhard Rosenberger, Dennis Spellman:
Reflections on some aspects of infinite groups. Groups Complex. Cryptol. 6(2): 81-91 (2014) - 2013
- [j10]Benjamin Fine, Gerhard Rosenberger:
Faithful representations of limit groups II. Groups Complex. Cryptol. 5(1): 91-96 (2013) - [j9]Benjamin Fine, Anja I. S. Moldenhauer, Gerhard Rosenberger:
A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem. Groups Complex. Cryptol. 5(2): 223-238 (2013) - 2011
- [j8]Kenneth J. Falconer, Benjamin Fine, Delaram Kahrobaei:
Growth rate of an endomorphism of a group. Groups Complex. Cryptol. 3(2): 285-300 (2011) - [j7]Benjamin Fine, Gerhard Rosenberger:
A note on faithful representations of limit groups. Groups Complex. Cryptol. 3(2): 349-355 (2011) - [i1]Benjamin Fine, Maggie E. Habeeb, Delaram Kahrobaei, Gerhard Rosenberger:
Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems. CoRR abs/1103.4093 (2011) - 2010
- [j6]Gilbert Baumslag, Yegor Bryukhov, Benjamin Fine, Douglas Troeger:
Challenge response password security using combinatorial group theory. Groups Complex. Cryptol. 2(1): 67-81 (2010) - [j5]Celine Carstensen, Benjamin Fine, Gerhard Rosenberger:
On asymptotic densities and generic properties in finitely generated groups. Groups Complex. Cryptol. 2(2): 113-121 (2010)
2000 – 2009
- 2009
- [j4]Benjamin Fine, Alexei G. Myasnikov, Gerhard Rosenberger:
Generic Subgroups of Group Amalgams. Groups Complex. Cryptol. 1(1): 51-61 (2009) - [j3]Gilbert Baumslag, Benjamin Fine, Charles F. Miller III, Douglas Troeger:
Virtual Properties of cyclically pinched One-Relator Groups. Int. J. Algebra Comput. 19(2): 213-227 (2009) - [c1]Hoday Stearns, Benjamin Fine, Masayoshi Tomizuka:
Iterative Identification of Feedforward Controllers for Iterative Learning Control. SyRoCo 2009: 203-208 - 2006
- [j2]Gilbert Baumslag, Benjamin Fine, Xiaowei Xu:
Cryptosystems using Linear Groups. Appl. Algebra Eng. Commun. Comput. 17(3-4): 205-217 (2006)
1990 – 1999
- 1993
- [j1]Benjamin Fine, Dennis Spellman:
Counting Subgroups of the Hecke Groups. Int. J. Algebra Comput. 3(1): 43-50 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
