Jennifer L. Welch

Animal and Plant Health Inspection Service — United States

Computer Science · Physical Sciences

30h-index4.7kcitations226works3.82yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Distributed systems and fault tolerance(137), Optimization and Search Problems(39), Parallel Computing and Optimization Techniques(37), Mobile Ad Hoc Networks(36), Opportunistic and Delay-Tolerant Networks(29)

Publications226 total

Unveiling the Hidden Threat: Drought‐Induced Inelastic Subsidence in Expansive Soils
Geophysical Research Letters·2024· 10 citedOpen Access
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
arXiv (Cornell University)·2024Open Access
Coxiella burnetii seroprevalence in domestic goat does in the United States: Prevalence, distribution, and associated risk factors
Preventive Veterinary Medicine·2024· 5 citedOpen Access
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
Lecture notes in computer science·2024
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit
arXiv (Cornell University)·2023· 3 citedOpen Access
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
UNC Libraries·2021Open Access
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
arXiv (Cornell University)·2021Open Access
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs.
arXiv (Cornell University)·2021· 1 citedOpen Access
Impossibility of Strongly-Linearizable Message-Passing Objects via\n Simulation by Single-Writer Registers
arXiv (Cornell University)·2021Open Access
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 3 citedOpen Access
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement
2020· 1 cited
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement
Lecture notes in computer science·2020· 3 citedOpen Access
Byzantine-Tolerant Register in a System with Continuous Churn
arXiv (Cornell University)·2019· 4 citedOpen Access
Shared memory and the Bakery algorithm
Association for Computing Machinery eBooks·2019
Distributed Computing Column 75 The Splendors and Miseries of Rounds
ACM SIGACT News·2019
Distributed Computing Column 74 Survey of Recon gurable Data Center Networks
ACM SIGACT News·2019
How Fast Reads Affect Multi-Valued Register Simulations
2019Open Access
Distributed Computing Column 73 SPAA 2018 Review
ACM SIGACT News·2019
Implementing ♢P with Bounded Messages on a Network of <i>ADD</i> Channels
Parallel Processing Letters·2019· 5 cited
Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019Open Access
page 1 of 12Next →

Frequent Co-authors

Shlomi Dolev(11), Nancy Lynch(10), Hagit Attiya(6), Jennifer E. Walter(6), Nitin H. Vaidya(5), Elad M. Schiller(5), Hyunyoung Lee(5), Seth Gilbert(5), Alex A. Shvartsman(4), Saira Viqar(4), Navneet Malpani(3), Nancy M. Amato(3), Leslie Lamport(3), Andreas Klappenecker(2), Rebecca Ingram(2), Patrick Shields(2), Brian Coan(2), Cheng Shao(2), Evelyn Pierce(2), Guoquan Wang(2)