default search action
Jennifer 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
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
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
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
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
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
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
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
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
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
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
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
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
Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. OPODIS 2005: 221-234 - [c38]Shlomi Dolev
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]Jennifer E. Walter, Jennifer L. Welch, Nancy M. Amato:
Distributed reconfiguration of metamorphic robot chains. Distributed Comput. 17(2): 171-189 (2004) - [j25]Shlomi Dolev
Self-stabilizing clock synchronization in the presence of Byzantine faults. J. ACM 51(5): 780-799 (2004) - [c37]Guangtong Cao, Jennifer L. Welch:
Accurate Multihop Clock Synchronization in Mobile Ad Hoc Networks. ICPP Workshops 2004: 13-20 - [c36]Shlomi Dolev
Brief announcement: virtual mobile nodes for mobile ad hoc networks. PODC 2004: 385 - [c35]Shlomi Dolev, Seth Gilbert
Virtual Mobile Nodes for Mobile Ad Hoc Networks. DISC 2004: 230-244 - 2003
- [j24]Hyunyoung Lee, Jennifer L. Welch, Nitin H. Vaidya:
Location tracking using quorums in mobile ad hoc networks. Ad Hoc Networks 1(4): 371-381 (2003) - [j23]Injong Rhee, Jennifer L. Welch:
The Impact of Timing Knowledge on the Session Problem. SIAM J. Comput. 32(4): 1007-1039 (2003) - [c34]Cheng Shao, Evelyn Pierce, Jennifer L. Welch:
Multi-writer Consistency Conditions for Shared Memory Objects. DISC 2003: 106-120 - [c33]Shlomi Dolev, Seth Gilbert
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks. DISC 2003: 306-320 - 2002
- [j22]Jennifer E. Walter, Jennifer L. Welch, Nancy M. Amato:
Concurrent metamorphosis of hexagonal robot chains into simple connected configurations. IEEE Trans. Robotics Autom. 18(6): 945-956 (2002) - [c32]Yu Chen, Jennifer L. Welch:
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks. DIAL-M 2002: 34-42 - [c31]Shlomi Dolev
Random walk for self-stabilitzing group communication in ad hoc networks. PODC 2002: 259 - [c30]Shlomi Dolev
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks. SRDS 2002: 70-79 - 2001
- [j21]Saad Biaz, Jennifer L. Welch:
Closed form bounds for clock synchronization under simple uncertainty assumptions. Inf. Process. Lett. 80(3): 151-157 (2001) - [j20]Jennifer E. Walter, Jennifer L. Welch, Nitin H. Vaidya:
A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. Wirel. Networks 7(6): 585-600 (2001) - [c29]Hyunyoung Lee, Jennifer L. Welch:
Applications of Probabilistic Quorums to Iterative Algorithms. ICDCS 2001: 21-28 - [c28]Navneet Malpani, Nitin H. Vaidya, Jennifer L. Welch:
Distributed Token Circulation on Mobile Ad Hoc Networks. ICNP 2001: 4-13 - [c27]Hyunyoung Lee, Jennifer L. Welch:
Randomized Shared Queues Applied to Distributed Optimization Algorithms. ISAAC 2001: 587-598 - [c26]Hyunyoung Lee, Jennifer L. Welch:
Randomized shared queues. PODC 2001: 311-313 - [e2]Jennifer L. Welch:
Distributed Computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001, Proceedings. Lecture Notes in Computer Science 2180, Springer 2001, ISBN 3-540-42605-1 [contents] - 2000
- [j19]Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
One-write algorithms for multivalued regular and atomic registers. Acta Informatica 37(3): 161-192 (2000) - [c25]Navneet Malpani, Jennifer L. Welch, Nitin H. Vaidya:
Leader election algorithms for mobile ad hoc networks. DIAL-M 2000: 96-103 - [c24]Jennifer E. Walter, Jennifer L. Welch, Nancy M. Amato:
Distributed reconfigurtion of metamorphic robot chains. PODC 2000: 171-180 - [c23]Hyunyoung Lee, Jennifer L. Welch:
Specification, implementation and application of randomized regular registers (brief announcement). PODC 2000: 338
1990 – 1999
- 1999
- [j18]Shlomi Dolev, Michael Kate, Jennifer L. Welch:
A competitive analysis for retransmission timeout. Networks 34(1): 73-80 (1999) - [e1]Brian A. Coan, Jennifer L. Welch:
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, PODC, '99Atlanta, Georgia, USA, May 3-6, 1999. ACM 1999, ISBN 1-58113-099-6 [contents] - 1998
- [j17]Hagit Attiya
Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. SIAM J. Comput. 27(1): 65-89 (1998) - 1997
- [j16]Shlomi Dolev
Wait-Free Clock Synchronization. Algorithmica 18(4): 486-511 (1997) - [j15]Injong Rhee, Jennifer L. Welch:
Time Bounds on Synchronization in a Periodic Distributed System. Inf. Process. Lett. 64(2): 87-93 (1997) - [j14]Shlomi Dolev
Crash Resilient Communication in Dynamic Networks. IEEE Trans. Computers 46(1): 14-26 (1997) - [c22]Jennifer E. Walter, Jennifer L. Welch:
Hazard-Free Connection Release. PDPTA 1997: 1668-1672 - 1996
- [j13]Shlomi Dolev
Modified tree structure for location management in mobile environments. Comput. Commun. 19(4): 335-345 (1996) - [j12]Hosame Abu-Amara, Brian A. Coan, Shlomi Dolev
Self-stabilizing topology maintenance protocols for high-speed networks. IEEE/ACM Trans. Netw. 4(6): 902-912 (1996) - [c21]Sundar Kanthadai, Jennifer L. Welch:
Implementation of Recoverable Distributed Shared Memory by Logging Writes. ICDCS 1996: 116-124 - [c20]Soma Chaudhuri, Sundar Kanthadai, Jennifer L. Welch:
The Role of Data-Race-Free Programs in Recoverable DSM (Abstract). PODC 1996: 245 - 1995
- [j11]Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch:
Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery. Distributed Comput. 9(3): 109-117 (1995) - [j10]Hagit Attiya
Connection Management Without Retaining Information. Inf. Comput. 123(2): 155-171 (1995) - [c19]Hagit Attiya, Shlomi Dolev
Connection management without retaining information. HICSS (2) 1995: 622-634 - [c18]Shlomi Dolev
A Competitive Analysis for Retransmission Timeout. ICDCS 1995: 450-455 - [c17]Shlomi Dolev, Dhiraj K. Pradhan, Jennifer L. Welch:
Modified Tree Structure for Location Management in Mobile Environments. INFOCOM 1995: 530-537 - [c16]Injong Rhee, Jennifer L. Welch:
On the Time Complexity of the Dining Philosophers Problem. PDPTA 1995: 795-804 - [c15]Shlomi Dolev
Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults (Abstract). PODC 1995: 256 - 1994
- [j9]Soma Chaudhuri, Jennifer L. Welch:
Bounds on the Costs of Multivalued Register Implementations. SIAM J. Comput. 23(2): 335-354 (1994) - [j8]Hagit Attiya
Sequential Consistency versus Linearizability. ACM Trans. Comput. Syst. 12(2): 91-122 (1994) - 1993
- [j7]Jennifer L. Welch, Nancy A. Lynch:
A Modular Drinking Philosophers Algorithm. Distributed Comput. 6(4): 233-244 (1993) - [j6]Brian A. Coan, Jennifer L. Welch:
Modular Cosntruction of an Efficient 1-Bit Byzantine Agreement Protocol. Math. Syst. Theory 26(1): 131-154 (1993) - [c14]Shlomi Dolev
Wait-Free Clock Synchronization (Extended Abstract). PODC 1993: 97-108 - [c13]Hagit Attiya
Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. SPAA 1993: 241-250 - [c12]Shlomi Dolev, Jennifer L. Welch:
Crash Resilient Communication in Dynamic Networks (Preliminary Version). WDAG 1993: 129-144 - 1992
- [j5]Brian A. Coan, Jennifer L. Welch:
Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity. Inf. Comput. 97(1): 61-85 (1992) - [c11]Injong Rhee, Jennifer L. Welch:
The Impact of Time on the Session Problem. PODC 1992: 191-202 - 1991
- [c10]Hagit Attiya, Jennifer L. Welch:
Sequential Consistency Versus Linearizability (Extended Abstract). SPAA 1991: 304-315 - [c9]Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
Upper and lower bounds for one-write multivalued regular registers. SPDP 1991: 134-141 - [c8]Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch:
Using Adaptive Timeouts to Achive At-Most-Once Message Delivery. WDAG 1991: 151-166 - 1990
- [j4]Brian A. Coan, Jennifer L. Welch:
Transaction Commit in a Realistic Timing Model. Distributed Comput. 4: 87-103 (1990) - [c7]Soma Chaudhuri, Jennifer L. Welch:
Bounds on the Costs of Register Implementations. WDAG 1990: 402-421
1980 – 1989
- 1989
- [c6]A. Prasad Sistla, Jennifer L. Welch:
Efficient Distributed Recovery Using Message Logging. PODC 1989: 223-238 - [c5]Brian A. Coan, Jennifer L. Welch:
Modular Construction of Nearly Optimal Byzantine Agreement Protocols. PODC 1989: 295-305 - 1988
- [b1]Jennifer L. Welch:
Topics in distributed computing: the impact of partial synchrony, and modular decomposition of algorithms. Massachusetts Institute of Technology, Cambridge, MA, USA, 1988 - [j3]Jennifer L. Welch, Nancy A. Lynch:
A New Fault-Tolerance Algorithm for Clock Synchronization. Inf. Comput. 77(1): 1-36 (1988) - [c4]Jennifer L. Welch, Leslie Lamport, Nancy A. Lynch:
A Lattice-Structured Proof of a Minimum Spanning. PODC 1988: 28-43 - 1987
- [j2]Jennifer L. Welch:
Simulating Synchronous Processors. Inf. Comput. 74(2): 159-170 (1987) - 1986
- [c3]Barbara Simons, Jennifer L. Welch, Nancy A. Lynch:
An Overview of Clock Synchronization. Fault-Tolerant Distributed Computing 1986: 84-96 - [c2]Brian A. Coan, Jennifer Lundelius:
Transaction Commit in a Realistic Fault Model. PODC 1986: 40-51 - 1984
- [j1]Jennifer Lundelius, Nancy A. Lynch:
An Upper and Lower Bound for Clock Synchronization. Inf. Control. 62(2/3): 190-204 (1984) - [c1]Jennifer Lundelius, Nancy A. Lynch:
A New Fault-Tolerant Algorithm for Clock Synchronization. PODC 1984: 75-88
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 19:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: