default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark V. Sapir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j17]Mark V. Sapir
:
On groups with locally compact asymptotic cones. Int. J. Algebra Comput. 25(1-2): 37-40 (2015)- [c2]Mark V. Sapir:
Minsky Machines and Algorithmic Problems. Fields of Logic and Computation II 2015: 273-292 - 2011
- [j16]Denis Osin, Mark V. Sapir:
Universal Tree-Graded Spaces and asymptotic Cones. Int. J. Algebra Comput. 21(5): 793-824 (2011) - 2010
- [j15]David Easdown, Mark V. Sapir, Mikhail V. Volkov:
Periodic Elements of the Free Idempotent Generated Semigroup on a Biordered Set. Int. J. Algebra Comput. 20(2): 189-194 (2010)
2000 – 2009
- 2008
- [j14]John Crisp, Michah Sageev, Mark V. Sapir:
Surface Subgroups of Right-Angled Artin Groups. Int. J. Algebra Comput. 18(3): 443-491 (2008) - 2007
- [j13]Alexander Yu. Olshanskii, Mark V. Sapir:
A Finitely Presented Group with Two Non-Homeomorphic asymptotic Cones. Int. J. Algebra Comput. 17(2): 421-426 (2007) - [j12]Mark V. Sapir:
Some Group Theory Problems. Int. J. Algebra Comput. 17(5/6): 1189-1214 (2007) - 2005
- [j11]Alexander Yu. Olshanskii, Mark V. Sapir:
Subgroups of Finitely Presented Groups with Solvable Conjugacy Problem. Int. J. Algebra Comput. 15(5-6): 1075-1084 (2005) - 2002
- [j10]Victor S. Guba, Mark V. Sapir:
Rigidity Properties of Diagram Groups. Int. J. Algebra Comput. 12(1-2): 9-17 (2002) - 2001
- [j9]Alexander Yu. Olshanskii, Mark V. Sapir:
Length and Area Functions on Groups and Quasi-Isometric Higman Embeddings. Int. J. Algebra Comput. 11(2): 137-170 (2001) - [j8]Stuart W. Margolis, Mark V. Sapir, Pascal Weil:
Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata. Int. J. Algebra Comput. 11(4): 405-446 (2001) - [j7]Mark V. Sapir, O. P. Lossers, Hugh L. Montgomery:
The Decimal Expansions of Powers of 9: 10758. Am. Math. Mon. 108(10): 977-978 (2001)
1990 – 1999
- 1998
- [j6]Stanislav I. Kublanovsky, Mark V. Sapir:
Potential Divisibility in Finite Semigroups is Undecidable. Int. J. Algebra Comput. 8(6): 671-680 (1998) - [j5]Stanislav I. Kublanovsky, Mark V. Sapir:
A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive. Int. J. Algebra Comput. 8(6): 681-688 (1998) - 1996
- [j4]Thomas Eric Hall, Mark V. Sapir:
Idempotents, regular elements and sequences from finite semigroups. Discret. Math. 161(1-3): 151-160 (1996) - [c1]Stuart W. Margolis, Mark V. Sapir, Pascal Weil:
On the Indecomposibility of Certain Language Classes. ISTCS 1996: 129-134 - 1995
- [j3]Olga Kharlampovich, Mark V. Sapir:
Algorithmic Problems in Varieties. Int. J. Algebra Comput. 5(4-5): 379-602 (1995) - 1993
- [j2]Mark V. Sapir:
Identities of Finite Inverse Semigroups. Int. J. Algebra Comput. 3(1): 115-124 (1993) - 1991
- [j1]Mark V. Sapir:
On the Word Problem in periodic Group Varieties. Int. J. Algebra Comput. 1(1): 115-126 (1991)
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-07-29 21:28 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:
