![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Anirban Dasgupta Anirban Dasgupta, John E. Hopcroft , Jon M. Kleinberg , Mark Sandler : On Learning Mixtures of Heavy-Tailed Distributions. FOCS 2005 : 491-500 Anirban Dasgupta, Ravi Kumar , Prabhakar Raghavan , Andrew Tomkins : Variable latent semantic indexing. KDD 2005 : 13-21 Elliot Anshelevich , Anirban Dasgupta, Jon M. Kleinberg , Éva Tardos , Tom Wexler , Tim Roughgarden : The Price of Stability for Network Design with Fair Cost Allocation. FOCS 2004 : 295-304 Anirban Dasgupta, John E. Hopcroft , Frank McSherry : Spectral Analysis of Random Graphs with Skewed Degree Distributions. FOCS 2004 : 602-610 Elliot Anshelevich , Anirban Dasgupta, Éva Tardos , Tom Wexler : Near-optimal network design with selfish agents. STOC 2003 : 511-520 A. C. Patthak , I. Bhattacharya , Anirban Dasgupta, Pallab Dasgupta , P. P. Chakrabarti : Quantified Computation Tree Logic. Inf. Process. Lett. 82 (3): 123-129 (2002) 1 [ 2 ] [ 4 ] 2 [ 1 ] 3 [ 1 ] 4 [ 1 ] 5 [ 3 ] [ 6 ] 6 [ 4 ] [ 6 ] 7 [ 5 ] 8 [ 3 ] 9 [ 1 ] 10 [ 5 ] 11 [ 4 ] 12 [ 6 ] 13 [ 2 ] [ 4 ] 14 [ 5 ] 15 [ 2 ] [ 4 ] ![]() ©2006 Association for Computing Machinery |