| Skip graphs J Aspnes, G Shah Acm transactions on algorithms (talg) 3 (4), 37-es, 2007 | 1065 | 2007 |
| Computation in networks of passively mobile finite-state sensors D Angluin, J Aspnes, Z Diamadi, MJ Fischer, R Peralta Distributed computing 18 (4), 235-253, 2006 | 757 | 2006 |
| A theory of network localization J Aspnes, T Eren, DK Goldenberg, AS Morse, W Whiteley, YR Yang, ... IEEE Transactions on Mobile Computing 5 (12), 1663-1678, 2006 | 735 | 2006 |
| The computational power of population protocols D Angluin, J Aspnes, D Eisenstat, E Ruppert Distributed Computing 20, 279-304, 2007 | 360 | 2007 |
| On-line routing of virtual circuits with applications to load balancing and machine scheduling J Aspnes, Y Azar, A Fiat, S Plotkin, O Waarts Journal of the ACM (JACM) 44 (3), 486-504, 1997 | 337 | 1997 |
| Fast randomized consensus using shared memory J Aspnes, M Herlihy Journal of algorithms 11 (3), 441-461, 1990 | 320 | 1990 |
| An introduction to population protocols J Aspnes, E Ruppert Middleware for Network Eccentric and Mobile Applications, 97-120, 2009 | 311 | 2009 |
| Fast computation by population protocols with a leader D Angluin, J Aspnes, D Eisenstat Distributed Computing 21, 183-199, 2008 | 276 | 2008 |
| The expressive power of voting polynomials J Aspnes, R Beigel, M Furst, S Rudich Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991 | 264 | 1991 |
| On the computational complexity of sensor network localization J Aspnes, D Goldenberg, YR Yang Algorithmic Aspects of Wireless Sensor Networks: First International …, 2004 | 263 | 2004 |
| A simple population protocol for fast robust approximate majority D Angluin, J Aspnes, D Eisenstat Distributed Computing 21, 87-102, 2008 | 250 | 2008 |
| Inoculation strategies for victims of viruses and the sum-of-squares partition problem J Aspnes, K Chang, A Yampolskiy Journal of Computer and System Sciences 72 (6), 1077-1093, 2006 | 239 | 2006 |
| Self-stabilizing population protocols D Angluin, J Aspnes, MJ Fischer, H Jiang ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3 (4), 1-28, 2008 | 214 | 2008 |
| Counting networks J Aspnes, M Herlihy, N Shavit Journal of the ACM (JACM) 41 (5), 1020-1048, 1994 | 203 | 1994 |
| Stably computable predicates are semilinear D Angluin, J Aspnes, D Eisenstat Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006 | 200 | 2006 |
| On-line load balancing with applications to machine scheduling and virtual circuit routing J Aspnes, Y Azar, A Fiat, S Plotkin, O Waarts Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 198 | 1993 |
| Randomized protocols for asynchronous consensus J Aspnes Distributed Computing 16 (2-3), 165-175, 2003 | 196 | 2003 |
| Fault-tolerant routing in peer-to-peer systems J Aspnes, Z Diamadi, G Shah Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 159 | 2002 |
| Wait-free data structures in the asynchronous PRAM model J Aspnes, M Herlihy Proceedings of the second annual ACM symposium on Parallel algorithms and …, 1990 | 157 | 1990 |
| Time-space trade-offs in population protocols D Alistarh, J Aspnes, D Eisenstat, R Gelashvili, RL Rivest Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete …, 2017 | 136 | 2017 |
Dana AngluinProfessor of Computer Science, Yale Universitycs.yale.edu의 이메일 확인됨
