default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya Kapovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j10]Ilya Kapovich, Zachary Simon:
Primitivity index bounds in free groups, and the second Chebyshev function. Int. J. Algebra Comput. 33(1): 105-122 (2023)- 2019
- [j9]Ilya Kapovich, Mark C. Bell:
Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm. Exp. Math. 28(1): 24-38 (2019) - 2015
- [j8]Ilya Kapovich, Catherine Pfaff:
A train track directed random walk on Out(Fr). Int. J. Algebra Comput. 25(5): 745-798 (2015) - [j7]Ilya Kapovich, Martin Lustig:
Cannon-Thurston fibers for iwip automorphisms of $F_N$. J. Lond. Math. Soc. 91(1): 203-224 (2015) - 2007
- [j6]Ilya Kapovich:
Clusters, Currents, and Whitehead's Algorithm. Exp. Math. 16(1): 67-76 (2007) - 2005
- [j5]Ilya Kapovich
, Richard Weidmann, Alexei G. Myasnikov:
Foldings, Graphs of Groups and the Membership Problem. Int. J. Algebra Comput. 15(1): 95-128 (2005) - [j4]Ilya Kapovich:
The Frequency Space of a Free Group. Int. J. Algebra Comput. 15(5-6): 939-970 (2005) - 2004
- [j3]Ilya Kapovich, Richard Weidmann:
Freely Indecomposable Groups Acting on Hyperbolic Spaces. Int. J. Algebra Comput. 14(2): 115-171 (2004) - 2001
- [j2]Ilya Kapovich:
The Combination Theorem and Quasiconvexity. Int. J. Algebra Comput. 11(2): 185-216 (2001) - 1997
- [j1]Ilya Kapovich:
Quasiconvexity and Amalgams. Int. J. Algebra Comput. 7(6): 771- (1997)
Conference and Workshop Papers
- 1994
- [c1]Ilya Kapovich:
Detecting quasiconvexity: Algorithmic aspects. Geometric and Computational Perspectives on Infinite Groups 1994: 91-99
Informal and Other Publications
- 2015
- [i5]Ilya Kapovich:
Musings on generic-case complexity. CoRR abs/1505.03218 (2015) - 2007
- [i4]Ilya Kapovich, Paul E. Schupp:
Some Quantitative Aspects of Fractional Computability. CoRR abs/0706.4095 (2007) - 2003
- [i3]Ilya Kapovich, Paul E. Schupp, Vladimir Shpilrain:
Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups. CoRR math.GR/0303386 (2003) - 2002
- [i2]Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain:
Generic-case complexity, decision problems in group theory and random walks. CoRR math.GR/0203239 (2002) - [i1]Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain:
Average-case complexity and decision problems in group theory. CoRR math.GR/0206273 (2002)
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 2025-01-09 13:23 CET 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:
