The following pages link to P. G. Spirakis (Q389952):
Displaying 50 items.
- Mathematical Foundations of Computer Science 2003 (Q5431343) (← links)
- Full and Local Information in Distributed Decision Making (Q5443380) (← links)
- The Survival of the Weakest in Networks (Q5443530) (← links)
- Optimal Algorithms for Detecting Network Stability (Q5452165) (← links)
- Approximate Equilibria for Strategic Two Person Games (Q5459968) (← links)
- Atomic Congestion Games: Fast, Myopic and Concurrent (Q5459977) (← links)
- Algorithms – ESA 2004 (Q5464573) (← links)
- Automata, Languages and Programming (Q5466497) (← links)
- Automata, Languages and Programming (Q5466535) (← links)
- Information Security (Q5493158) (← links)
- Experimental and Efficient Algorithms (Q5710018) (← links)
- Experimental and Efficient Algorithms (Q5710030) (← links)
- Experimental and Efficient Algorithms (Q5710075) (← links)
- Automata, Languages and Programming (Q5716819) (← links)
- (Q5743450) (← links)
- The Price of Defense (Q5756681) (← links)
- Distributed Computation and Reconfiguration in Actively Dynamic Networks (Q5855270) (← links)
- Simple and efficient local codes for distributed stable network construction (Q5892129) (← links)
- Theoretical Computer Science (Q5897347) (← links)
- Algorithms and Computation (Q5897862) (← links)
- Algorithms and Computation (Q5897882) (← links)
- Algorithms and Computation (Q5897916) (← links)
- Approximation and Online Algorithms (Q5898471) (← links)
- The temporal explorer who returns to the base (Q5918316) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Threshold-based network structural dynamics (Q5918636) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
- Connected subgraph defense games (Q5919367) (← links)
- The temporal explorer who returns to the base (Q5919395) (← links)
- Connected subgraph defense games (Q5925537) (← links)
- Threshold-based network structural dynamics (Q5925585) (← links)
- Robust parallel computations through randomization (Q5929026) (← links)
- STEPS: Supporting traditional education procedures --- A TCP/IP multimedia networks-based model (Q5960081) (← links)
- Fault tolerant network constructors (Q6044462) (← links)
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
- Selected combinatorial problems through the prism of random intersection graphs models (Q6057306) (← links)
- Distributed protocols against mobile eavesdroppers (Q6084554) (← links)
- Efficient parallel algorithms for some tree layout problems (Q6085718) (← links)
- The complexity of growing a graph (Q6112002) (← links)
- (Q6147529) (← links)
- The Complexity of Transitively Orienting Temporal Graphs (Q6168495) (← links)
- Strategic Contention Resolution in Multiple Channels (Q6307999) (← links)
- Scheduling algorithms for strict multithreaded computations (Q6487460) (← links)
- Crystal structure prediction via oblivious local search (Q6487612) (← links)
- On the existence of $\delta$-temporal cliques in random simple temporal graphs (Q6530057) (← links)
- Fault tolerant network constructors (Q6536337) (← links)
- The contest game for crowdsourcing reviews (Q6546279) (← links)
- Which is the worst-case Nash equilibrium? (Q6552473) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6584065) (← links)
- Approximate and randomized algorithms for computing a second Hamiltonian cycle (Q6614106) (← links)
