( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

, и . J. ACM, (ноября 1999)
DOI: http://doi.acm.org/10.1145/331524.331526

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.

Leighton Richards

Leighton Folkes

Charles Leighton

Astrid Leighton

Anton Leighton

 

Другие публикации лиц с тем же именем

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web, , , , , и . Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, стр. 654--663. New York, NY, USA, ACM, (1997)Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks., и . STOC, стр. 487-496. ACM, (1994)Secure spread spectrum watermarking for images, audio and video., , , и . ICIP (3), стр. 243-246. IEEE Computer Society, (1996)Semi-oblivious routing: lower bounds., , и . SODA, стр. 929-938. SIAM, (2007)Tight Bounds on the Complexity of Parallel Sorting. Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, стр. 71--80. New York, NY, USA, ACM, (1984)Hypercubic Sorting Networks, и . SIAM Journal on Computing, 27 (1): 1--47 (февраля 1998)Semi-oblivious routing., , и . SPAA, стр. 234. ACM, (2006)Correction: Basic Network Creation Games., , , , и . SIAM J. Discret. Math., 28 (3): 1638-1640 (2014)Containment Properties of Product and Power Graphs., , и . Electron. Notes Discret. Math., (2001)Improving performance on the internet.. Commun. ACM, 52 (2): 44-51 (2009)