CURRICULUM VITAE. 1. Alexei Myasnikov

Transcription

1 CURRICULUM VITAE 1. Alexei Myasnikov 2. Canada Research Chair, Department of Mathematics, McGill University, Montreal. Doctoral Faculty, The Graduate Center of CUNY, New York. 3. HIGHER EDUCATION: Dr.Sc. in Mathematics (Habilitation): Model Theory Problems of Algebra, Novosibirsk State University, Russia, Ph.D. in Mathematics: Approximation of automorphism groups and elementary theories of nilpotent groups, Leningrad University, Leningrad, Russia, M.Sc. in Mathematics, Novosibirsk State University, Russia, EXPERIENCE: Doctoral Faculty, The Graduate Center of CUNY (1998-). Professor, The City College, CUNY ( ), Associate Professor, The City College, CUNY ( ), Visiting Professor, McGill University, Canada ( ), Full Professor, Omsk State University, Russia ( ), Associate Professor, Omsk State University, Russia ( ), Head of Laboratory of Applied Logic, Institute of Applied Mathematics of the Russian Academy of Sciences, Novosibirsk ( ) 5. ACADEMIC AND PROFESSIONAL HONORS: Gambrinus Award (Germany), Canada Research Chair Award (Canada), Performance Excellence Award (CUNY, New York), Fellowship from Paris VII University (Paris, France), AMS Fellowship, Russian Academy of Science Award (Russia),

2 Russian Fund of Fundamental Research Award (Russia), All-Russian Universities Fund Award (Russia), First Prize, Omsk Fund for Young Mathematicians, PUBLICATIONS (last 5 years only): 6.0 Books 1. Computational and Statistical Group Theory, Contemporary Mathematics, v. 298, 2002 (co-authored with R.Gilman, and V.Shpilrain). 2. Combinatorial and Geometric group Theory, Contemporary Mathematics, v. 296, 2002 (co-authored with S.Cleary, R.Gilman, and V.Shpilrain) 3. Computational and Experimental Group Theory, Contemporary Mathematics (co-authored with A.Borovik), Contemporary Math., v. 349, Group Theory, Statistics and Cryptography (co-authored with V.Shpilrain), Combinatorics over free groups, in preparation. 6. Algebraic geometry over free groups (co-authored with O. Kharlampovich), to appear in Algebnraic geometry over groups (joint with V.Remeslennikov), in preparation. 6.1 Published papers 1. G.Baumslag, A.Myasnikov, V.Remeslennikov. Algebraic geometry over groups I. Algebraic sets and ideal theory. Journal of Algebra, 1999, v.219, pp O.Kharlampovich, E. Lyutikova, A. Myasnikov. Equations over Q- completions of hyperbolic groups. Transactions of Math.,

3 3. G.Baumslag, A.G.Myasnikov, V. Shpilrain, Open problems in combinatorial group theory. In: Groups, Languages and Geometry. Amer. Math. Soc., Contemporary Math. 250, 1999, pp G.Baumslag, A.Myasnikov, V.Remeslennikov. Malnormality is decidable in free groups. Intern. Journal of Algebra and Computation, v.9, 6, K.Bencsath, B.Fine, A.Gaglione, A.Myasnikov, G.Rosenberger, D.Spellman. Aspects of the theory of free groups. Algorithmic problems in groups and semigroups, Birkhauser, Trends in Math., Boston, Basel, Berlin, pp G.Baumslag, A.Myasnikov, V.Remeslennikov. Algebraic geometry over groups. Algorithmic problems in groups and semigroups, Birkhauser, Trends in Math., Boston, Basel, Berlin, 2000, pp S.Lioutikov and A.Myasnikov. Centroids of groups Journal of Group Theory, v.3, iss.2 (2000), pp A.Myasnikov, V.Remeslennikov. Algebraic geometry 2: logical foundations. Journal of Algebra 234 (2000), p G.Baumslag, A.Myasnikov, V.Remeslennikov. Discriminating and codiscriminating groups. J. of Group Theory, v. 3, no. 4 (2000), p A.D.Miasnikov and A.G.Myasnikov. Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture, Groups and Computation III, Walter de Gruyter, Berlin New York, 2001, p A.Borovik, A.Myasnikov, V.Shpilrain Measuring sets in infinite groups, Manchester Centre for Pure Mathematics, 2001, no. 15, 20 pp. (ISSN ). 12. O.Kharlampovich, A. Myasnikov. Implicit function theorem over free groups and genus problem. AMS/IP Studies in Advanced Mathematics, v.24, 2001, pp

