The following pages link to Nancy A. Lynch (Q660993):
Displaying 50 items.
- (Q518680) (redirect page) (← links)
- (Q1223165) (redirect page) (← links)
- (Q1575633) (redirect page) (← links)
- A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
- The impossibility of boosting distributed service resilience (Q550250) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- Modeling radio networks (Q661053) (← links)
- The abstract MAC layer (Q661062) (← links)
- Hybrid atomicity for nested transactions (Q672342) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Commutativity-based locking for nested transactions (Q753480) (← links)
- A technique for decomposing algorithms which use a single shared variable (Q800081) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Easy impossibility proofs for distributed consensus problems (Q1079947) (← links)
- A new fault-tolerant algorithm for clock synchronization (Q1104072) (← links)
- Introduction to the theory of nested transactions (Q1119399) (← links)
- On describing the behavior and implementation of distributed systems (Q1143167) (← links)
- Efficient searching using partial ordering (Q1151264) (← links)
- Straight-line program length as a parameter for complexity analysis (Q1151750) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Upper bounds for static resource allocation in a distributed system (Q1158747) (← links)
- Accessibility of values as a determinant of relative complexity in algebras (Q1167536) (← links)
- A lower bound for the time to assure interactive consistency (Q1168726) (← links)
- Optimal placement of identical resources in a tree (Q1184728) (← links)
- Using mappings to prove timing properties (Q1200918) (← links)
- Approximations to the halting problem (Q1214917) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- Complexity-class-encoding sets (Q1237360) (← links)
- Log space machines with multiple oracle tapes (Q1242686) (← links)
- A modular drinking philosophers algorithm (Q1261112) (← links)
- Liveness in timed and untimed systems (Q1271471) (← links)
- Timing conditions for linearizability in uniform counting networks (Q1292426) (← links)
- Eventually-serializable data services (Q1292429) (← links)
- Bounds on shared memory for mutual exclusion (Q1317423) (← links)
- Time bounds for real-time process control in the presence of timing uncertainty (Q1322471) (← links)
- Hybrid I/O automata. (Q1427865) (← links)
- Revisiting the PAXOS algorithm (Q1575634) (← links)
- Computing in additive networks with bounded-information codes (Q1664154) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- Action transducers and timed automata (Q1816917) (← links)
- A proof of the Kahn principle for input/output automata (Q1822994) (← links)
- Forward and backward simulations. I. Untimed Systems (Q1899913) (← links)
- Forward and backward simulations. II: Timing-based systems (Q1923088) (← links)
- A tradeoff between safety and liveness for randomized coordinated attack (Q1923091) (← links)
- Leader election using loneliness detection (Q1938387) (← links)
- GeoQuorums: implementing atomic memory in mobile ad hoc networks (Q1953643) (← links)
- On simple back-off in unreliable radio networks (Q2285148) (← links)
- Gradient clock synchronization (Q2375294) (← links)
- Consensus and collision detectors in radio networks (Q2377252) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
