( en | de | ru )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.

, , and . WINE, volume 4286 of Lecture Notes in Computer Science, page 286-296. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul-G Behler

Paul G Lankisch

Paul G Lankisch

Giuseppe G G Manzardo

G Abstreiter

 

Other publications of authors with the same name

How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem., , , and . Cryptogr., 6 (3): 42 (2022)Information security for sensors by overwhelming random sequences and permutations., , , , and . ACM Conference on Computer and Communications Security, page 669-671. ACM, (2010)Cost-Balancing Tolls for Atomic Network Congestion Games., and . Internet Math., 5 (4): 343-363 (2008)Randomized Approximation Techniques., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Atomic Selfish Routing in Networks., and . Handbook of Parallel Computing, Chapman and Hall/CRC, (2007)The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases., and . ICCI, page 403-407. IEEE Computer Society, (1993)MaxMin Fair Flow Control Sensitive to Priorities., , and . OPODIS, page 45-60. Hermes, (1998)Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps., , and . Inf. Process. Lett., 58 (1): 47-53 (1996)Probabilistic Data Propagation in Wireless Sensor Networks., and . Theoretical Aspects of Distributed Computing in Sensor Networks, Springer, (2011)The Complexity of The Reliable Connectivity Problem., , and . MFCS, volume 520 of Lecture Notes in Computer Science, page 259-266. Springer, (1991)