I am a 4th-year PhD student in Computer Science under the supervision of
Eric Blais, in the
Algorithms & Complexity Group
within the Cheriton School of Computer Science
at the University of Waterloo.
I am currently seeking a postdoc position for Fall 2025.
My research is guided by the following question: what kinds of decisions can
algorithms make using little information? I am broadly interested in sublinear
algorithms, randomness in computation, Boolean functions, high-dimensional functions
and geometry, learning theory, and computational statistics.
In a previous life, I studied
computational linguistics with a touch of cognitive science at the University of
Toronto.
Papers
Citing my works in BibTeX (or, what
is my name?)
I do not have a middle name, that is, my first name is "Renato" and my last name is
"Ferreira Pinto Jr", with initial "F". I believe the easiest way to have BibTeX
behave accordingly is to enter my last name as {Ferreira Pinto Jr}. For slides and
such, feel free to use the shorter "Ferreira" if that is more convenient.
-
Testing Support Size More Efficiently Than Learning Histograms (To appear,
STOC 2025)
RF, Nathaniel Harms
[arXiv]
-
Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach
(FOCS 2024)
RF
[arXiv]
[slides]
[animations:
heat equation,
directed heat equation]
[TCS+ talk]
-
Distribution Testing with a Confused Collector (ITCS 2024)
RF, Nathaniel Harms
[arXiv]
-
Directed Poincaré Inequalities and L1 Monotonicity Testing of
Lipschitz Functions (RANDOM 2023)
RF
[arXiv]
-
VC Dimension and Distribution-Free Sample-Based Testing (STOC 2021)
Eric Blais, RF, Nathaniel Harms
[arXiv]