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.

 

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

On the hardness of approximating minimization problems., и . STOC, стр. 286-293. ACM, (1993)Properties and prediction of flow statistics from sampled packet streams., , и . Internet Measurement Workshop, стр. 159-171. ACM, (2002)On the Hardness of Computing the Permanent of Random Matrices., и . Comput. Complex., 6 (2): 101-132 (1997)Complexity Results for POMSET Languages., , и . CAV, том 575 из Lecture Notes in Computer Science, стр. 343-353. Springer, (1991)Scalable VPN routing via relaying., , , , и . SIGMETRICS, стр. 61-72. ACM, (2008)Packet classification in large ISPs: design and evaluation of decision tree classifiers., и . SIGMETRICS, стр. 73-84. ACM, (2005)Estimating flow distributions from sampled flow statistics., , и . SIGCOMM, стр. 325-336. ACM, (2003)The Power of Adaptiveness and Additional Queries in Random-Self-Reductions., , , и . SCT, стр. 338-346. IEEE Computer Society, (1992)Efficient probabilistically checkable proofs and applications to approximations., , , и . STOC, стр. 294-304. ACM, (1993)The approximation of maximum subgraph problems, и . Automata, Languages and Programming, стр. 40--51. Berlin, Heidelberg, Springer Berlin Heidelberg, (1993)