default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIosif Pinelis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Iosif Pinelis
:
An Exact Bound for the Inner Product of Vectors in ℂ n. Am. Math. Mon. 131(7): 627-628 (2024)- 2023
- [i6]Mladen Kovacevic, Iosif Pinelis, Marios Kountouris:
An Information-Theoretic Analog of the Twin Paradox. CoRR abs/2309.11862 (2023) - 2022
- [j13]Iosif Pinelis:
Large Deviations Of Sums Mainly Due To Just One Summand. Am. Math. Mon. 129(9): 880-884 (2022) - [c1]Lun Wang, Iosif Pinelis, Dawn Song:
Differentially Private Fractional Frequency Moments Estimation with Polylogarithmic Space. ICLR 2022 - 2021
- [i5]Iosif Pinelis:
Modulus of continuity of the quantum f-entropy with respect to the trace distance. CoRR abs/2107.10112 (2021)
2010 – 2019
- 2019
- [j12]Iosif Pinelis:
Exact Upper and Lower Bounds on the Misclassification Probability. IEEE Trans. Inf. Theory 65(7): 4327-4334 (2019) - 2018
- [j11]Iosif Pinelis:
An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only. Numerische Mathematik 140(3): 755-790 (2018) - 2017
- [i4]Iosif Pinelis:
An exact lower bound on the misclassification probability. CoRR abs/1712.00812 (2017) - 2016
- [j10]Iosif Pinelis:
On the extreme points of moments sets. Math. Methods Oper. Res. 83(3): 325-349 (2016) - [j9]Iosif Pinelis:
On Measurable Semigroups in ℝ. Am. Math. Mon. 123(5): 481 (2016) - [j8]Iosif Pinelis:
Explicit Additive Decomposition of Norms on ℝ2. Am. Math. Mon. 123(5): 491-496 (2016) - [i3]Aryeh Kontorovich, Iosif Pinelis:
Exact Lower Bounds for the Agnostic Probably-Approximately-Correct (PAC) Machine Learning Model. CoRR abs/1606.08920 (2016) - 2015
- [j7]Iosif Pinelis:
Relationships Between the First Four Moments. Am. Math. Mon. 122(5): 479-481 (2015) - [j6]Iosif Pinelis:
On the Hölder and Cauchy-Schwarz Inequalities. Am. Math. Mon. 122(6): 593-595 (2015) - 2014
- [j5]Iosif Pinelis:
Schur2-concavity properties of Gaussian measures, with applications to hypotheses testing. J. Multivar. Anal. 124: 384-397 (2014)
2000 – 2009
- 2007
- [i2]Iosif Pinelis:
Polygon Convexity: Another O(n) Test. CoRR abs/cs/0701045 (2007) - 2006
- [i1]Iosif Pinelis:
Polygon Convexity: A Minimal O(n) Test. CoRR abs/cs/0609141 (2006) - 2004
- [j4]Iosif Pinelis:
L'Hospital Rules for Monotonicity and the Wilker-Anglesio Inequality. Am. Math. Mon. 111(10): 905-909 (2004) - 2003
- [j3]Iosif Pinelis:
A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families. Math. Methods Oper. Res. 58(1): 105-129 (2003) - 2002
- [j2]Iosif Pinelis:
An Equidistribution Phenomenon: Is There a Principle behind It? Am. Math. Mon. 109(7): 657-659 (2002)
1990 – 1999
- 1996
- [j1]Iosif Pinelis:
On the Minimal Number of Even Submatrices of 0-1 Matrices. Des. Codes Cryptogr. 9(1): 85-93 (1996)
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-08-23 18:27 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:
