From post

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.

 

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

Maximizing job benefits on-line., , и . APPROX, том 1913 из Lecture Notes in Computer Science, стр. 42-50. Springer, (2000)Converging to Approximated Max-Min Flow Fairness in Logarithmic Time., и . INFOCOM, стр. 1350-1357. IEEE Computer Society, (1998)Competitive collaborative learning., и . J. Comput. Syst. Sci., 74 (8): 1271-1288 (2008)Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen., , , и . STOC, стр. 277-283. ACM, (1995)Routing with Polynomial Communication-Space Trade-Off., и . SIAM J. Discret. Math., 5 (2): 151-162 (1992)Competitive Routing of Virtual Circuits with Unknown Duration., , , и . SODA, стр. 321-327. ACM/SIAM, (1994)Stateless distributed algorithms for near optimal maximum multicommodity flows., и . PODC, стр. 440. ACM, (2008)Competitive Distributed Job Scheduling (Extended Abstract), , и . STOC, стр. 571-580. ACM, (1992)Greedy distributed optimization of multi-commodity flows., и . PODC, стр. 274-283. ACM, (2007)Asynchronous Active Recommendation Systems., , и . OPODIS, том 4878 из Lecture Notes in Computer Science, стр. 48-61. Springer, (2007)