The following pages link to Mohamed G. Gouda (Q701150):
Displayed 50 items.
- (Q555312) (redirect page) (← links)
- Nash equilibria in stabilizing systems (Q555314) (← links)
- Stabilization of general loop-free routing (Q701151) (← links)
- Stabilization of max-min fair networks without per-flow state (Q719297) (← links)
- Structured firewall design (Q865685) (← links)
- The instability of self-stabilization (Q913475) (← links)
- Stabilizing unison (Q915420) (← links)
- On the minimum requirements for independent recovery in distributed systems (Q922672) (← links)
- Hop chains: Secure routing and the establishment of distinct identities (Q1004311) (← links)
- Unboundedness detection for a class of communicating finite-state machines (Q1054479) (← links)
- Atomic semantics of nonatomic programs (Q1111361) (← links)
- A criterion for atomicity (Q1192605) (← links)
- Stabilization and pseudo-stabilization (Q1310567) (← links)
- Convergence of iteration systems (Q1310569) (← links)
- Rankers: A classification of synchronization problems (Q1314537) (← links)
- Stabilizing observers (Q1336742) (← links)
- A secure address resolution protocol. (Q1398819) (← links)
- Elements of security: Closure, convergence, and protection (Q1607088) (← links)
- A state-based model of sensor protocols (Q1758154) (← links)
- The Austin Protocol Compiler. (Q1768948) (← links)
- Memory requirements for silent stabilization (Q1818300) (← links)
- The stabilizing token ring in three bits (Q1923395) (← links)
- The alternator (Q1954228) (← links)
- Policy expressions and the bottom-up design of computing policies (Q2218472) (← links)
- Hop integrity in the internet. A defense against denial-of-service attacks. (Q2388834) (← links)
- Key bundles and parcels: secure communication in many groups (Q2507273) (← links)
- A new explanation of the glitch phenomenon (Q2641279) (← links)
- SPP: An anti-phishing single password protocol (Q2643220) (← links)
- (Q3216146) (← links)
- Synthesis of Communicating Finite-State Machines with Guaranteed Progress (Q3219124) (← links)
- Closed Covers: To Verify Progress for Communicating Finite State Machines (Q3339299) (← links)
- (Q3357516) (← links)
- On the Power of Non-spoofing Adversaries (Q3588320) (← links)
- Priority Networks of Communicating Finite State Machines (Q3677157) (← links)
- On "A Simple Protocol Whose Proof Isńt": The State Machine Approach (Q3688295) (← links)
- Proving Liveness and Termination of Systolic Arrays Using Communicating Finite State Machines (Q3690225) (← links)
- Protocol validation by fair progress state exploration (Q3696532) (← links)
- On the progress of communication between two finite state machines (Q3719838) (← links)
- Proving liveness for networks of communicating finite state machines (Q3723681) (← links)
- (Q3780411) (← links)
- Deadlock Detection for a Class of Communicating Finite State Machines (Q3962470) (← links)
- (Q3975147) (← links)
- (Q4259988) (← links)
- The elusive atomic register (Q4299010) (← links)
- Distributed reset (Q4419757) (← links)
- (Q4446599) (← links)
- (Q4446603) (← links)
- (Q4446604) (← links)
- (Q4457211) (← links)
- (Q4457230) (← links)