Improving Average Performance by Relaxing Distributed Data Structures. - Edward Talmage; Jennifer L. Welch (DISC, 2014)

DISC 2014 Review. - Merav Parter; Edward Talmage (SIGACT News, 2014)

Generic Proofs of Consensus Numbers for Abstract Data Types. - Edward Talmage; Jennifer L. Welch (OPODIS, 2015)

Relaxed Data Types as Consistency Conditions. - Edward Talmage; Jennifer L. Welch (Algorithms, 2018)

Improved time bounds for linearizable implementations of abstract data types. - Jiaqi Wang; Edward Talmage; Hyunyoung Lee 001; Jennifer L. Welch (Inf. Comput., 2018)

Anomalies and similarities among consensus numbers of variously-relaxed queues. - Edward Talmage; Jennifer L. Welch (Computing, 2019)

Fast and Space-Efficient Queues via Relaxation. - Dempsey Wade; Edward Talmage (OPODIS, 2020)

Lower Bounds on Message Passing Implementations of Multiplicity-Relaxed Queues and Stacks. - Edward Talmage (SIROCCO, 2022)

Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds. - Anh Tran; Edward Talmage (PODC, 2023)

Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues. - Anh Tran; Edward Talmage (DISC, 2023)

A Survey of Undergraduate Theory of Computing Curricula. - Ryan E. Dougherty; Tim Randolph 001; Tzu-Yi Chen; Jeff Erickson 001; Matthew Ferland; Dennis Komm; Jonathan Liu; Timothy Ng 001; Seth Poulsen; Smaranda Sandu; Michael Shindler; Edward Talmage; et al. (SIGCSE Virtual (2), 2024)

Brief Announcement: Relaxation for Efficient Asynchronous Queues. - Samuel Baldwin; Cole Hausman; Mohamed Bakr; Edward Talmage (SIROCCO, 2025)

Bachelor of Arts versus Bachelor of Science Degrees in Computer Science. - Edward Talmage; Barbara M. Anthony; Andrea Tartaro (J. Comput. Sci. Coll., 2025)

Relaxation for Efficient Asynchronous Queues. - Samuel Baldwin; Cole Hausman; Mohamed Bakr; Edward Talmage (CoRR, 2025)