The following pages link to P. G. Spirakis (Q389952):
Displaying 50 items.
- Stably Computing Order Statistics with Arithmetic Population Protocols (Q4608631) (← links)
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing (Q4632452) (← links)
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175) (← links)
- (Q4668736) (← links)
- Connectivity Preserving Network Transformers (Q4686658) (← links)
- (Q4694726) (← links)
- (Q4708560) (← links)
- (Q4727428) (← links)
- (Q4737150) (← links)
- (Q4785581) (← links)
- (Q4788605) (← links)
- (Q4791664) (← links)
- (Q4813181) (← links)
- Tail bounds for occupancy and the satisfiability threshold conjecture (Q4847396) (← links)
- On the Hardness of Network Design for Bottleneck Routing Games (Q4910942) (← links)
- Playing a Game to Bound the Chromatic Number (Q4923951) (← links)
- Potential Functions in Strategic Games (Q4928493) (← links)
- (Q4934338) (← links)
- Atomic congestion games among coalitions (Q4962757) (← links)
- Temporal Vertex Cover with a Sliding Time Window (Q5002837) (← links)
- The Price of Stability of Weighted Congestion Games (Q5002839) (← links)
- The Dynamics and Stability of Probabilistic Population Processes (Q5045431) (← links)
- Cover Time in Edge-Uniform Stochastically-Evolving Graphs (Q5045453) (← links)
- Efficient parallel algorithms for shortest paths in planar graphs (Q5056111) (← links)
- Beyond Rings: Gathering in 1-Interval Connected Graphs (Q5087065) (← links)
- On Verifying and Maintaining Connectivity of Interval Temporal Networks (Q5087856) (← links)
- (Q5089192) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs (Q5092333) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q5096905) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- On the Transformation Capability of Feasible Mechanisms for Programmable Matter (Q5111468) (← links)
- Determining Majority in Networks with Local Interactions and Very Small Local Memory (Q5167799) (← links)
- The price of selfish routing (Q5176009) (← links)
- The Match-Maker: Constant-Space Distributed Majority via Random Walks (Q5207899) (← links)
- The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
- CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS (Q5249039) (← links)
- Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values (Q5283386) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312959) (← links)
- Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control (Q5317193) (← links)
- Efficient Methods for Selfish Network Design (Q5321677) (← links)
- A Guided Tour in Random Intersection Graphs (Q5327420) (← links)
- Temporal Network Optimization Subject to Connectivity Constraints (Q5327473) (← links)
- Strong Bounds for Evolution in Networks (Q5327474) (← links)
- Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract) (Q5361477) (← links)
- On the fixation probability of superstars (Q5362160) (← links)
- Population Protocols and Related Models (Q5391113) (← links)
- Probabilistic Data Propagation in Wireless Sensor Networks (Q5391121) (← links)
- Game authority for robust andscalable distributed selfish-computer systems (Q5401460) (← links)
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (Q5428842) (← links)
