| Year |
Citation |
Score |
| 2015 |
Aspnes J, Attiya H, Censor-Hillel K, Ellen F. Limited-use atomic snapshots with polylogarithmic step complexity Journal of the Acm. 62: 3. DOI: 10.1145/2732263 |
0.357 |
|
| 2015 |
Aspnes J. Faster randomized consensus with an oblivious adversary Distributed Computing. 28: 21-29. DOI: 10.1007/S00446-013-0195-Y |
0.369 |
|
| 2014 |
Alistarh D, Aspnes J, Censor-Hillel K, Gilbert S, Guerraoui R. Tight bounds for asynchronous renaming Journal of the Acm. 61. DOI: 10.1145/2597630 |
0.424 |
|
| 2014 |
Angluin D, Aspnes J, Bazzi RA, Chen J, Eisenstat D, Konjevod G. Effective storage capacity of labeled graphs Information and Computation. 234: 44-56. DOI: 10.1016/J.Ic.2013.11.004 |
0.313 |
|
| 2014 |
Alistarh D, Aspnes J, King V, Saia J. Communication-efficient randomized consensus Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8784: 61-75. DOI: 10.1007/S00446-017-0315-1 |
0.489 |
|
| 2014 |
Aspnes J, Ellen F. Tight Bounds for Adopt-Commit Objects Theory of Computing Systems. 55: 451-474. DOI: 10.1007/S00224-013-9448-1 |
0.353 |
|
| 2014 |
Aspnes J, Diamadi Z, Yampolskiy A, Gjøsteen K, Peralta R. Spreading Alerts Quietly and the Subgroup Escape Problem Journal of Cryptology. 28: 796-819. DOI: 10.1007/S00145-014-9181-1 |
0.661 |
|
| 2013 |
Alistarh D, Aspnes J, Giakkoupis G, Woelfel P. Randomized loose renaming in O(loglogn) time Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 200-209. DOI: 10.1145/2484239.2484240 |
0.317 |
|
| 2013 |
Angluin D, Aspnes J, Reyzin L. Network construction with subgraph connectivity constraints Journal of Combinatorial Optimization. 29: 418-432. DOI: 10.1007/S10878-013-9603-2 |
0.396 |
|
| 2012 |
Aspnes J, Attiya H, Censor-Hillel K. Polylogarithmic concurrent data structures from monotone circuits Journal of the Acm. 59. DOI: 10.1145/2108242.2108244 |
0.37 |
|
| 2012 |
Aspnes J, Eisenstat D, Yin Y. Low-contention data structures Journal of Parallel and Distributed Computing. 72: 705-715. DOI: 10.1016/J.Jpdc.2011.10.018 |
0.595 |
|
| 2012 |
Aspnes J, Yin Y. Randomized load balancing by joining and splitting bins Information Processing Letters. 112: 309-313. DOI: 10.1016/J.Ipl.2012.01.003 |
0.524 |
|
| 2012 |
Aspnes J. A modular approach to shared-memory consensus, with applications to the probabilistic-write model Distributed Computing. 25: 179-188. DOI: 10.1007/S00446-011-0134-8 |
0.394 |
|
| 2010 |
Aspnes J, Censor K. Approximate shared-memory counting despite a strong adversary Acm Transactions On Algorithms. 6. DOI: 10.1145/1721837.1721841 |
0.404 |
|
| 2010 |
Angluin D, Aspnes J, Reyzin L. Optimally learning social networks with activations and suppressions Theoretical Computer Science. 411: 2729-2740. DOI: 10.1016/J.Tcs.2010.04.008 |
0.406 |
|
| 2010 |
Aspnes J, Attiya H, Censor K. Combining shared-coin algorithms Journal of Parallel and Distributed Computing. 70: 317-322. DOI: 10.1016/J.Jpdc.2009.08.005 |
0.425 |
|
| 2010 |
Angluin D, Aspnes J, Reyzin L. Inferring social networks from outbreaks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6331: 104-118. DOI: 10.1007/978-3-642-16108-7_12 |
0.351 |
|
| 2009 |
Aspnes J, Wieder U. The expansion and mixing time of skip graphs with applications Distributed Computing. 21: 385-393. DOI: 10.1007/S00446-008-0071-3 |
0.369 |
|
| 2008 |
Angluin D, Aspnes J, Fischer MJ, Jiang H. Self-stabilizing population protocols Acm Transactions On Autonomous and Adaptive Systems. 3. DOI: 10.1145/1452001.1452003 |
0.381 |
|
| 2008 |
Angluin D, Aspnes J, Chen J, Reyzin L. Learning large-alphabet and analog circuits with value injection queries Machine Learning. 72: 113-138. DOI: 10.1007/S10994-008-5048-8 |
0.363 |
|
| 2008 |
Angluin D, Aspnes J, Eisenstat D. Fast computation by population protocols with a leader Distributed Computing. 21: 183-199. DOI: 10.1007/S00446-008-0067-Z |
0.398 |
|
| 2008 |
Angluin D, Aspnes J, Eisenstat D. A simple population protocol for fast robust approximate majority Distributed Computing. 21: 87-102. DOI: 10.1007/S00446-008-0059-Z |
0.394 |
|
| 2007 |
Aspnes J, Shah G. Skip graphs Acm Transactions On Algorithms. 3. DOI: 10.1145/1290672.1290674 |
0.644 |
|
| 2007 |
Aspnes J, Feigenbaum J, Yampolskiy A, Zhong S. Towards a theory of data entanglement Theoretical Computer Science. 389: 26-43. DOI: 10.1016/J.Tcs.2007.07.021 |
0.732 |
|
| 2007 |
Angluin D, Aspnes J, Eisenstat D, Ruppert E. The computational power of population protocols Distributed Computing. 20: 279-304. DOI: 10.1007/S00446-007-0040-2 |
0.387 |
|
| 2007 |
Aspnes J, Wu Y. O(log n)-time overlay network construction from graphs with out-degree 1 Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4878: 286-300. |
0.403 |
|
| 2006 |
Aspnes J, Eren T, Goldenberg DK, Morse AS, Whiteley W, Yang R, Anderson BDO, Belhumeur PN. A theory of network localization Ieee Transactions On Mobile Computing. 5: 1663-1677. DOI: 10.1109/Tmc.2006.174 |
0.378 |
|
| 2006 |
Aspnes J, Chang K, Yampolskiy A. Inoculation strategies for victims of viruses and the sum-of-squares partition problem Journal of Computer and System Sciences. 72: 1077-1093. DOI: 10.1016/J.Jcss.2006.02.003 |
0.761 |
|
| 2006 |
Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R. Computation in networks of passively mobile finite-state sensors Distributed Computing. 18: 235-253. DOI: 10.1007/S00446-005-0138-3 |
0.71 |
|
| 2005 |
Angluin D, Aspnes J, Chen J, Wu Y, Yin Y. Fast construction of overlay networks Annual Acm Symposium On Parallelism in Algorithms and Architectures. 145-154. DOI: 10.1145/1073970.1073991 |
0.384 |
|
| 2005 |
Aspnes J, Waarts O. Compositional competitiveness for distributed algorithms Journal of Algorithms. 54: 127-151. DOI: 10.1016/J.Jalgor.2004.06.004 |
0.367 |
|
| 2004 |
Aspnes J, Feigenbaum J, Yampolskiy A, Zhong S. Towards a theory of data entanglement (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3193: 177-192. |
0.737 |
|
| 2003 |
Aspnes J. Randomized protocols for asynchronous consensus Distributed Computing. 16: 165-175. DOI: 10.1007/S00446-002-0081-5 |
0.402 |
|
| 2002 |
Aspnes J, Hartling J, Kao MY, Kim J, Shah G. A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 9: 721-41. PMID 12487760 DOI: 10.1089/106652702761034154 |
0.559 |
|
| 2002 |
Aspnes J. Fast deterministic consensus in a noisy environment Journal of Algorithms. 45: 16-39. DOI: 10.1016/S0196-6774(02)00220-1 |
0.439 |
|
| 2002 |
Aspnes J, Diamadi Z, Shah G. Fault-tolerant routing in peer-to-peer systems Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 223-232. |
0.718 |
|
| 2002 |
Aspnes J, Shah G, Shah J. Wait-free consensus with infinite arrivals Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 524-533. |
0.608 |
|
| 1998 |
Aspnes J. Lower Bounds for Distributed Coin-Flipping and Randomized Consensus Journal of the Acm. 45: 415-450. DOI: 10.1145/278298.278304 |
0.301 |
|
| 1998 |
Aspnes J. Competitive analysis of distributed algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1442: 118-146. DOI: 10.1007/Bfb0029567 |
0.309 |
|
| 1998 |
Aspnes J, Hurwood W. Spreading rumors rapidly despite an adversary Journal of Algorithms. 26: 386-411. DOI: 10.1006/Jagm.1997.0907 |
0.476 |
|
| 1997 |
Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O. On-line routing of virtual circuits with applications to load balancing and machine scheduling Journal of the Acm. 44: 486-504. DOI: 10.1145/258128.258201 |
0.42 |
|
| 1996 |
Aspnes J, Waarts O. Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor Siam Journal On Computing. 25: 1024-1044. DOI: 10.1137/S0097539792240881 |
0.433 |
|
| 1996 |
Aspnes J, Waarts O. Randomized consensus in expected O(Nlog2N) operations per processor Siam Journal On Computing. 25: 1024-1044. |
0.32 |
|
| 1994 |
Aspnes J, Herlihy M, Shavit N. Counting networks Journal of the Acm (Jacm). 41: 1020-1048. DOI: 10.1145/185675.185815 |
0.398 |
|
| 1994 |
Aspnes J, Beigel R, Furst M, Rudich S. The expressive power of voting polynomials Combinatorica. 14: 135-148. DOI: 10.1007/Bf01215346 |
0.331 |
|
| 1993 |
Aspnes J. Time- and Space-Efficient Randomized Consensus Journal of Algorithms. 14: 414-431. DOI: 10.1006/Jagm.1993.1022 |
0.424 |
|
| 1990 |
Aspnes J, Herlihy M. Fast randomized consensus using shared memory Journal of Algorithms. 11: 441-461. DOI: 10.1016/0196-6774(90)90021-6 |
0.399 |
|
| Show low-probability matches. |