( en | de | ru )

 

Disambiguation of "Fotakis, Dimitris"

Author of the publication

copydeleteadd this publication to your clipboard
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.

, and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 360-371. Springer, (1996)

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.

Dimitris Stathakos

Dimitris Mislis

Dimitris Kazarnovskis

Dimitris Theodoropoulos

Dimitris Depountis

 

Other publications of authors with the same name

Cost-Balancing Tolls for Atomic Network Congestion Games., and . Internet Math., 5 (4): 343-363 (2008)Atomic congestion games among coalitions., , and . ACM Trans. Algorithms, 4 (4): 52:1-52:27 (2008)Opinion Dynamics with Limited Information., , , and . Algorithmica, 85 (12): 3855-3888 (December 2023)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)The Online Min-Sum Set Cover Problem., , , , and . ICALP, volume 168 of LIPIcs, page 51:1-51:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficient Time-Series Clustering through Sparse Gaussian Modeling., , , and . Algorithms, 17 (2): 61 (2024)Frequency assignment in mobile and radio networks., , , and . Networks in Distributed Computing, volume 45 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 73-90. DIMACS/AMS, (1997)Virtual European School - VES., , , , , and . ICMCS, Vol. 2, page 1055-1057. IEEE Computer Society, (1999)0-7695-0253-9.Truthfulness Flooded Domains and the Power of Verification for Mechanism Design., and . WINE, volume 8289 of Lecture Notes in Computer Science, page 202-215. Springer, (2013)Graph Connectivity with Noisy Queries., , , , and . MFCS, volume 272 of LIPIcs, page 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)