If you made any changes in Pure, your changes will be visible here soon.

Research Output 1980 2019

Filter
Conference contribution
2017

TC0 circuits for algorithmic problems in nilpotent groups

Miasnikov, A. & Weiß, A., Nov 1 2017, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Larsen, K. G., Raskin, J-F. & Bodlaender, H. L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 83).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Networks (circuits)
1 Citation (Scopus)

The conjugacy problem in free solvable groups and wreath products of Abelian groups is in TC0

Miasnikov, A., Vassileva, S. & Weiß, A., Jan 1 2017, Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings. Springer Verlag, p. 217-231 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10304 LNCS).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Conjugacy Problem
Wreath Product
Solvable Group
Free Group
Torsional stress
2015
1 Citation (Scopus)

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem

Diekert, V., Miasnikov, A. & Weiß, A., Jun 24 2015, ISSAC 2015 - Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery, p. 141-148 8 p. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC; vol. 2015-June).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

HNN Extension
Conjugacy Problem
Amenability
Graph in graph theory
Finitely Generated
2014
5 Citations (Scopus)

Conjugacy in baumslag's group, generic case complexity, and division in power circuiats

Diekert, V., Miasnikov, A. & Weiß, A., Jan 1 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Verlag, p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Conjugacy Problem
Conjugacy
Division
Networks (circuits)
Polynomials
2012
6 Citations (Scopus)

Cayley graph automatic groups are not necessarily Cayley graph biautomatic

Miasnikov, A. & Šunić, Z., Mar 12 2012, Language and Automata Theory and Applications - 6th International Conference, LATA 2012, Proceedings. p. 401-407 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7183 LNCS).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cayley Graph
Conjugacy Problem
Isomorphism Problem
6 Citations (Scopus)

The complexity of verbal languages over groups

Jain, S., Miasnikov, A. & Stephan, F., Oct 11 2012, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012. p. 405-414 10 p. 6280459

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Formal languages
Pattern Language
Free Group
Strings
Language
2011
2 Citations (Scopus)

Solving word problems in group extensions over infinite words

Diekert, V. & Miasnikov, A., Jul 29 2011, Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings. Vol. 6795 LNCS. p. 192-203 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6795 LNCS).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Group Extension
Infinite Words
Word problem
Combinatorics on Words
Group Theory
2010
7 Citations (Scopus)

Equations and fully residually free groups

Kharlampovich, O. & Miasnikov, A., Jan 1 2010, Combinatorial and Geometric Group Theory. Springer International Publishing, Vol. 47. p. 203-242 40 p. (Trends in Mathematics; vol. 47).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Free Group
Structure Theorem
Finitely Generated
Elimination
Prototype
8 Citations (Scopus)

Geodesic rewriting systems and pregroups

Diekert, V., Duncan, A. J. & Miasnikov, A., Jan 1 2010, Combinatorial and Geometric Group Theory. Bumagin, I., Ventura, E., Kharlampovich, O. & Bogopolski, O. (eds.). Springer International Publishing, p. 55-91 37 p. (Trends in Mathematics; vol. 47).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rewriting Systems
Geodesic
Monoids
Completion
8 Citations (Scopus)

Regular sets and counting in free groups

Frenkel, E., Miasnikov, A. & Remeslennikov, V. N., Jan 1 2010, Combinatorial and Geometric Group Theory. Bumagin, I., Ventura, E., Kharlampovich, O. & Bogopolski, O. (eds.). Springer International Publishing, p. 93-118 26 p. (Trends in Mathematics; vol. 47).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Regular Sets
Coset
Free Group
Counting
Free Product with Amalgamation
2007
15 Citations (Scopus)

Algebraic extensions in free groups

Miasnikov, A., Ventura, E. & Weil, P., Jan 1 2007, Geometric Group Theory. Arzhantseva, G. N., Bartholdi, L., Ventura, E. & Burillo, J. (eds.). Springer International Publishing, p. 225-253 29 p. (Trends in Mathematics; vol. 40).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Algebraic extension
Free Group
Closure
Subgroup
Closure Operator

Generic complexity of undecidable problems

Miasnikov, A., Dec 24 2007, Computer Science - Theory and Applications - Second International Symposium on Computer Science in Russia, CSR 2007, Proceedings. Vol. 4649 LNCS. p. 407-417 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4649 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Amplification
Turing machines
Hardness
Subset
Halting Problem
2006
25 Citations (Scopus)

A practical attack on a braid group based cryptographic protocol

Miasnikov, A., Shpilrain, V. & Ushakov, A., Jun 23 2006, Advances in Cryptology - CRYPTO 2005 - 25th Annual International Cryptology Conference, Proceedings. Vol. 3621 LNCS. p. 86-96 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3621 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cryptographic Protocols
Braid Group
Attack
Decomposition
Conjugacy Problem
17 Citations (Scopus)

Random subgroups of braid groups: An approach to cryptanalysis of a braid group based cryptographic protocol

Miasnikov, A., Shpilrain, V. & Ushakov, A., Jan 1 2006, Public Key Cryptography - PKC 2006 - 9th International Conference on Theory and Practice in Public-Key Cryptography, Proceedings. Springer Verlag, Vol. 3958 LNCS. p. 302-314 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3958 LNCS).

Stevens Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cryptographic Protocols
Braid Group
Cryptanalysis
Subgroup
Random Element