default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Rivin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i8]Alexander Kolpakov, Igor Rivin:
A ripple in time: a discontinuity in American history. CoRR abs/2312.01185 (2023)- 2021
- [c5]Carina Curto, Joshua Paik, Igor Rivin:
Betti Curves of Rank One Symmetric Matrices. GSI 2021: 645-655
2010 – 2019
- 2019
- [j11]Igor Rivin, Naser T. Sardari:
Quantum Chaos on Random Cayley Graphs of SL 2[Z/pZ]. Exp. Math. 28(3): 328-341 (2019) - 2016
- [j10]Igor Rivin:
Spectral Experiments+. Exp. Math. 25(4): 379-388 (2016) - [j9]Igor Rivin:
How to pick a random integer matrix? (and other questions). Math. Comput. 85(298): 783-797 (2016) - [j8]Robin Pemantle, Yuval Peres, Igor Rivin:
Four random permutations conjugated by an adversary generate Sn with high probability. Random Struct. Algorithms 49(3): 409-428 (2016) - 2014
- [i7]Igor Rivin:
Spectral Experiments+. CoRR abs/1410.6771 (2014) - [i6]Robin Pemantle, Yuval Peres, Igor Rivin:
Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability. CoRR abs/1412.3781 (2014) - 2013
- [i5]Igor Rivin:
Large Galois groups with applications to Zariski density. CoRR abs/1312.3009 (2013) - 2012
- [c4]Md. Ashraful Alam, Igor Rivin, Ileana Streinu:
Outerplanar Graphs and Delaunay Triangulations. Computation, Physics and Beyond 2012: 320-329 - 2011
- [c3]Md. Ashraful Alam, Igor Rivin, Ileana Streinu:
Outerplanar graphs and Delaunay triangulations. CCCG 2011 - 2010
- [j7]Bojan Mohar, Igor Rivin:
Simplices and Spectra of Graphs. Discret. Comput. Geom. 43(3): 516-521 (2010)
2000 – 2009
- 2007
- [j6]Igor Rivin:
Surface area and other measures of ellipsoids. Adv. Appl. Math. 39(4): 409-427 (2007) - 2003
- [j5]Igor Rivin:
Combinatorial optimization in geometry. Adv. Appl. Math. 31(1): 242-271 (2003) - [j4]Natalia L. Komarova, Igor Rivin:
Harmonic mean, random polynomials and stochastic matrices. Adv. Appl. Math. 31(2): 501-526 (2003) - 2002
- [j3]Igor Rivin:
Counting cycles and finite dimensional Lp norms. Adv. Appl. Math. 29(4): 647-662 (2002) - [i4]Igor Rivin:
The performance of the batch learner algorithm. CoRR cs.LG/0201009 (2002) - 2001
- [i3]Igor Rivin:
Yet another zeta function and learning. CoRR cs.LG/0107033 (2001) - [i2]Natalia L. Komarova, Igor Rivin:
Mathematics of learning. CoRR math.PR/0105235 (2001) - [i1]Natalia L. Komarova, Igor Rivin:
Harmonic mean, random polynomials and stochastic matrices. CoRR math.PR/0105236 (2001)
1990 – 1999
- 1994
- [c2]Igor Rivin, Srimat T. Chakradhar:
Discrete test generation by continuous methods. VTS 1994: 100-105 - 1992
- [j2]Igor Rivin, Ramin Zabih
:
A Dynamic Programming Solution to the n-Queens Problem. Inf. Process. Lett. 41(5): 253-256 (1992) - [j1]Yuh-Dauh Lyuu, Igor Rivin:
Tight Bounds on Transition to Perfect Generalization in Perceptrons. Neural Comput. 4(6): 854-862 (1992)
1980 – 1989
- 1989
- [c1]Igor Rivin, Ramin Zabih:
An Algebraic Approach to Constraint Satisfaction Problems. IJCAI 1989: 284-289
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-04-25 05:57 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:
