The following pages link to Jennifer Lundelius Welch (Q578902):
Displaying 49 items.
- (Q223034) (redirect page) (← links)
- (Q1361414) (redirect page) (← links)
- Time bounds on synchronization in a periodic distributed system (Q287245) (← links)
- A leader election algorithm for dynamic networks with causal clocks (Q360270) (← links)
- Dynamic regular registers in systems with churn (Q392005) (← links)
- Simulating synchronous processors (Q578903) (← links)
- Transaction commit in a realistic timing model (Q913533) (← links)
- A new fault-tolerant algorithm for clock synchronization (Q1104072) (← links)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
- A modular drinking philosophers algorithm (Q1261112) (← links)
- Wait-free clock synchronization (Q1361415) (← links)
- One-write algorithms for multivalued regular and atomic registers (Q1591045) (← links)
- Closed form bounds for clock synchronization under simple uncertainty assumptions (Q1603375) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract) (Q1664131) (← links)
- Connection management without retaining information (Q1908343) (← links)
- Failure detectors encapsulate fairness (Q1938374) (← links)
- Randomized registers and iterative algorithms (Q1953240) (← links)
- Anomalies and similarities among consensus numbers of variously-relaxed queues (Q2218476) (← links)
- Relaxed data types as consistency conditions (Q2283840) (← links)
- Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks (Q2565705) (← links)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (Q2672251) (← links)
- Link Reversal Routing with Binary Link Labels: Work Complexity (Q2840988) (← links)
- Multiwriter Consistency Conditions for Shared Memory Registers (Q2999853) (← links)
- Self-stabilizing clock synchronization in the presence of Byzantine faults (Q3069909) (← links)
- Crash-Quiescent Failure Detection (Q3646235) (← links)
- Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)
- A competitive analysis for retransmission timeout (Q4262699) (← links)
- Bounds on the Costs of Multivalued Register Implementations (Q4291561) (← links)
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies (Q4388863) (← links)
- (Q4398822) (← links)
- The Impact of Timing Knowledge on the Session Problem (Q4429670) (← links)
- (Q4474124) (← links)
- Time Complexity of Link Reversal Routing (Q4962176) (← links)
- Relaxed Data Types as Consistency Conditions (Q5045438) (← links)
- Implementing ♢P with Bounded Messages on a Network of <i>ADD</i> Channels (Q5087848) (← links)
- (Q5091071) (← links)
- Shared memory and the Bakery algorithm (Q5133666) (← links)
- Using adaptive timeouts to achieve at-most-once message delivery (Q5137010) (← links)
- Distributed reconfiguration of metamorphic robot chains (Q5138512) (← links)
- How Fast Reads Affect Multi-Valued Register Simulations (Q5145209) (← links)
- Distributed reconfiguration of metamorphic robot chains (Q5176782) (← links)
- The impact of time on the session problem (Q5348851) (← links)
- Wait-free clock synchronization (Q5361370) (← links)
- Generic Proofs of Consensus Numbers for Abstract Data Types. (Q5363823) (← links)
- Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement (Q5855205) (← links)
- Distributed Computing (Q5897403) (← links)
- A mutual exclusion algorithm for ad hoc mobile networks (Q5952558) (← links)
- (Q6083367) (← links)
- Scheduling sensors by tiling lattices (Q6483538) (← links)