4 13. B.Fine, A.M.Gaglione, A.Myasnikov, D.Spellman. Discriminating groups, J. of Group Theory 4 (2001), pp I.Kapovich and A.Myasnikov Stallings foldings and subgroups of free groups. Journal of Algebra, 248 (2002), pp A.D. Miasnikov, A. G. Myasnikov, V. Shpilrain On the Andrews-Curtis equivalence, In: Combinatorial and Geometric Group Theory. Amer. Math. Soc., Contemp. Math., 296, (2002), pp G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory. Second edition. In: Combinatorial and Geometric Group Theory. Amer. Math. Soc., Contemporary Math. 296 (2002), pp A. Borovik, A. Myasnikov, V. Shpilrain Measuring sets in infinite groups. In: Computational and Statistical Group Theory. Amer. Math. Soc., Contemporary Math. 298 (2002), pp G. Baumslag, A. Myasnikov, V. Remeslennikov. Discriminating completions of hyperbolic groups, Geometriae Dedicata (2003), Vol 92, pp I.Kapovich, A.Myasnikov, P.Schupp, V.Shpilrain Generic-case complexity and decision problems in group theory J. of Algebra, 264 (2003), pp A.Myasnikov, V.Shpilrain Automorphic orbits in free groups, J. of Algebra Volume, 269 (2003),Issue 1, pp A. V. Borovik, E. I. Khukhro and A. G. Myasnikov The Andrews-Curtis Conjecture and Black Box Groups, Int. J. of Algebra and Computation, v.13, n.4 (2003), p A. Borovik, A. Myasnikov, V. Remeslennikov Multiplicative measures on free groups, International Journal of Algebra and Computation, v.13, n.6 (2003), p B. Fine, A. Gaglione, A. Myasnikov, D. Spellman Elementary theory of free groups, Proceedings of Int. Conf on Combinatorial group theory, Oxford,

5 24. R.Gilman and A.Myasnikov One Variable Equations in Free Groups via Context Free Languages, Contemporary Mathematics, v. 349, 2004, p A.Myasnikov and P. Shumyatsky Discriminating groups and c-dimension, Journal of Group Theory, Volume 7, Issue 1 (2004), p Alexei D. Miasnikov, Alexei G. Myasnikov Whitehead method and Genetic Algorithms, Contemporary Mathematics, Contemporary Mathematics, v. 349, 2004, p Robert M. Haralick, Alexei D. Miasnikov, Alexei G. Myasnikov Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups, Contemporary Mathematics, v. 349, 2004, p O. Kharlampovich, A.Myasnikov, V. Remeslennikov, D. Serbin Subgroups of fully residually free groups: algorithmic problems, Contemp. Math. series of the AMS, Group theory, Statistics and Cryptography, 360 (2004). 29. I.Kapovich, A.Myasnikov, P.Schupp, V.Shpilrain Average-case complexity and decision problems in group theory. Advances in Mathematics 190 (2005), no. 2, pp Ilya Kapovich, Alexei Myasnikov, Richard Weidmann Foldings, graphs of groups and the membership problem, Int. J. of Algebra and Computation, Vol. 15, No. 1 (2005), p A. Kvaschuk, A. Myasnikov, V.Remeslennikov Algebraic geometry over groups III: Elements of model theory. Journal of Algebra, Vol. 288, Issue 1, 1 (2005), p O.Kharlampovich, A. Myasnikov. Implicit function theorems over free groups. Journal of Algebra, 290/1 (2005), p O. Kharlampovich, A. Myasnikov, Algebraic geometry over free groups: lifting solutions into generic points, Contemp.Math. AMS, Algorithms, Languages, Logic (Borovik, ed.), CONM/ 378, 2005,

