How Complex is DNS? (Conference Paper) | NSF PAGES

skip to main content

Citation Details

How Complex is DNS?

Award ID(s):: 1901510

NSF-PAR ID:: 10334617

Author(s) / Creator(s):: Kakarla, Siva Kesava; Beckett, Ryan; Millstein, Todd; Varghese, George

Date Published:: 2021-11-01

Journal Name:: Proceedings of the Twentieth ACM Workshop on Hot Topics in Networks

Page Range / eLocation ID:: 116 to 122

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1145/3484266.3487369