( en | de | ru )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
Cover Time in Edge-Uniform Stochastically-Evolving Graphs.

, , and . SSS, volume 10616 of Lecture Notes in Computer Science, page 441-455. Springer, (2017)

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 Wahl

 

Other publications of authors with the same name

Information security for sensors by overwhelming random sequences and permutations., , , , and . ACM Conference on Computer and Communications Security, page 669-671. ACM, (2010)How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem., , , and . Cryptogr., 6 (3): 42 (2022)Cost-Balancing Tolls for Atomic Network Congestion Games., and . Internet Math., 5 (4): 343-363 (2008)MaxMin Fair Flow Control Sensitive to Priorities., , and . OPODIS, page 45-60. Hermes, (1998)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)Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps., , and . Inf. Process. Lett., 58 (1): 47-53 (1996)Unbounded Speed Variability in Distributed Communications Systems., and . SIAM J. Comput., 14 (1): 75-92 (1985)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)Tail Bounds for Occupancy Problems.. Encyclopedia of Algorithms, Springer, (2008)