6 34. A.Myasnikov, V.Remeslennikov, D.Serbin, Regular free length functions on Lyndon s free Z[t]-group F Z[t], Contemp.Math. AMS, Algorithms, Languages, Logic (Borovik, ed.), CONM/ 378, 2005, O.Kharlampovich and A.Myasnikov Effective JSJ decompositions, Contemp.Math. AMS, Algorithms,Languages, Logic (Borovik, ed.), CONM/ 378, 2005, p Robert M. Haralick, Alexei D. Miasnikov, Alexei G. Myasnikov, Pattern Recognition and Minimal Words in Free Groups of Rank 2. Journal of Group Theory, v.8, n.4,. 6.2 Accepted for publication 1. B.Fine, A.M.Gaglione, A.Myasnikov, D.Spellman. Groups Whose Universal Theory is Axiomatizable by Quasi-Identities, to appear in J. of Group Theory. 2. A. Kvaschuk, A. Myasnikov, Big powers and free constructions, to appear in International Journal of Algebra and Computation. 3. A. V. Borovik, A. G. Myasnikov and V. N. Remeslennikov, Conjugacy problem in HNN-extensions of groups, to appear in Contemporary Mathematics. 4. A. V. Borovik, A. G. Myasnikov and V. N. Remeslennikov, Complexity of the conjugacy problem in amalgamated products of free groups, to appear in Contemporary Mathematics. 5. A.Borovik, A. Lubotzky, A.Myasnikov Finitary Andrews-Curtis conjecture. 6. A.Myasnikov, V.Remeslennikov, D.Serbin Finite automata and fully residually free groups, International Journal of Algebra and computation. 7. Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov A practical attack on some braid group based cryptographic protocols 6

7 2. PUBLICATIONS (other than the last five years): 1. Myasnikov A. On the approximability of groups of outer automorphisms of free groups of finite rank. Algebra and Logic, 1981, v.20, 3, p Myasnikov A., Remeslennikov V. Isomorphism and elementary properties of powered nilpotent groups. Proc.Math.Institute, v.2, Nauka, Novosibirsk, 1981, p Myasnikov A., Remeslennikov V. Elementary properties of powered nilpotent groups. Doklady Akademii Nayuk, 1981,v. 258, 5, p Myasnikov A., Remeslennikov V. Definability of Mal cev bases. Proc. of 16 Soviet Union algebraic conference, v.1, 1981, Leningrad, p Myasnikov A., Remeslennikov V., Definability of Mal cev bases and elementary properties of finite dimensional algebras.i, Siberian Jour. Math., 1982, v.23, 5, p Myasnikov A., Remeslennikov V. Definability of Mal cev bases and elementary theories of finite dimensional algebras.ii, Siberian Jour. Math., 1983, v.24, 2, p Myasnikov A. Complete theories of nilpotent groups. In: VIII Soviet Union conf. on group theory, Sumy, Myasnikov A. Elementary equivalence of finitely generated nilpotent groups. In: IX Soviet Union conference on group theory, Moscow, Myasnikov A. Finite-dimensional algebras and k-groups of finite rank. Contemp Math., 1984, v.33, p Myasnikov A. Generalized Nielsen transformations and trivial groups. Math. Notes, 1984, v.5, 4, p

8 11. Myasnikov A. Stable torsion-free rings and nilpotent groups. In: VII Soviet Union conf. on math. logic, Novosibirsk, Myasnikov A., Remeslennikov V. Elementary group equivalence with the integral length function. Illinois J.Math., 20,1986, v.30, Myasnikov A., Remeslennikov V. Elementary equivalence of free products of groups with a length function. Proc.Academy of Science USSR, Novosibirsk, 1987, v.718. p Myasnikov A. Free operator groups with length function and finitely generated group of operators. In: Computable invariants of algebraic structures.novosibirsk, 1987, p Myasnikov A. Abstract isomorphisms and elementary theories of finite dimensional algebras and unipotent groups. Doklady Akademii Nauk USSR, 1987, v.297, 2, p Myasnikov A., Remeslennikov V. Recursive p-adic numbers and elementary theories of finitely generated pro-p-groups. Izvest. Akademii Nauk USSR, ser.math 1988, v.30, Myasnikov A., Remeslennikov V. Admissible sets in group theory. Preprint 803 Novosibirsk, Academy of Sciense, Myasnikov A. Structure of models and criteria of decidability of complete theories of finite-dimensional algebras. Izvest. Akademii Nayk USSR, ser. math., 1989, v.53,2, p Myasnikov A. Modules over local ring. Siberian Jour. Math., 1989, v.30,3, p Myasnikov A. Remeslennikov V. Model-theoretical problems in group theory. In: Problems of Algebra, 1989, Minsk, v Myasnikov A. Invariants of bilinear mappings. Siberian Jour. Math., 1990, v.31,1, p Myasnikov A. Model theory of bilinear mappings. Siberian Jour. Math., 1990, v.31,3, p

