A glimpse at Paul G. Spirakis
From MaRDI portal
Publication:3464465
Recommendations
Cites work
- scientific article; zbMATH DE number 1302022 (Why is no real title available?)
- scientific article; zbMATH DE number 1956217 (Why is no real title available?)
- scientific article; zbMATH DE number 1848400 (Why is no real title available?)
- A note on approximate Nash equilibria
- Algorithms for pure Nash equilibria in weighted congestion games
- An introduction to temporal graphs: an algorithmic perspective
- Approximate equilibria and ball fusion
- Approximating fixation probabilities in the generalized Moran process
- Atomic Congestion Games Among Coalitions
- Attack propagation in networks
- Automata, Languages and Programming
- BSP versus LogP
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Characterizing the existence of potential functions in weighted congestion games
- Competitive call control in mobile networks
- Computation in networks of passively mobile finite-state sensors
- Computing in dynamic networks
- Connectivity and inference problems for temporal networks
- Connectivity preserving network transformers
- Determining majority in networks with local interactions and very small local memory
- Distributed communication algorithms for ad hoc mobile networks.
- Efficient methods for selfish network design
- Efficient parallel algorithms for shortest paths in planar digraphs
- Efficient scheduling of strict multithreaded computations
- Expected parallel time and sequential space complexity of graph and digraph problems
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
- Mediated population protocols
- Naming and counting in anonymous unknown dynamic networks
- Natural models for evolution on networks
- Non-cooperative games
- On convergence and threshold properties of discrete Lotka-Volterra population protocols
- On the performance of approximate equilibria in congestion games
- On the random generation and counting of matchings in dense graphs
- Optimal parallel randomized algorithms for sparse addition and identification
- Parallel Complexity of the Connected Subgraph Problem
- Passively mobile communicating machines that use restricted space
- Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- Radiocoloring in planar graphs: Complexity and approximations
- Random bimatrix games are asymptotically easy to solve (a simple proof)
- Real-Time Synchronization of Interprocess Communications
- Selfish unsplittable flows
- Settling the complexity of computing two-player Nash equilibria
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Temporal network optimization subject to connectivity constraints
- The complexity of computing a Nash equilibrium
- The impact of network structure on the stability of greedy protocols
- The impact of social ignorance on weighted congestion games
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- The price of selfish routing
- The structure and complexity of Nash equilibria for a selfish routing game
- Traveling salesman problems in temporal graphs
- Two-person nonzero-sum games and quadratic programming
- Unbounded Speed Variability in Distributed Communications Systems
This page was built for publication: A glimpse at Paul G. Spirakis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464465)
