( en | de | ru )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
Cost Sharing Mechanisms for Fair Pricing of Resources Usage.

, , and . Algorithmic Aspects of Large and Complex Networks, volume 05361 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)

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

Fault Tolerant Network Constructors., , and . SSS, volume 11914 of Lecture Notes in Computer Science, page 243-255. Springer, (2019)Cost Sharing Mechanisms for Fair Pricing of Resources Usage., , and . Algorithmic Aspects of Large and Complex Networks, volume 05361 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem., , , and . ICALP, volume 132 of LIPIcs, page 138:1-138:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Performance of Multistage Interconnection Networks with Finite Buffers., and . SIGMETRICS, page 263-264. ACM, (1990)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)On the Chromatic Number of Non-Sparse Random Intersection Graphs., , and . Theory Comput. Syst., 60 (1): 112-127 (2017)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)Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies., , , and . J. Discrete Algorithms, 4 (3): 433-454 (2006)