9 23. Myasnikov A.,Remeslennikov V. Logic of finite types in group theory. Bull. Siberian Math Soc., Novosibirsk, 1990, p Myasnikov A. On elementary equivalence of modules in two-sorted language. In: X Soviet Union Conf.on math. logic, Alma-Ata, Myasnikov A., Remeslennikov V. Weak second order logic in group theory. Contemp. Math., 1992(part 2), v.131, p Myasnikov A., Remeslennikov V. Admissible sets in group theory. Algebra i logic, 1992,v Myasnikov A.G. Model theoretic problems of algebra. Dissertation, VINITI, Moscow, Myasnikov A. Algorithmic problems over pro-p-groups. Proc. Institute of Applied math., Russian Academy Science, Omsk, Myasnikov A., Remeslennikov V. Exponential groups.i: foundations of the theory and tensor completions, Proc. Inst. Appl. Math., Russian Acad. Sci.,v.9, Omsk, Myasnikov A. Uniformal coordinatization and linearization of nilpotent groups over principal integral domains. Proc. Inst. Appl. Math. Russian Academy of science, Myasnikov A., Belyaev V. Recursively enumerable degrees over the reals. In Proc. of Intern. Algebraic Conf., Krasnoyarsk, Ashaev I., Belyaev V., Myasnikov A. Approaches to the theory of computability. Algebra i Logic, 1994, v Myasnikov A.G., Remeslennikov V.N. Exponential groups I: foundations of the theory and tensor completion. Siberian Math. J., 1994, v.35, N. 5, p Myasnikov A.G., Remeslennikov V.N. Exponential groups: iterated tree extensions of centralizers. Omsk University, N18, Omsk, 1994, p

10 35. G.Baumslag, A. Myasnikov, V. Remeslennikov. Residually hyperbolic groups. Proc. Inst. Appl. Math. Russian Acad. Sci., 1995, 24, p O.Kharlampovich, A. Myasnikov and V. Remeslennikov. Logical languages and axioms for groups with a length function. Proc. Inst. Appl. Math. Russian Acad. Sci., 1995, 20, p D. Gildenhuys, O. Kharlampovich and A. Myasnikov. CSA groups and separated free constructions. Bull. Austr. Math. Soc., 1995, v. 52, 1, p Myasnikov A.G., Remeslennikov V.N. Length functions on free exponential groups. Proc. of Intern. Conference Groups in Analysis and Geometry, Omsk, 1995, p A.G.Myasnikov, V.N.Remeslennikov. Length functions on free exponential groups. Proc. N 26. IITPM SO RAN, Omsk, 1996, A.G.Myasnikov, V.N.Remeslennikov Exponential groups. Proc. N 27, IITPM SO RAN, Omsk, 1996, p A. Myasnikov and V. Remeslennikov. Exponential groups 2: extension of centralizers and tensor completion of CSA-groups. Intern. Journal of Algebra and Computation, Vol.6, No.6 (1996), p A.M. Gaglione, A.G. Myasnikov, V.N. Remeslennikov, D. Spellman. Formal Power Series Representations of Free Exponential Groups. Communications in Algebra, 1997, v. 25(2), p G.Baumslag, A.Myasnikov, V.Romankov. Two theorems about equationally Noetherian groups. Journal of Algebra, 1997, 194, p O. Kharlampovich and A. Myasnikov. Hyperbolic groups and free constructions. Transactions of Math., 350(1998), 2, pp O.Kharlampovich, A. Myasnikov. Equations in a free Q-group. Transactions of Math., 350(1998), 3, pp O.Kharlampovich, A.Myasnikov. Irreducible affine varieties over a free group. I: Irreducibility of quadratic equations and Nullstellensatz. J. of Algebra, 1998, v. 200, n. 2, p

