The following pages link to Amos Israeli (Q293173):
Displaying 22 items.
- The time complexity of updating snapshot memories (Q293175) (← links)
- On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems (Q958309) (← links)
- An approximation algorithm for sequential rectangle placement (Q975504) (← links)
- An improved parallel algorithm for maximal matching (Q1073571) (← links)
- A fast and simple randomized parallel algorithm for maximal matching (Q1073573) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- On the existence of polynomial time algorithms for interpolation problems in propositional logic (Q1118581) (← links)
- Bounded time-stamps (Q1261108) (← links)
- Self-stabilization of dynamic systems assuming only read/write atomicity (Q1310562) (← links)
- Uniform self-stabilizing ring orientation (Q2366560) (← links)
- Time and space optimal implementations of atomic multi-writer register (Q2486400) (← links)
- Multiple Communication in Multihop Radio Networks (Q3137713) (← links)
- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems (Q3527248) (← links)
- (Q4266509) (← links)
- (Q4266514) (← links)
- Resource Bounds for Self-Stabilizing Message-Driven Protocols (Q4337445) (← links)
- (Q4385172) (← links)
- Linear-time snapshot implementations in unbalanced systems (Q4850334) (← links)
- Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
- Resource bounds for self stabilizing message driven protocols (Q5255827) (← links)
- Optimal multi-writer multi-reader atomic register (Q5348836) (← links)
- Disjoint-access-parallel implementations of strong shared memory primitives (Q5361405) (← links)
