( en | de | ru )

 

Disambiguation of "Kaklamanis, Christos"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds for Oblivious Routing in the Hypercube.

, , and . Math. Syst. Theory, 24 (4): 223-232 (1991)

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.

Christos Tagarakis

Christos Koutras

Christos Vrettos

Christos Jordanides

Christos Kapnukajas

 

Other publications of authors with the same name

A hypercube parallel algorithm in texture analysis., , and . SIP, page 47-50. IASTED/ACTA Press, (2001)Tight Bounds for Oblivious Routing in the Hypercube., , and . Math. Syst. Theory, 24 (4): 223-232 (1991)Evaluating Approval-Based Multiwinner Voting in Terms of Robustness to Noise., , , and . IJCAI, page 74-80. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..On network formation games with heterogeneous players and basic network creation games., , and . Theor. Comput. Sci., (2018)Tight Bounds for Oblivious Routing in the Hypercube., , and . SPAA, page 31-36. ACM, (1990)Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors., and . SPAA, page 118-126. ACM, (1992)On the efficiency of equilibria in generalized second price auctions., , , and . EC, page 81-90. ACM, (2011)Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals)., , , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 271-282. Springer, (2001)New Results for Energy-Efficient Broadcasting in Wireless Networks., , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 332-343. Springer, (2002)Network Load Games., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 809-818. Springer, (2005)