11 47. O.Kharlampovich, A.Myasnikov. Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups. J. of Algebra, 1998,v. 200, n. 2, p A.Gaglione, B.Fine, A.Myasnikov, G.Rosenberger, D.Spellman. A classification of fully residually free groups of rank three or less. Journal of Algebra, 1998, v. 200, n. 2, p O.Kharlampovich, A.Myasnikov. Description of Fully Residually Free Groups and irreducible affine varieties over a free group. CRM Proceedings and Lecture Notes, 1998, v. 17, p G.Baumslag, A.Myasnikov, V.Remeslennikov. Dimensions and coordinate groups for a product of irreducible algebraic sets. In Combinatorial and computational methods in mathematics. Omsk, 1998, p CURRENT SCHOLARY AND/OR RESEARCH ACTIVITIES: 3.1 Articles Submitted: 1. Belyaev V., Myasnikov A. Theorems on hierarchy in generalized recursion theory. 2. A.D. Miasnikov, A.G. Myasnikov and R.M Haralick Heuristics for Whitehead Minimization Problem. 3. O.Kharlampovich, A. Myasnikov. Elementary theory of free groups. The Tarski problem. 4. T.Jitsukawa, B.Khan, A.Myasnikov On the Hanna Newmann Conjecture. 5. A. Kvaschuk, A. Myasnikov One variable equations over hyperbolic groups. 6. O.Kharlampovich, A.Myasnikov, V.Remeslennikov, D.Serbin G-constructible groups. 11

12 7. I.Bumagin, O.Kharlampovich, A.Myasnikov Isomorphism problem for finitely generated fully residually free groups. 8. Martin Kreuzer, Alexei Myasnikov, Gerhard Rosenberger, Alexander Ushakov Quotient Tests and Gröbner Bases. 9. Alexandre V. Borovik and Alexei G. Myasnikov Quotient tests and random walks in computational group theory 10. Joel David Hamkins, Alexei Myasnikov The halting problem is almost always decidable. 11. B Khan, A.Myasnikov, D.Serbin On positive theories of groups with regular free length functions, 3.2 Articles in Preparation: 1. Myasnikov A. Characterization of regular finitely generated nilpotent groups by one formula. 2. Myasnikov A. Unipotent k-groups with decidable elementary theory. 3. O.Kharlampovich, A. Myasnikov, V. Remeslennikov. Approximation of constructible groups by hyperbolic groups. 4. O. Kharlampovich, A.Myasnikov. Dimensions of algebraic varieties over groups. 5. O. Kharlampovich, A.Myasnikov, Serbin Diophantine problem for fully residually free groups. 6. G.Baumslag, A.Myasnikov, V.Remeslennikov. Automatic one-relator groups: Semisplittable case. 7. A.Myasnikov, V.Remeslennikov. Algebraic geometry 4: extensions. 8. Alexei Myasnikov and Alexander Ushakov On Conjugacy Problem for Groups with One Defining Relation 12

13 9. Bilal Khan, Alexei Myasnikov and Denis Serbin On positive theories of fully residually free groups 10. Alexei Myasnikov and Alexander Ushakov Random van Kampen diagrams and algorithmic problems in groups 11. A. Kvaschuk, A. Myasnikov, D.Serbin Hyperbolic length functions 12. A. Borovik, A. Myasnikov Genetic algorithms in group theory 13. A. Kvaschuk, A. Myasnikov, V.Remeslennikov A resolution method and parametric solutions of one-variable equations over groups, Contemporary Mathematics. 14. R.Gilman, A. Myasnikov One-variable equations in torsion-free hyperbolic groups 15. R.Gilman, A.Myasnikov, D.Bormotov One-variable equations in free groups. 3.3 Invited Addresses: International Conference on asymptotic and geometric group theory (Banff, June 2005), Group cryptography: myths and reality. LMS Conference (Newcastle, June 2005), Random van Kampen diagrams and generic complexity of algorithmic problems. Stevens Computer Science Seminar (March, 2005), Algerbaic Cryptography and complexity of computations. McGill Group Theory Seminar (Montreal, February 2005) Random van Kampen diagrams and algorithmic problems in groups. Ottawa Mathematical Colloquium, (Ottawa, January 2005), Algerbaic Cryptography: generic complexity and black holes. Annual Meeting of Canadian Mathematical Society, Public Lecture (Montreal, December 2004), Complexity of computations and cryptography. Microsoft Research (Redmond,WA, November 2004) Complexity of computations and cryptography. 13

