Iosif Pinelis

Orcid: 0000-0003-4742-5789

According to our database1, Iosif Pinelis authored at least 20 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Information-Theoretic Analog of the Twin Paradox.
CoRR, 2023

2022
Large Deviations Of Sums Mainly Due To Just One Summand.
Am. Math. Mon., 2022

Differentially Private Fractional Frequency Moments Estimation with Polylogarithmic Space.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Modulus of continuity of the quantum f-entropy with respect to the trace distance.
CoRR, 2021

2019
Exact Upper and Lower Bounds on the Misclassification Probability.
IEEE Trans. Inf. Theory, 2019

2018
An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only.
Numerische Mathematik, 2018

2017
An exact lower bound on the misclassification probability.
CoRR, 2017

2016
Explicit Additive Decomposition of Norms on ℝ2.
Am. Math. Mon., 2016

On Measurable Semigroups in ℝ.
Am. Math. Mon., 2016

On the extreme points of moments sets.
Math. Methods Oper. Res., 2016

Exact Lower Bounds for the Agnostic Probably-Approximately-Correct (PAC) Machine Learning Model.
CoRR, 2016

2015
On the Hölder and Cauchy-Schwarz Inequalities.
Am. Math. Mon., 2015

Relationships Between the First Four Moments.
Am. Math. Mon., 2015

2014
Schur<sup>2</sup>-concavity properties of Gaussian measures, with applications to hypotheses testing.
J. Multivar. Anal., 2014

2007
Polygon Convexity: Another O(n) Test
CoRR, 2007

2006
Polygon Convexity: A Minimal O(n) Test
CoRR, 2006

2004
L'Hospital Rules for Monotonicity and the Wilker-Anglesio Inequality.
Am. Math. Mon., 2004

2003
A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families.
Math. Methods Oper. Res., 2003

2002
An Equidistribution Phenomenon: Is There a Principle behind It?
Am. Math. Mon., 2002

1996
On the Minimal Number of Even Submatrices of 0-1 Matrices.
Des. Codes Cryptogr., 1996


  Loading...