APA   Click to copy
Con, R., Guo, Z., Li, R., & Zhang, Z. (2025). Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. To Apear at the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2025), Aarhus, Denmark.

Chicago/Turabian   Click to copy
Con, Roni, Zeyu Guo, Ray Li, and Zihan Zhang. “Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets.” To Apear at the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2025), Aarhus, Denmark, 2025.

MLA   Click to copy
Con, Roni, et al. Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. To Apear at the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2025), Aarhus, Denmark, 2025.

@conference{con2025a,
  title = {Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets},
  year = {2025},
  publisher = {To Apear at the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2025),  Aarhus, Denmark},
  author = {Con, Roni and Guo, Zeyu and Li, Ray and Zhang, Zihan}
}