|
|
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
|
1984-11-01
|
Manuel Blum
Silvio Micali
|
3
|
|
|
Making AI Forget You: Data Deletion in Machine Learning
|
2019-07-11
|
Antonio Ginart
Melody Y. Guan
Gregory Valiant
James Zou
|
2
|
|
|
Proving Erasure
|
2019-07-01
|
Xavier Coiteux-Roy
Stefan Wolf
|
2
|
|
|
Machine Unlearning
|
2019-12-09
|
Lucas Bourtoule
Varun Chandrasekaran
Christopher A. Choquette-Choo
Hengrui Jia
Adelin Travers
Baiwu Zhang
David Lie
Nicolas Papernot
|
2
|
|
|
How to construct random functions
|
1986-08-10
|
Oded Goldreich
Shafi Goldwasser
Silvio Micali
|
2
|
|
|
Quantum Encryption with Certified Deletion
|
2020-01-01
|
Anne Broadbent
Rabib Islam
|
2
|
|
|
Practical verified computation with streaming interactive proofs
|
2012-01-08
|
Graham Cormode
Michael Mitzenmacher
Justin Thaler
|
2
|
|
|
Optimum Statistical Estimation with Strategic Data Sources
|
2014-01-01
|
Yang Cai
Constantinos Daskalakis
Christos H. Papadimitriou
|
2
|
|
|
Randomness conservation inequalities; information and independence in mathematical theories
|
1984-04-01
|
Leonid A. Levin
|
2
|
|
|
Machine Learning Models that Remember Too Much
|
2017-10-27
|
Congzheng Song
Thomas Ristenpart
Vitaly Shmatikov
|
2
|
|
|
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
|
1970-12-31
|
Alexander K. Zvonkin
Leonid A. Levin
|
2
|
|
|
Pseudodeterministic Constructions in Subexponential Time
|
2016-12-06
|
Igor Carboni Oliveira
Rahul Santhanam
|
2
|
|
|
The definition of random sequences
|
1966-12-01
|
Per Martin-Löf
|
2
|
|
|
Some extremal problems arising from discrete control processes
|
1989-09-01
|
David Lichtenstein
Nathan Linial
Michael Saks
|
2
|
|
|
Algorithms that remember: model inversion attacks and data protection law
|
2018-10-15
|
Michael Veale
Reuben Binns
Lilian Edwards
|
2
|
|
|
Selection criteria and generalizability within the counterfactual framework: explaining the paradox of antidepressant-induced suicidality?
|
2009-04-01
|
Herbert I. Weisberg
Vanessa Hayden
Victor P Pontes
|
1
|
|
|
Factoring Integers with Elliptic Curves
|
1987-11-01
|
H. W. Lenstra
|
1
|
|
|
How to Generate Factored Random Numbers
|
1988-04-01
|
Eric Bach
|
1
|
|
|
A note on computational indistinguishability
|
1990-05-01
|
Oded Goldreich
|
1
|
|
|
A note on the graph isomorphism counting problem
|
1979-03-01
|
Rudolf Mathon
|
1
|
|
|
Elliptic curves and primality proving
|
1993-01-01
|
A. O. L. Atkin
François Morain
|
1
|
|
|
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
|
2016-04-01
|
Michele Borassi
Pierluigi Crescenzi
Michel Habib
|
1
|
|
|
Faster all-pairs shortest paths via circuit complexity
|
2014-05-31
|
Ryan Williams
|
1
|
|
|
Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques
|
1995-01-01
|
François Morain
|
1
|
|
|
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
|
2015-06-03
|
Artūrs Bačkurs
Piotr Indyk
|
1
|
|
|
Infinite sets of primes with fast primality tests and quick generation of large primes
|
1989-01-01
|
J. Pintz
William Steiger
Endre Szemerédi
|
1
|
|
|
Elliptic curves over finite fields and the computation of square roots mod 𝑝
|
1985-01-01
|
René Schoof
|
1
|
|
|
Risk bounds for statistical learning
|
2006-10-01
|
Pascal Massart
Élodie Nédélec
|
1
|
|
|
The Space Complexity of Approximating the Frequency Moments
|
1999-02-01
|
Noga Alon
Yossi Matias
Márió Szegedy
|
1
|
|
|
Very short primality proofs
|
1987-01-01
|
Carl Pomerance
|
1
|
|
|
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
|
2015-01-01
|
Huacheng Yu
|
1
|
|
|
How robust are linear sketches to adaptive inputs?
|
2013-05-28
|
Moritz Hardt
David P. Woodruff
|
1
|
|
|
The calibration of treatment effects from clinical trials to target populations
|
2009-04-01
|
Constantine Frangakis
|
1
|
|
|
Doubly Robust Estimation in Missing Data and Causal Inference Models
|
2005-12-01
|
Heejung Bang
James M. Robins
|
1
|
|
|
The Differences between Consecutive Primes
|
1978-08-01
|
D. R. Heath‐Brown
|
1
|
|
|
The arithmetic of elliptic curves
|
1974-09-01
|
John Tate
|
1
|
|
|
Estimating causal effects of treatments in randomized and nonrandomized studies.
|
1974-10-01
|
Donald B. Rubin
|
1
|
|
|
Generalizing Evidence From Randomized Clinical Trials to Target Populations: The ACTG 320 Trial
|
2010-06-14
|
S. R. Cole
Elizabeth A. Stuart
|
1
|
|
|
A hyperelliptic smoothness test. I
|
1993-11-15
|
H. W. Lenstra
Jonathan Pila
Carl Pomerance
|
1
|
|
|
On Primes Recognizable in Deterministic Polynomial Time
|
2013-01-01
|
Sergeĭ Konyagin
Carl Pomerance
|
1
|
|
|
Factoring polynomials with rational coefficients
|
1982-12-01
|
A. K. Lenstra
H. W. Lenstra
László Lovász
|
1
|
|
|
Tight bounds for Lp samplers, finding duplicates in streams, and related problems
|
2011-06-13
|
Hossein Jowhari
Mert Sağlam
Gábor Tardos
|
1
|
|
|
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
|
1988-01-01
|
John Brillhart
D. H. Lehmer
J. L. Selfridge
Bryant Tuckerman
Samuel S. Wagstaff
|
1
|
|
|
Elliptic and modular curves over finite fields and related computational issues
|
1997-12-02
|
Noam D. Elkies
|
1
|
|
|
The central role of the propensity score in observational studies for causal effects
|
1983-01-01
|
Paul R. Rosenbaum
Donald B. Rubin
|
1
|
|
|
Adaptively Secure Coin-Flipping, Revisited
|
2015-01-01
|
Shafi Goldwasser
Yael Tauman Kalai
Sunoo Park
|
1
|
|
|
The random oracle methodology, revisited
|
2004-07-01
|
Ran Canetti
Oded Goldreich
Shai Halevi
|
1
|
|
|
PRIMES is in P
|
2004-09-01
|
Manindra Agrawal
Neeraj Kayal
Nitin Saxena
|
1
|
|
|
Quantum Copy-Protection and Quantum Money
|
2009-07-01
|
Scott Aaronson
|
1
|
|
|
Scikit-learn: Machine Learning in Python
|
2012-01-01
|
Fabián Pedregosa
Gaël Varoquaux
Alexandre Gramfort
Vincent Michel
Bertrand Thirion
Olivier Grisel
Mathieu Blondel
Peter Prettenhofer
Ron J. Weiss
Vincent Dubourg
|
1
|