14 Gambrinus Award Lecture (Dortmund, Germany, July 2004) Cryptography: past and future. Workshop on Geometric Group Theory, London Math. Soc. (Newcastle, June-July 2004) Fully residually free groups and equations in groups. International Conference Geometric Group Theory, Random Walks, and harmonic analysis (Cortona, Italy, June 2004), Random van Kampen diagrams and algorithmic problems in groups. International Algebraic Conference, Moscow University (May 2004), Fully residually free groups MIT Combinatorics Seminar (May, 2004) Random van Kampen Diagrams. Columbia University, Geometric Topology Seminar (April 2004), Random van Kampen diagrams and algorithmic problems in groups. Algebra Seminar (Temple University, Philadelphia, April, 2004) Algorithmic problems in fully residually free groups. Temple University Colloquium (Philadelphia, April, 2004) A new approach to algorithmic problems in groups: stratification, randomization, and black holes. AMS Meeting, Probabilistic and Asymptotic Group Theory, (Athens, Ohio, March, 2004), Random van Kampen diagrams and algorithmic problems in groups. New York Group Theory Seminar (New York, March 2004), New approach to algorithmic problems in groups. Workshop on Algebraic Methods in Cryptography (Dortmund, Germany, March 2004) Complexity of algorithmic problems in groups Ottawa Algebraic Seminar (Ottawa, Canada, November 2003) The finitary Andrews-Curtis conjecture Montreal Group Theory Seminar (Montreal, Canada) The Finitary Andrews- Curtis Conjecture Albany Group Theory Conference (Albany, NY, October, 2003) Random van Kampen diagrams and algorithmic problems in groups AMS Session on Infinite groups (Binghampton, October 2003) Finitary Andrews-Curtis conjecture. 14

15 GEOMETRIC METHODS IN GROUP THEORY (Seville, Spain, June 2003) Groups acting on trees and infinite words International Conference on Group Theory (Gaeta, Italy, June, 2003) One-variable equations over hyperbolic groups Profinite groups and Discrete Subgroups of Lie groups (Obervolfach, Germany, May, 2003) Finitary Andrews-Curtis conjecture. MIT Combinatorics Seminar (Cambridge, May 2003) PThe Andrews- Curtis Conjecture NY Probability Seminar (Graduate Center of CUNY, May 2003) Probabilistic algorithms in group theory. Combinatorial and Statistical Group Theory, Special session of AMS meeting ( NYU-Courant Institute, April 12-13, 2003) Conjugacy problem in amalgamated products and HNN extensions International Conference on Groups and Computation (Columbus, Ohio, March 2003) The Finitary Andrews-Curtis Conjecture. Joint AMS-ASL annual meeting (Baltimore, January 2003) Actions of groups and infinite words Montreal Mathematical Colloquium (Montreal, October 2003) Computer science methods in mathematics. Discrete mathematics seminar (McGill University, Montreal, September 2003) Data mining in solving hard mathematical problems International Workshop On elementary theories of free groups (Montreal, August, 2002) Mini course Implicit function theorem. International Conference on Semigroups and Groups in Honor of the 65 th Birthday of John Rodes (Porto, Portugal, June 2002) Finite automata and algebraic extensions of free groups. International Conference on Modern Algebra (Vanderbilt University, May, 2002) On elementary theories of free groups. Combinatorial and Statistical Algebra (CUNY, New York, April 2002) Generic-case complexity and quotient tests. Algebra Seminar (Temple University, Philadelphia, March 2002) Pregroups, length functions, and infinite words. Temple University Colloquium (Philadelphia, March, 2002) Andrews- Curtis conjecture and black box groups. 15

16 Algebra Seminar (Vanderbilt University, March, 2002) On Andrews-Curtis conjecture. Algebra seminar (Yale University, February 2002), Andrews-Curtis graphs of groups. NY Group Theory Seminar (New York, October 2001), Andrews-Curtis graphs and black box groups. Geometric Group Theory Conference (Montreal, Canada, July 2001), Lifting equations into generic points. Invited address at AMS Meeting, (Hoboken, NJ, Stevens Inst., April 2001) On Tarski s Problems. Series of four lectures at joint Group Theory and model Theory Seminar (Urbana-Champaign, April 2001) Elementary theory of free groups. Algebra day (Carleton University, Ottawa, April 2001) Finite automata and algebraic extensins of free groups. Invited lecturer (Mathematical Institute, Montreal, Canada, March 2001) Equations over free groups. Workshop Probabilistic Methods in Groups (New York, December 2000) Heuristic algorithms and probability measures on free groups. International Conference on Algebraic Combinatorics (Russia, Moscow, June 2000) Graphs and groups. International Conference XVI Escola de Algebra (Brasilia, July 2000) Algorithmic problems in free groups. Meeting of the Canadian Mathematical Society (Toronto, June 2000) Logical Foundations of Algebraic Geometry over Groups International Conference on Geometric and Combinatorial Methods in Group Theory and Semigroup Theory (Nebraska, Lincoln, May 2000) On Tarski problems. Workshop on combinatorial algebra (New York, April 2000), Reflections on implicit function theorems over groups. NY Group Theory Seminar (February 2000), Exploiting links between the algebraic geometry over groups and logic. Genetic Algebra Day at CCNY (December 1999), If you don t know what to do - try genetic algorithms. CUNY Logic Workshop (December 1999), Around Tarski problem. 16

