default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJennifer L. Welch
Jennifer Lundelius
Person information
- affiliation: Texas A&M University, College Station, Texas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c94]Colette Johnen
, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. SIROCCO 2024: 318-335- [i10]Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. CoRR abs/2402.14120 (2024) - 2023
- [c93]Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. OPODIS 2023: 6:1-6:23 - [c92]Hagit Attiya, Jennifer L. Welch:
Bounds on Worst-Case Responsiveness for Agreement Algorithms. OPODIS 2023: 32:1-32:22 - [c91]Hagit Attiya, Jennifer L. Welch:
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. DISC 2023: 36:1-36:7 - [i9]Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. CoRR abs/2308.04646 (2023) - 2022
- [j75]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement. Inf. Comput. 285(Part): 104869 (2022) - [c90]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. PODC 2022: 209-219 - [c89]Jennifer L. Welch:
Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk). DISC 2022: 3:1-3:1 - 2021
- [c88]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. DISC 2021: 7:1-7:18 - [i8]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. CoRR abs/2105.06614 (2021) - [i7]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs. CoRR abs/2106.15554 (2021) - 2020
- [c87]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. PODC 2020: 51-53 - [c86]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. SSS 2020: 1-15 - [i6]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. CoRR abs/2003.07787 (2020)
2010 – 2019
- 2019
- [j74]Edward Talmage, Jennifer L. Welch:
Anomalies and similarities among consensus numbers of variously-relaxed queues. Computing 101(9): 1349-1368 (2019) - [j73]Saptaparni Kumar, Jennifer L. Welch:
Implementing ♢P with Bounded Messages on a Network of ADD Channels. Parallel Process. Lett. 29(1): 1950002:1-1950002:12 (2019) - [j72]Jennifer L. Welch:
Distributed Computing Column 73 SPAA 2018 Review. SIGACT News 50(1): 60 (2019) - [j71]Jennifer L. Welch:
Distributed Computing Column 74 Survey of Recon gurable Data Center Networks. SIGACT News 50(2): 61 (2019) - [j70]Jennifer L. Welch:
Distributed Computing Column 75 The Splendors and Miseries of Rounds. SIGACT News 50(3): 34 (2019) - [j69]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Emulating a Shared Register in a System That Never Stops Changing. IEEE Trans. Parallel Distributed Syst. 30(3): 544-559 (2019) - [c85]Soma Chaudhuri, Reginald Frank, Jennifer L. Welch:
How Fast Reads Affect Multi-Valued Register Simulations. PODC 2019: 215-217 - [p1]Hagit Attiya, Jennifer L. Welch:
Shared memory and the Bakery algorithm. Concurrency: the Works of Leslie Lamport 2019: 27-46 - [i5]Saptaparni Kumar, Jennifer L. Welch:
Byzantine-Tolerant Register in a System with Continuous Churn. CoRR abs/1910.06716 (2019) - 2018
- [j68]Edward Talmage, Jennifer L. Welch:
Relaxed Data Types as Consistency Conditions. Algorithms 11(5): 61 (2018) - [j67]Jiaqi Wang, Edward Talmage, Hyunyoung Lee, Jennifer L. Welch:
Improved time bounds for linearizable implementations of abstract data types. Inf. Comput. 263: 1-30 (2018) - [j66]Jennifer L. Welch:
Distributed Computing Column 69 Proving PACELC and Concurrent Computing Summer School. SIGACT News 49(1): 72 (2018) - [j65]Jennifer L. Welch:
Distributed Computing Column 70: Formalizing and Implementing Distributed Ledger Objects. SIGACT News 49(2): 57 (2018) - [j64]Jennifer L. Welch:
Distributed Computing Column 71: Recent Algorithmic Advances in Population Protocols. SIGACT News 49(3): 62 (2018) - [j63]Jennifer L. Welch:
Distributed Computing Column 72: Annual Review 2018. SIGACT News 49(4): 58-59 (2018) - [c84]Jennifer L. Welch:
Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote). OPODIS 2018: 1:1-1:1 - [c83]Reginald Frank, Jennifer L. Welch:
Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids. DISC 2018: 47:1-47:3 - [i4]Reginald Frank, Jennifer L. Welch:
A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids. CoRR abs/1807.05139 (2018) - 2017
- [j62]Jennifer L. Welch:
Distributed Computing Column 65: Automatic Synthesis of Distributed Protocols and SIROCCO 2016 Review. SIGACT News 48(1): 54 (2017) - [j61]Jennifer L. Welch:
Distributed Computing Column 66 Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News 48(2): 86 (2017) - [j60]Jennifer L. Welch:
Distributed Computing Column 67: Review of 2016 BIRS CMO Workshop on Complexity and Analysis of Distributed Algorithms. SIGACT News 48(3): 60-67 (2017) - [j59]Jennifer L. Welch:
Distributed Computing Column 68. SIGACT News 48(4): 78-79 (2017) - [c82]Keishla D. Ortiz-Lopez, Jennifer L. Welch:
Bounded Reordering Allows Efficient Reliable Message Transmission. IPDPS 2017: 327-336 - [c81]Edward Talmage, Jennifer L. Welch:
Anomalies and Similarities Among Consensus Numbers of Variously-Relaxed Queues. NETYS 2017: 191-205 - [c80]Edward Talmage, Jennifer L. Welch:
Relaxed Data Types as Consistency Conditions. SSS 2017: 142-156 - [i3]Saptaparni Kumar, Jennifer L. Welch:
Implementing Diamond P with Bounded Messages on a Network of ADD Channels. CoRR abs/1708.02906 (2017) - [i2]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in a System that Never Stops Changing. CoRR abs/1708.03274 (2017) - 2016
- [j58]Jennifer L. Welch:
Distributed Computing Column 61: Distributed Algorithmic Foundations of Dynamic Networks. SIGACT News 47(1): 68 (2016) - [j57]Jennifer L. Welch:
Distributed Computing Column 62: Decidability in Parameterized Verification. SIGACT News 47(2): 52 (2016) - [j56]Jennifer L. Welch:
Distributed Computing Column 63: A Note on Fault-tolerant Consensus in Directed Networks. SIGACT News 47(3): 69 (2016) - [j55]Jennifer L. Welch:
Distributed Computing Column 64: Annual Review 2016. SIGACT News 47(4): 33-34 (2016) - 2015
- [j54]Jennifer L. Welch:
Distributed Computing Column 57 Distributed Algorithms as Combinatorial Structures. SIGACT News 46(1): 62 (2015) - [j53]Jennifer L. Welch:
Distributed Computing Column 58: Maurice Herlihy's 60th Birthday Celebration. SIGACT News 46(2): 78 (2015) - [j52]Jennifer L. Welch:
Distributed Computing Column 59: Resource-Competitive Algorithms. SIGACT News 46(3): 56 (2015) - [j51]Jennifer L. Welch:
Distributed Computing Column 60: Annual Review 2015. SIGACT News 46(4): 82-83 (2015) - [j50]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Time Complexity of Link Reversal Routing. ACM Trans. Algorithms 11(3): 18:1-18:39 (2015) - [c79]Edward Talmage, Jennifer L. Welch:
Generic Proofs of Consensus Numbers for Abstract Data Types. OPODIS 2015: 32:1-32:16 - [c78]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract). DISC 2015: 75-91 - 2014
- [j49]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Finding available parking spaces made easy. Ad Hoc Networks 12: 243-249 (2014) - [j48]Alejandro Cornejo, Saira Viqar, Jennifer L. Welch:
Reliable neighbor discovery for mobile ad hoc networks. Ad Hoc Networks 12: 259-277 (2014) - [j47]Jennifer L. Welch:
Distributed computing column 53: Dagstuhl seminar review: consistency in distributed systems. SIGACT News 45(1): 66 (2014) - [j46]Jennifer L. Welch:
Distributed computing column 54 transactional memory: models and algorithms. SIGACT News 45(2): 73 (2014) - [j45]Jennifer L. Welch:
Distributed computing column 55 WTTM 2013 review, and lower bounds for distributed quantum computing. SIGACT News 45(3): 71 (2014) - [j44]Jennifer L. Welch:
Distributed Computing Column 56 Annual Review 2014. SIGACT News 45(4): 86-88 (2014) - [c77]Hyun Chul Chung, Srikanth Sastry, Jennifer L. Welch:
Stabilizing Dining with Failure Locality 1. ICDCN 2014: 532-537 - [c76]Jiaqi Wang, Edward Talmage, Hyunyoung Lee, Jennifer L. Welch:
Improved Time Bounds for Linearizable Implementations of Abstract Data Types. IPDPS 2014: 691-701 - [c75]Edward Talmage, Jennifer L. Welch:
Improving Average Performance by Relaxing Distributed Data Structures. DISC 2014: 421-438 - 2013
- [j43]Saira Viqar, Jennifer L. Welch:
Deterministic collision free communication despite continuous motion. Ad Hoc Networks 11(1): 508-521 (2013) - [j42]Rebecca Ingram, Tsvetomira Radeva, Patrick Shields, Saira Viqar, Jennifer E. Walter, Jennifer L. Welch:
A leader election algorithm for dynamic networks with causal clocks. Distributed Comput. 26(2): 75-97 (2013) - [j41]Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, Jennifer L. Welch:
Reliable networks with unreliable sensors. Pervasive Mob. Comput. 9(2): 311-323 (2013) - [j40]Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder:
Link Reversal Routing with Binary Link Labels: Work Complexity. SIAM J. Comput. 42(2): 634-661 (2013) - [j39]Jennifer L. Welch:
Distributed computing column 52: annual review 2013. SIGACT News 44(4): 79-80 (2013) - [j38]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Dynamic regular registers in systems with churn. Theor. Comput. Sci. 512: 84-97 (2013) - 2012
- [j37]Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Failure detectors encapsulate fairness. Distributed Comput. 25(4): 313-333 (2012) - [c74]Hyun Chul Chung, Saira Viqar, Jennifer L. Welch:
Neighbor Knowledge of Mobile Nodes in a Road Network. ICDCS 2012: 486-495 - [c73]Silvia Bonomi, Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers. OPODIS 2012: 76-90 - [c72]Srikanth Sastry, Jennifer L. Welch, Josef Widder:
Wait-Free Stabilizing Dining Using Regular Registers. OPODIS 2012: 284-299 - 2011
- [b3]Jennifer L. Welch, Jennifer E. Walter:
Link Reversal Algorithms. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2011, ISBN 978-3-031-00878-8 - [j36]Cheng Shao, Jennifer L. Welch, Evelyn Pierce, Hyunyoung Lee:
Multiwriter Consistency Conditions for Shared Memory Registers. SIAM J. Comput. 40(1): 28-62 (2011) - [c71]Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Optimal regional consecutive leader election in mobile ad-hoc networks. FOMC 2011: 52-61 - [c70]Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, Jennifer L. Welch:
Reliable Networks with Unreliable Sensors. ICDCN 2011: 281-292 - [c69]Jiaqi Wang, Jennifer L. Welch, Hyunyoung Lee:
Time bounds for shared objects in partially synchronous systems. PODC 2011: 347-348 - [c68]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Full Reversal Routing as a Linear Dynamical System. SIROCCO 2011: 101-112 - [c67]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Partial is Full. SIROCCO 2011: 113-124 - [c66]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Brief announcement: full reversal routing as a linear dynamical system. SPAA 2011: 129-130 - [c65]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Dynamic Regular Registers in Systems with Churn. SSS 2011: 296-310 - [c64]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Quorum-based dynamic regular registers in systems with churn. TADDS 2011: 3-7 - 2010
- [j35]Khushboo Kanjani, Hyunyoung Lee, Whitney L. Maguffee, Jennifer L. Welch:
A simple Byzantine-fault-tolerant algorithm for a multi-writer regular register. Int. J. Parallel Emergent Distributed Syst. 25(5): 423-435 (2010) - [j34]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Scheduling Sensors by Tiling Lattices. Parallel Process. Lett. 20(1): 3-13 (2010) - [j33]Hagit Attiya, Alex Kogan, Jennifer L. Welch:
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 9(3): 361-375 (2010) - [c63]Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. ALGOSENSORS 2010: 89-91 - [c62]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Finding available parking spaces made easy. DIALM-PODC 2010: 49-52 - [c61]Alejandro Cornejo, Saira Viqar, Jennifer L. Welch:
Reliable neighbor discovery for mobile ad hoc networks. DIALM-PODC 2010: 63-72 - [c60]Hyun Chul Chung, Peter Robinson, Jennifer L. Welch:
Regional consecutive leader election in mobile ad-hoc networks. DIALM-PODC 2010: 81-90 - [c59]Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Failure Detectors Encapsulate Fairness. OPODIS 2010: 173-188 - [c58]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. SPAA 2010: 365 - [c57]Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Brief Announcement: Failure Detectors Encapsulate Fairness. DISC 2010: 389-391
2000 – 2009
- 2009
- [c56]Bernadette Charron-Bost, Jennifer L. Welch, Josef Widder:
Link Reversal: How to Play Better to Work Less. ALGOSENSORS 2009: 88-101 - [c55]Saira Viqar, Jennifer L. Welch:
Deterministic Collision Free Communication Despite Continuous Motion. ALGOSENSORS 2009: 218-229 - [c54]Alejandro Cornejo, Nancy A. Lynch, Saira Viqar, Jennifer L. Welch:
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer. Allerton 2009: 1460-1467 - [c53]Gautam Roy, Hyunyoung Lee, Jennifer L. Welch, Yuan Zhao, Vijitashwa Pandey, Deborah L. Thurston:
A distributed pool architecture for genetic algorithms. IEEE Congress on Evolutionary Computation 2009: 1177-1184 - [c52]Rebecca Ingram, Patrick Shields, Jennifer E. Walter, Jennifer L. Welch:
An asynchronous leader election algorithm for dynamic networks. IPDPS 2009: 1-12 - [c51]Khushboo Kanjani, Hyunyoung Lee, Jennifer L. Welch:
Byzantine fault-tolerant implementation of a multi-writer regular register. IPDPS 2009: 1-8 - [c50]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Crash fault detection in celerating environments. IPDPS 2009: 1-12 - [c49]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
The weakest failure detector for wait-free dining under eventual weak exclusion. SPAA 2009: 111-120 - [c48]Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder:
Routing without ordering. SPAA 2009: 145-153 - [c47]Lorenzo Alvisi, Rachid Guerraoui, Prasad Jayanti, Idit Keidar, Shay Kutten, Jennifer L. Welch:
The 2009 Edsger W. Dijkstra Prize in Distributed Computing. DISC 2009: 1-2 - [c46]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Crash-Quiescent Failure Detection. DISC 2009: 326-340 - 2008
- [c45]Hagit Attiya, Alex Kogan, Jennifer L. Welch:
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. ICDCS 2008: 321-328 - [c44]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Scheduling sensors by tilinglattices. PODC 2008: 437 - [c43]Hagit Attiya, Jennifer L. Welch:
A world of (Im) possibilities. PODC 2008: 461 - [i1]Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Scheduling Sensors by Tiling Lattices. CoRR abs/0806.1271 (2008) - 2006
- [j32]Andréa W. Richa, Jennifer L. Welch:
MONET Special Issue on Foundations of Mobile Computing. Mob. Networks Appl. 11(2): 119-120 (2006) - [j31]Shlomi Dolev, Elad Schiller, Jennifer L. Welch:
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks. IEEE Trans. Mob. Comput. 5(7): 893-905 (2006) - [c42]Faith Ellen, Sivaramakrishnan Subramanian, Jennifer L. Welch:
Maintaining Information About Nearby Processors in a Mobile Environment. ICDCN 2006: 193-202 - 2005
- [j30]Hyunyoung Lee, Jennifer L. Welch:
Randomized registers and iterative algorithms. Distributed Comput. 17(3): 209-221 (2005) - [j29]Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch:
GeoQuorums: implementing atomic memory in mobile ad hoc networks. Distributed Comput. 18(2): 125-155 (2005) - [j28]Yu Chen, Jennifer L. Welch:
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks. J. Parallel Distributed Comput. 65(9): 1072-1089 (2005) - [j27]Navneet Malpani, Yu Chen, Nitin H. Vaidya, Jennifer L. Welch:
Distributed Token Circulation in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 4(2): 154-165 (2005) - [c41]Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch:
Autonomous virtual mobile nodes. DIALM-POMC 2005: 62-69 - [c40]Yu Chen, Jennifer L. Welch:
Location-based broadcasting for dense mobile ad hoc networks. MSWiM 2005: 63-70 - [c39]Hagit Attiya, David Hay, Jennifer L. Welch:
Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. OPODIS 2005: 221-234 - [c38]Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch:
Autonomous virtual mobile nodes. SPAA 2005: 215 - 2004
- [b2]Hagit Attiya, Jennifer L. Welch:
Distributed computing - fundamentals, simulations, and advanced topics (2. ed.). Wiley series on parallel and distributed computing, Wiley 2004, ISBN 978-0-471-45324-6, pp. I-XV, 1-414 - [j26]