The following pages link to Chryssis Georgiou (Q282238):
Displaying 35 items.
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Practically-self-stabilizing virtual synchrony (Q1635506) (← links)
- Cooperative computing with fragmentable and mergeable groups (Q1827289) (← links)
- Crowd computing as a cooperation problem: An evolutionary approach (Q1953122) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) (← links)
- Fragmented objects: boosting concurrency of shared large objects (Q2117716) (← links)
- Confidential gossip (Q2204776) (← links)
- Online parallel scheduling of non-uniform tasks: trading failures for energy (Q2348044) (← links)
- Long-lived RAMBO: trading knowledge for communication (Q2383603) (← links)
- Adaptive packet scheduling over a wireless channel under constrained jamming (Q2401762) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy (Q2842781) (← links)
- On the complexity of asynchronous gossip (Q2934340) (← links)
- Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts (Q3095325) (← links)
- (Q3396596) (← links)
- Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming (Q3467851) (← links)
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory (Q3540237) (← links)
- Work-competitive scheduling for cooperative computing with dynamic groups (Q3581245) (← links)
- (Q4436048) (← links)
- The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)
- Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems (Q5145206) (← links)
- A distributed algorithm for gathering many fat mobile robots in the plane (Q5176102) (← links)
- Meeting the deadline (Q5176203) (← links)
- Self-stabilizing Virtual Synchrony (Q5207915) (← links)
- Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing (Q5268367) (← links)
- Structural Information and Communication Complexity (Q5315225) (← links)
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups (Q5317178) (← links)
- (Q5394311) (← links)
- Asynchronous gossip (Q5395710) (← links)
- A formal treatment of an abstract channel implementation using java sockets and TCP (Q5401445) (← links)
- Brief announcement (Q5891979) (← links)
- Distributed Computing (Q5897410) (← links)
- Selfish routing in the presence of network uncertainty (Q6483527) (← links)