17 NY Group Theory Seminar (October 1999), Discriminating and co-discriminating groups. International conference on near-rings (Edinburgh, Scotland, July 1999) Centroids of nilpotent groups. Symposium on Computation in Group Theory and Geometry (University of Warwick, Coventry, England, July 9-17) Computation in Free Groups. Groups and Computation (Columbus, Ohio, June 1999) Genetic algorithms and groups. International Conference on Combinatorial and Computational Algebra (Hong Kong, May 1999) Methods of Algebraic geometry over groups. East Coast Computer Algebra Day (Raleigh, April 1999) Non-deterministic algorithms in Algebra. MidAtlantic Mathematical Logic Seminar (Rutgers, November 1998) Implicit function theorems over free groups. Albany Group Theory Conference (Albany, October, 1998) Magnus presentation. The Fourth International IMACS Conference on Applications of Computer Algebra (Prague, August 1998), Genetic algorithms in groups theory. Joint Summer Research Conference on Geometric Group Theory and Computer Science (Massachusets, July 1998), Elementary Theory of free groups. Workshop in Model Theory of Fields (Berkeley, June 1998) On Tarski Problem. ASL Annual Meeting (Toronto, May 1998) Elementary Theory of a Free Group. International Conference on Algorithmic Problems in Groups and Semigroups (Nebraska-Lincoln, May 1998) Exponential groups. Group Theory Day at US Naval Academy (Annapolis, November, 1997) Algorithmic problems over free groups, just how complicated are they?. Albany Group Theory Conference (Albany, October, 1997) Definable sets in free groups. Montreal Mathematical Colloquium (Montreal, October, 1997) Algebraic geometry and groups. 17

18 New York Group Theory Seminar (New York, October, 1997), Centroids of groups and rigidity problem. Symposium on Pro-p Groups and related topics (Durham, England, July 1997) Equations over groups Conference Groups St Andrews 1997 in Bath (Bath, England, Summer 1997) Diophantine problem over free exponential groups. Group Theory at York (Toronto, Canada, May 1997), Ring theory for groups. Zassenhaus Group Theory Conference (Sarasota, FL, January 1997), Equations over free groups Workshop on General Combinatorial Group Theory (Montreal, Canada, April), Universal theory of free groups. Princeton - Rutgers Group Theory Seminar (Rutgers, December 3rd, 1996), Equations over free groups and description of residually free groups. New York Group Theory Seminar (New York, October, 1996), Residually free groups. XIV Brazilian Algebra School IMPA-1996 (Rio, Brazil, 1996), Equations over hyperbolic groups CRM Summer School on Group Theory (Banf, Canada, 1996), Algebraic geometry over hyperbolic groups Workshop on General Combinatorial Group Theory (Montreal, Canada, 1996), Exponential Groups Group Theory Conference (Albany, October, 1995), Hilbert basis theorem, Nullstellensatz and Zariski topology over hyperbolic groups Group Theory Conference (Ohio, May, 1995), Approximations of groups. New York Group Theory Seminar (New York, September, 1994), HNNextensions of hyperbolic groups. New York Group Theory Seminar (New York, September, 1995), Residually hyperbolic groups. Algebra Seminar (Yale University, October, 1995), Residually hyperbolic groups. Algebra Seminar, McGill University (Montreal, January, 1994), Nielsen presentations and computations in groups. 18

