( en | de | ru )

 

Disambiguation of "Papadimitriou, Christos H."

Author of the publication

copydeleteadd this publication to your clipboard
Computational complexity

. Addison-Wesley, Reading, Mass. u.a., (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.

Evripidis Papadimitriou

Georg Papadimitriou

Sofia Papadimitriou

Joannis Papadimitriou

Dimitra Papadimitriou

 

Other publications of authors with the same name

Linked Decompositions, Internet Routing, and the Power of Choice in Polya Urns, , , , and . Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, (2008)Strategic Classification., , , and . CoRR, (2015)Algorithmic problems related to the Internet.. HERCMA, page 92. LEA Press, Athens, Hellas, (2001)On Neural Networks and Paul Spirakis.. Algorithms, Probability, Networks, and Games, volume 9295 of Lecture Notes in Computer Science, page 27-28. Springer, (2015)About Place Cells and Grid Cells - About Place Cells and Grid Cells.. Adventures Between Lower Bounds and Higher Altitudes, volume 11011 of Lecture Notes in Computer Science, page 637-640. Springer, (2018)Algorithmic Game Theory: A Snapshot.. ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 3-11. Springer, (2009)Decision-Making by Hierarchies of Discordant Agents., and . ISAAC, volume 1350 of Lecture Notes in Computer Science, page 183-192. Springer, (1997)Topological Bandwidth., , and . CAAP, volume 159 of Lecture Notes in Computer Science, page 317-331. Springer, (1983)Optimization, Approximation, and Complexity Classes (Extended Abstract), and . STOC, page 229-234. ACM, (1988)Linear programming without the matrix., and . STOC, page 121-129. ACM, (1993)