default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert H. Gilman 0001
Person information
- affiliation: Stevens Institute of Technology, Department of Mathematical Sciences
Other persons with the same name
- Robert H. Gilman — disambiguation page
- Robert H. Gilman 0002 — Johns Hopkins University, Baltimore, Bloomberg School of Public Health
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j10]Robert H. Gilman, Robert P. Kropholler, Saul Schleimer:
Groups whose word problems are not semilinear. Groups Complex. Cryptol. 10(2): 53-62 (2018)- 2014
- [j9]Robert H. Gilman:
Generalized small cancellation presentations for automatic groups. Groups Complex. Cryptol. 6(2): 93-101 (2014) - 2011
- [j8]Robert H. Gilman, Alexei G. Myasnikov
, Vitalii Roman'kov:
Random equations in free groups. Groups Complex. Cryptol. 3(2): 257-284 (2011) - 2009
- [j7]Robert H. Gilman, Yuri Gurevich, Alexei D. Miasnikov:
A geometric zero-one law. J. Symb. Log. 74(3): 929-938 (2009) - 2002
- [j6]Martin R. Bridson, Robert H. Gilman:
Context-Free Languages of Sub-exponential Growth. J. Comput. Syst. Sci. 64(2): 308-310 (2002) - 1999
- [j5]Robert H. Gilman, Derek F. Holt, Sarah Rees:
Combing Nilpotent and Polycyclic Groups. Int. J. Algebra Comput. 9(2): 135-156 (1999) - 1996
- [j4]Robert H. Gilman:
A Shrinking Lemma for Indexed Languages. Theor. Comput. Sci. 163(1&2): 277-281 (1996) - 1993
- [j3]Martin R. Bridson, Robert H. Gilman:
A Remark about Combings of Groups. Int. J. Algebra Comput. 3(4): 575-582 (1993) - 1991
- [j2]Robert H. Gilman:
Verifying that a Group is Virtually Free. Int. J. Algebra Comput. 1(3): 339-352 (1991) - 1984
- [j1]Robert H. Gilman:
Characteristically Simple 0-Categorical Groups. J. Symb. Log. 49(3): 900-907 (1984)
Conference and Workshop Papers
- 1994
- [c3]Robert H. Gilman:
Formal languages and infinite groups. Geometric and Computational Perspectives on Infinite Groups 1994: 27-51 - 1993
- [c2]Robert H. Gilman:
Automatic Groups and String Rewriting. Term Rewriting 1993: 127-134 - 1984
- [c1]Robert H. Gilman:
Computations with Rational Subsets of Confluent Groups. EUROSAM 1984: 207-212
Editorship
- 1994
- [e1]Gilbert Baumslag, David B. A. Epstein, Robert H. Gilman, Hamish Short, Charles C. Sims:
Geometric and Computational Perspectives on Infinite Groups, Proceedings of a DIMACS Workshop, USA, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 25, DIMACS/AMS 1994, ISBN 978-0-8218-0449-0 [contents]
Informal and Other Publications
- 2007
- [i1]Robert H. Gilman, Alexei G. Myasnikov, Alex D. Myasnikov, Alexander Ushakov:
Report on Generic Case Complexity. CoRR abs/0707.1364 (2007)
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-11 17:30 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:
