( en | de | ru )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
The structure and complexity of Nash equilibria for a selfish routing game.

, , , , and . Theor. Comput. Sci., 410 (36): 3305-3326 (2009)

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 Baumann

 

Other publications of authors with the same name

Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps., , and . Inf. Process. Lett., 58 (1): 47-53 (1996)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)Connectivity Properties in Random Regular Graphs with Edge Faults., , , and . Int. J. Found. Comput. Sci., 11 (2): 247-262 (2000)Probabilistic Data Propagation in Wireless Sensor Networks., and . Theoretical Aspects of Distributed Computing in Sensor Networks, Springer, (2011)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)Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays., , and . SPAA, page 254-264. ACM, (1989)Temporal flows in temporal networks., , , , and . J. Comput. Syst. Sci., (2019)Connectivity Preserving Network Transformers., and . CoRR, (2015)