A Glimpse at Paul G. Spirakis

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Algorithms, Probability, Networks, and Games

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-24024-4_1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient robust parallel computations

  2018cited by this paper
• Connectivity preserving network transformers

  2015cited by this paper
• Computing in Dynamic Networks ?

  2015cited by this paper
• Competitive call control in mobile networks

  2015cited by this paper
• An Introduction to Temporal Graphs: An Algorithmic Perspective*

  2015cited by this paper
• On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

  2015cited by this paper
• An Empirical Study of Finding Approximate Equilibria in Bimatrix Games

  2015cited by this paper
• Ephemeral networks with random availability of links: diameter and connectivity

  2014cited by this paper
• Traveling salesman problems in temporal graphs

  2014cited by this paper
• Simple and efficient local codes for distributed stable network construction

  2013cited by this paper
• Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3

  2013cited by this paper
• Terminating population protocols via some minimal global knowledge assumptions

  2012cited by this paper
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks

  2012cited by this paper
• Approximate Well-supported Nash Equilibria Below Two-thirds

  2012cited by this paper
• Naming and Counting in Anonymous Unknown Dynamic Networks

  2012cited by this paper
• Expected parallel time and sequential space complexity of graph and digraph problems

  2011cited by this paper
• Approximating Fixation Probabilities in the Generalized Moran Process

  2011cited by this paper
• Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)

  2011cited by this paper
• Approximability of Symmetric Bimatrix Games and Related Experiments

  2011cited by this paper
• New Models for Population Protocols

  2011cited by this paper
• Passively mobile communicating machines that use restricted space

  2010cited by this paper
• Mediated Population Protocols

  2009cited by this paper
• Epidemic Routing for Partially-Connected Ad Hoc Networks

  2009cited by this paper
• The Impact of Social Ignorance on Weighted Congestion Games

  2009cited by this paper
• Efficient methods for selfish network design

  2009cited by this paper
• The complexity of computing a Nash equilibrium

  2009cited by this paper
• Characterizing the Existence of Potential Functions in Weighted Congestion Games

  2009cited by this paper
• Performance Evaluation of a Descent Algorithm for Bi-matrix Games

  2008cited by this paper
• On the Performance of Approximate Equilibria in Congestion Games

  2008cited by this paper
• Alternation and redundancy analysis of the intersection problem

  2008cited by this paper
• Large independent sets in general random intersection graphs

  2008cited by this paper
• Delay-Tolerant Networking Architecture

  2007cited by this paper
• Settling the complexity of computing two-player Nash equilibria

  2007cited by this paper
• Integrated Project Member of the FET Proactive Initiative Complex Systems DELIS-TR-537 An Optimization Approach for Approximate Nash Equilibria

  2007influential reference
• Algorithms for pure Nash equilibria in weighted congestion games

  2007cited by this paper
• A note on approximate Nash equilibria

  2006cited by this paper
• Atomic congestion games among coalitions

  2006cited by this paper
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

  2006cited by this paper
• Polynomial algorithms for approximating Nash equilibria of bimatrix games

  2006cited by this paper
• Selfish unsplittable flows

  2005cited by this paper
• Games of fixed rank: a hierarchy of bimatrix games

  2005cited by this paper
• Radiocoloring in planar graphs: Complexity and approximations

  2005cited by this paper
• Computation in networks of passively mobile finite-state sensors

  2004cited by this paper
• The Best Nurturers in Computer Science Research

  2004cited by this paper
• SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks

  2004cited by this paper
• Satisfiability Threshold of the Skewed Random k-SAT

  2004cited by this paper
• Distributed communication algorithms for ad hoc mobile networks

  2003cited by this paper
• A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks

  2003cited by this paper
• The Impact of Network Structure on the Stability of Greedy Protocols

  2003cited by this paper
• Approximate Equilibria and Ball Fusion

  2003cited by this paper
• NanoPeer networks and P2P worlds

  2003cited by this paper
• Smart dust protocols for local detection and propagation

  2002cited by this paper
• The structure and complexity of Nash equilibria for a selfish routing game

  2002cited by this paper
• An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks

  2001cited by this paper
• Attack Propagation in Networks

  2001cited by this paper
• The Price of Selfish Routing

  2001cited by this paper
• Stability and non-stability of the FIFO protocol

  2001cited by this paper
• Efficient Scheduling of Strict Multithreaded Computations

  2000cited by this paper
• Distributed Algorithm Engineering

  2000cited by this paper
• Connectivity and inference problems for temporal networks

  2000cited by this paper
• Counting in Mobile Networks: Theory and Experimentation

  1999cited by this paper
• BSP versus LogP

  1999cited by this paper
• Fundamental control algorithms in mobile networks

  1999cited by this paper
• On the Random Generation and Counting of Matchings in Dense Graphs

  1998cited by this paper
• A Hamiltonian Approach to the Assignment of Non-reusable Frequencies

  1998cited by this paper
• Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems

  1994cited by this paper
• Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing

  1994cited by this paper
• Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays

  1993cited by this paper
• Parallel Complexity of the Connected Subgraph Problem

  1993cited by this paper
• Efficient parallel algorithms for shortest paths in planar digraphs

  1992cited by this paper
• Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity

  1991cited by this paper
• Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification

  1988cited by this paper
• Unbounded Speed Variability in Distributed Communications Systems

  1985cited by this paper
• Real-Time Synchronization of Interprocess Communications

  1984cited by this paper
• Unbounded speed variability in distributed communication systems

  1982cited by this paper
• Distributed algorithms for synchronizing interprocess communication within real time

  1981cited by this paper
• Random matroids

  1980cited by this paper
• Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon

  1978cited by this paper
• Two-person nonzero-sum games and quadratic programming

  1964cited by this paper
• Citation for Published Item: Use Policy Determining Majority in Networks with Local Interactions and Very Small Local Memory *

  year unknowncited by this paper

• No citing papers are available for this paper.