Oscar Sprumont
Scholar

Oscar Sprumont

Google Scholar ID: L7ayGZ4AAAAJ
University of Washington
Coding theoryComplexity theory
Citations & Impact
All-time
Citations
17
 
H-index
2
 
i10-index
1
 
Publications
3
 
Co-authors
0
 
Resume (English only)
Academic Achievements
  • Publications:
  • - From Bit to Block: Decoding on Erasure Channels (with Henry Pfister and Gilles Zémor) - ISIT 2025
  • - List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel (with Francisco Pernice and Mary Wootters) - STOC 2025
  • - A Criterion for Decoding on the Binary Symmetric Channel (with Anup Rao) - Advances in Mathematics of Communications 2024
Research Experience
  • Teaching assistant experience:
  • - CSE 421: Introduction to Algorithms - Spring 2025, Fall 2021, Fall 2020, Winter 2020
  • - CSE 531: Computational Complexity - Spring 2022
  • - CSE 431: Introduction to Theory of Computation - Spring 2021
  • - CSE 521: Applied Algorithms - Winter 2021
  • - CSE 311: Foundations of Computing 1 - Spring 2020, Fall 2019, Spring 2019, Fall 2018
  • - CSE 373: Data Structures and Algorithms - Summer 2019
  • - CSE 490: Toolkit for Modern Algorithms - Winter 2019
Education
  • PhD in Computer Science, University of Washington, advised by Anup Rao
Background
  • Main research interests: complexity theory and coding theory. Particularly interested in understanding which structural characteristics of a code ensure reliable decoding over the symmetric and erasure channels.
Miscellany
  • Contact and other links:
  • - Email: osprum@cs.washington.edu
  • - Google Scholar: link
  • - CV: pdf
Co-authors
0 total
Co-authors: 0 (list not available)