The following pages link to Hagit Attiya (Q216138):
Displaying 50 items.
- (Q77616) (redirect page) (← links)
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- Transactional scheduling for read-dominated workloads (Q456006) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Highly concurrent multi-word synchronization (Q631787) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Combining shared-coin algorithms (Q666060) (← links)
- A single-version STM that is multi-versioned permissive (Q693077) (← links)
- Inherent limitations on disjoint-access parallel implementations of transactional memory (Q693754) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Language complexity on the synchronous anonymous ring (Q1102125) (← links)
- Using mappings to prove timing properties (Q1200918) (← links)
- Efficient elections in chordal ring networks (Q1262125) (← links)
- Time bounds for real-time process control in the presence of timing uncertainty (Q1322471) (← links)
- Limitations of fast consistency conditions for distributed shared memories (Q1351602) (← links)
- Lower bound on the step complexity of anonymous binary consensus (Q1660942) (← links)
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract) (Q1664131) (← links)
- Computing in totally anonymous asynchronous shared memory systems (Q1854512) (← links)
- Quantifying rollback propagation in distributed checkpointing (Q1881277) (← links)
- Connection management without retaining information (Q1908343) (← links)
- Efficient adaptive collect using randomization (Q1953647) (← links)
- Specification and space complexity of collaborative text editing (Q2220887) (← links)
- Practically stabilizing SWMR atomic memory in message-passing systems (Q2256720) (← links)
- Built-in coloring for highly-concurrent doubly-linked lists (Q2392250) (← links)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (Q2672251) (← links)
- (Q2766870) (← links)
- Adaptive and Efficient Algorithms for Lattice Agreement and Renaming (Q2784474) (← links)
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract) (Q2790117) (← links)
- Trading Fences with RMRs and Separating Memory Models (Q2796254) (← links)
- Limitations of Highly-Available Eventually-Consistent Data Stores (Q2796275) (← links)
- Lower Bounds for Restricted-Use Objects (Q2812146) (← links)
- Time-adaptive algorithms for synchronization (Q2817676) (← links)
- Faster than optimal snapshots (for a while) (Q2933814) (← links)
- Lower bounds for randomized consensus under a weak adversary (Q2934356) (← links)
- Randomized consensus in expected O(n log n) individual work (Q2934357) (← links)
- Universal operations (Q2942736) (← links)
- Structured Derivation of Semi-Synchronous Algorithms (Q3095340) (← links)
- The Combinatorial Structure of Wait-Free Solvable Tasks (Q3149868) (← links)
- Characterizing Transactional Memory Consistency Conditions Using Observational Refinement (Q3177890) (← links)
- Improved implementations of binary universal operations (Q3196625) (← links)
- (Q3300815) (← links)
- (Q3300819) (← links)
- Better computing on the anonymous ring (Q3361868) (← links)
- Tight bounds for asynchronous randomized consensus (Q3452186) (← links)
- The complexity of obstruction-free implementations (Q3452220) (← links)
- Algorithms adapting to point contention (Q3452498) (← links)
- Renaming in an asynchronous environment (Q3477940) (← links)
- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists (Q3524292) (← links)
- Randomization Does Not Reduce the Average Delay in Parallel Packet Switches (Q3532579) (← links)
- (Q3549610) (← links)