19 Algebra Seminar, McGill University (Montreal, May, 1995), Equations over free groups SUNYA Topology and Group Theory Conference (Albany, 1994). Conference on Geometric and Combinatorial Group Theory (Edinburgh, Scotland, 1993). Easter Conference on Model Theory (Berlin, Germany, 1991). International Conferences on Algebra (Novosibirsk 1989, Barnaul 1991, USSR). All-Union Algebraic Conferences (USSR, ). All-Union Conferences on Mathematical Logic (Alma-Ata 1992, Novosibirsk 1988, Moscow 1984, USSR). 4. GRANTS AND CONTRACTS AWARDED Microsoft Research gift, NSERC DISCOVERY GRANT Equations over groups and algorithmic problems, RGPIN , , Principal Investigator. NSF grant Generic properties of groups, geometric invariants, and algorithms, DMS , Co-Principal investigator, NSERC Grant Combinatorial groups theory: computational and statistical approach, , Principal Investigator. NSERC Grant Model theory of free groups and torsion-free hyperbolic groups, , Principal Investigator. Royal Society Leverhulme Trust Genetic Algorithms in Computational Group Theory, research fellow. McGill University Grant On finitary Andrews-Curtis conjecture, 2002, Principal Investigator. NIST/ATP Grant Award Security Architecture for Component- Based with Applications to Clinical Trials Data Management, , Co-Principal Investigator. PSC CUNY Research proposal Andrews-Curtis graphs of groups, , Principal Investigator. 19

20 CUNY Faculty Development Program Award Modern Algebra and Computer security, CUNY Faculty Development Program Award Modern Algebra and Scientific computing, NSF Research Grant Computational Group Theory DMS , Principal Investigator (joint with G.Baumslag), NSF Research Grant Algebraic geometry over groups DMS , Principal Investigator (joint with G.Baumslag), PSC CUNY Research Award Equations over free groups, grant number , Principal Investigator, PSC CUNY Collaborative Research Award Classification of nilpotent groups, grant number , Principal Investigator (joint with V.Shpilrain and J.Roitberg), NSF Research Grant Computational Group Theory DMS , RF Account: , total funding at $ 1,740,000, Research Associate, Soros Foundation research grant, 1994, Principal Investigator. 6. COLLEGE COMMUNITY ACTIVITIES; PROFESSIONAL SERVICE: 6.0 Three of my graduate students successfully defended their PhD theses under my supervision during the last year. 6.1 Currently I am mentoring 7 doctoral students. 6.2 Refereeing for journals: Journal of Algebra, Bulletin of AMS Transactions of AMS International Journal of Algebra and Computation, Journal of London Mathematical Society, Mathematical Notes, 20

21 Canadian Journal of Mathematics. 7. RECENT SCHOLARLY WORK AND SERVICE: 7.1 New York Group Theory Seminar The New York Group Theory Seminar is a world famous seminar where celebrated mathematicians talk about their latest research in group theory and related subjects. It is the longest continuously running seminar in New York City and is well-known throughout the world. The New York Group Theory Seminar is directly supported by the National Science Foundation and has been over the past 43 years. I was running jointly with Gilbert Baumslag this seminar for ten years. 7.2 CCNY Crypto Lab I am a part of Crypto Lab at City College of CUNY. It runs various experiments on testing new cryptosystems based on non-commutative groups. 7.3 Software development: In I was a Senior Research Fellow in the project Smart Lina. We developed a software for learning and teaching Linear Algebra. 7.4 Organizing meetings and conferences in : 1. Genetic Algebra Day at CCNY (CCNY, December 1999), 2. Workshop on Combinatorial Algebra (CCNY, April 1999), 3. Combinatorial group theory, AMS Meeting, Special Session (Columbia Univ., November 2000), 4. Probabilistic Methods in Groups (CCNY, December 2000), 5. Combinatorial and computational group theory, AMS Meeting, Special Session (Hoboken, NJ, Stevens Inst., April 2001), 6. Algebra and Scientific computing (CCNY, May 2001), 21

22 7. Modern Algebra and Computer Security, (NYC, The Graduate Center of CUNY, November 2001). 8. Combinatorial and statistical algebra (CCNY, April 2002), 9. Combinatorial and geometric group theory, AMS meeting, Special session, (Montreal, Canada, May 2002), 10. Workshop On Elementary Theories of Free Groups (Montreal. August 2002). 11. ASL/AMS special session Interactions between logic, group theory and computer science, Baltimore, January Combinatorial and statistical group theory AMS meeting, Special session (NYU-Courant Institute, April 12-13, 2003). 13. Groups, Equations, and Non-commutative Algebraic Geometry, Winter Meeting of the Canadian Math. Society, Special session (Montreal, December 11-13, 2004). 14. Interactions between Algebra and Computer Science, Winter meeting of the Canadian Mathematical Society, Special session (Montreal, December 11-13, 2004). 22