- Algorithms
- Big Data
- Statistical Learning
- +۳ مورد دیگر
Lorenzo De Stefani serves as an Assistant Teaching Professor (formally titled Lecturer) in Brown University's Department of Computer Science, teaching core courses including Theory of Computation (CSCI1010), Design and Analysis of Algorithms (CSCI1570), and Data Science (CSCI1951A). His academic credentials feature dual doctoral degrees: a PhD in Computer Science from Brown University (2020) under Eli Upfal, and a PhD in Computer Engineering from the University of Padova (2016) under Gianfranco Bilardi. Additional qualifications include a Master of Science (2012) and Bachelor of Science (2009) in Computer Engineering from the University of Padova. PhD, Brown University, 2020 PhD, University of Padova, 2016 MSc, University of Padova, 2012 BSc, University of Padova, 2009 De Stefani's research centers on algorithmic innovation for large-scale data challenges, with emphasis on memory-efficient graph stream processing, statistical learning for multiple hypothesis testing, and Byzantine-resilient computation. His work bridges theoretical computer science and practical data analysis through rigorous probabilistic frameworks. Publication trends reveal consistent contributions to graph algorithm optimization, particularly in single-pass triangle counting for dynamic networks and I/O complexity bounds for fundamental operations like matrix multiplication. His methodologies prioritize computational efficiency while maintaining statistical validity in massive datasets. Scientific recognition includes: KDD Best Student Paper Award (2016) for Tríest streaming algorithms While advising PhD candidates during his doctoral studies at Brown and Padova, current student mentorship details remain unspecified. No major grant awards are documented in available materials. He actively participates in Brown's computer science research ecosystem through collaborative networks focused on algorithmic foundations and data science applications.











