Author of the publication

On the Hardness of Allocating Frequencies for Hybrid Networks.

, and . WG, volume 1197 of Lecture Notes in Computer Science, page 308-322. 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.

 

Other publications of authors with the same name

The Distortion of Locality Sensitive Hashing., , , and . ITCS, volume 67 of LIPIcs, page 54:1-54:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Experimental analysis of simple, distributed vertex coloring algorithms., , and . SODA, page 606-615. ACM/SIAM, (2002)Completeness in Approximation Classes., and . FCT, volume 380 of Lecture Notes in Computer Science, page 116-126. Springer, (1989)Milgram-routing in social networks., , and . WWW, page 725-734. ACM, (2011)Online Facility Location with Multiple Advice., , , , and . NeurIPS, page 4661-4673. (2021)Wavelength rerouting in optical networks, or the Venetian routing problem., , , , and . APPROX, volume 1913 of Lecture Notes in Computer Science, page 72-83. Springer, (2000)An experimental study of a simple, distributed edge coloring algorithm., , and . SPAA, page 166-175. ACM, (2000)A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically., , and . PODC, page 219-228. ACM, (1999)Quantifiers and Approximation (Extended Abstract), and . STOC, page 446-456. ACM, (1990)Distributed Weighted Vertex Cover via Maximal Matchings., , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 839-848. Springer, (2005)