Robert H. Gilman

Professor of Mathematics
Director of the Algebraic Cryptography Center
Stevens Institute of Technology
Hoboken, NJ 07030

Phone (201) 216-5440, Fax (201) 216-8321

Curriculum Vitae

2 pages or 5 pages

Downloadable Publications

Generalized small cancellation presentations for automatic groups.
Groups, Complexity, Cryptology, to apear. arXiv .
Random equations in nilpotent groups.
J. Algebra 352 (2012) 192--214, with Alexei G. Myasnikov and Vitali Roman'kov. arXiv .
Random equations in free groups.
Groups Complex. Cryptol. 3 (2011) 257--284, with Alexei G. Myasnikov and Vitalii Roman'kov . abstract .
Exponentially generic subsets of groups.
Illinois J. Math. 54 (2010) 371--388, with Alexei G. Miasnikov and Denis Osin. arXiv .
A geometric zero-one law.
J. Symbolic Logic 74 (2009) 929--938, with Yuri Gurevich and Alexei G. Miasnikov. pdf.
Solving one-variable equations in free groups.
J. Group Theory 12 (2009) no. 2, 317--330, with Dimitri Bormotov and Alexei G. Myasnikov . pdf.
New developments in commutator key exchange.
Proc. First Int. Conf. on Symbolic Computation and Cryptography (SCC-2008), Beijing, 2008, with Alexei G. Miasnikov, Alexei D. Myasnikov, and Alexander Ushakov. pdf.
A characterisation of virtually free groups.
Arch. Math. (Basel) 89 (2007) 289--295, with Susan Hermiller, Derek Holt, and Sarah Rees . pdf.
Report on generic case complexity.
Herald of Omsk University, Special Issue, 2007, 103-110, with A. G. Miasnikov, A. D. Myasnikov, and A. Ushakov. pdf.
Automatic quotients of free groups.
J. Pure Appl. Algebra 202 (2005) 313--324.pdf .
Formal languages and their application to combinatorial group theory. Groups, languages, algorithms.
1--36, Contemp. Math., 378, Amer. Math. Soc., Providence, RI, 2005. pdf.
One variable equations in free groups via context free languages.
Computational and experimental group theory, 83--88, Contemp. Math., 349, Amer. Math. Soc., Providence, RI, 2004, with Alexei G. Myasnikov. pdf.
Word hyperbolic semigroups.
Math. Proc. Cambridge Philos. Soc. 136 (2004) 513--524, with Andrew Duncan . pdf.
On the definition of word hyperbolic groups.
Math. Z. 242 (2002) 529--541.pdf.
Context-free languages of sub-exponential growth.
J. Comput. System Sci. 64 (2002) 308--310, with Martin Bridson. pdf.
Web version of three talks on groups and formal languages.
On groups whose word problem is solved by a nested stack automaton.
Unpublished, with Michael Shapiro. pdf.
Combing nilpotent and polycyclic groups.
Internat. J. Algebra Comput. 9 (1999) 135--155, with Derek Holt and Sarah Rees. pdf.
Formal language theory and the geometry of 3-manifolds.
Comment. Math. Helv. 71 (1996) 525--555, with Martin Bridson. pdf.
A shrinking lemma for indexed languages.
Theoret. Comput. Sci. 163 (1996) 277--281. pdf.
Formal languages and infinite groups.
Geometric and computational perspectives on infinite groups (Minneapolis, MN and New Brunswick, NJ, 1994) 27--51, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 25, Amer. Math. Soc., Providence, RI, 1996. pdf.
Automatic groups and string rewriting.
Term rewriting (Font Romeux, 1993) 127--134, Lecture Notes in Comput. Sci., 909, Springer, Berlin, 1995. pdf.
On bounded languages and the geometry of nilpotent groups.
Combinatorial and geometric group theory (Edinburgh, 1993) 1--15, London Math. Soc. Lecture Note Ser., 204, Cambridge Univ. Press, Cambridge, 1995, with Martin Bridson. pdf .
The geometry of cycles in the Cayley diagram of a group.
The mathematical legacy of Wilhelm Magnus: groups, geometry and special functions (Brooklyn, NY, 1992) 331--340, Contemp. Math., 169, Amer. Math. Soc., Providence, RI, 1994. pdf.
A remark about combings of groups.
Internat. J. Algebra Comput. 3 (1993) 575--581, with Martin Bridson. pdf .

Other Links

Algebraic Cryptography Center
Stevens Institute of Technology
Department of Mathematical Sciences
Jane Gilman
Sarah Gilman
Timothy Gilman

Revised 09/2014