| 2023 | PODC | Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. | Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld |
| 2023 | SSS | Privacy in Population Protocols with Probabilistic Scheduling. | Talley Amir, James Aspnes |
| 2020 | OPODIS | Approximate Majority with Catalytic Inputs. | Talley Amir, James Aspnes, John Lazarsfeld |
| 2020 | PODC | Brief Announcement: Why Extension-Based Proofs Fail. | Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2019 | AAAI | Optimizing in the Dark: Learning an Optimal Solution through a Simple Request Interface. | Qiao Xiang, Haitao Yu, James Aspnes, Franck Le, Linghe Kong, Yang Richard Yang |
| 2019 | STOC | Why extension-based proofs fail. | Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2018 | INFOCOM | Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths. | Christopher Leet, Xin Wang, Yang Richard Yang, James Aspnes |
| 2018 | OSDI | The FuzzyLog: A Partially Ordered Shared Log. | Joshua Lockerman, Jose M. Faleiro, Juno Kim, Soham Sankaran, Daniel J. Abadi, James Aspnes, Siddhartha Sen, Mahesh Balakrishnan |
| 2018 | SODA | Space-Optimal Majority in Population Protocols. | Dan Alistarh, James Aspnes, Rati Gelashvili |
| 2017 | PODC | Brief Announcement: Object Oriented Consensus. | Yehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein |
| 2017 | PODC | Clocked Population Protocols. | James Aspnes |
| 2017 | SODA | Time-Space Trade-offs in Population Protocols. | Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest |
| 2016 | OPODIS | Time and Space Optimal Counting in Population Protocols. | James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier |
| 2016 | SIROCCO | Concurrent Use of Write-Once Memory. | James Aspnes, Keren Censor-Hillel, Eitan Yaakobi |
| 2015 | NCA | Counting with Population Protocols. | Yves Mocquard, Emmanuelle Anceaume, James Aspnes, Yann Busnel, Bruno Sericola |
| 2014 | SODA | Dynamic Task Allocation in Asynchronous Shared Memory. | Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert |
| 2013 | PODC | Randomized loose renaming in | Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel |
| 2012 | ALT | On the Learnability of Shuffle Ideals. | Dana Angluin, James Aspnes, Aryeh Kontorovich |
| 2012 | PODC | Faster randomized consensus with an oblivious adversary. | James Aspnes |
| 2012 | PODC | Faster than optimal snapshots (for a while): preliminary version. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen |
| 2012 | SPAA | Lower bounds for restricted-use objects: extended abstract. | James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler |
| 2011 | FOCS | The Complexity of Renaming. | Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui |
| 2011 | LATA | Mutation Systems. | Dana Angluin, James Aspnes, Raonne Barbosa Vargas |
| 2011 | PODC | Optimal-time adaptive strong renaming, with applications to counting. | Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam |
| 2011 | SPAA | Tight bounds for anonymous adopt-commit objects. | James Aspnes, Faith Ellen |
| 2010 | Algosensors | k | James Aspnes, Eric Blais, Murat Demirbas, Ryan O'Donnell, Atri Rudra, Steve Uurtamo |
| 2010 | ALT | Inferring Social Networks from Outbreaks. | Dana Angluin, James Aspnes, Lev Reyzin |
| 2010 | PODC | A modular approach to shared-memory consensus, with applications to the probabilistic-write model. | James Aspnes |
| 2010 | SPAA | Low-contention data structures. | James Aspnes, David Eisenstat, Yitong Yin |
| 2010 | SSS | Storage Capacity of Labeled Graphs. | Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod |
| 2009 | PODC | Max registers, counters, and monotone circuits. | James Aspnes, Hagit Attiya, Keren Censor |
| 2009 | SODA | Approximate shared-memory counting despite a strong adversary. | James Aspnes, Keren Censor |
| 2008 | ALT | Optimally Learning Social Networks with Activations and Suppressions. | Dana Angluin, James Aspnes, Lev Reyzin |
| 2008 | COLT | Learning Acyclic Probabilistic Circuits Using Test Paths. | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin |
| 2008 | PODC | Randomized consensus in expected O(n log n) individual work. | James Aspnes, Hagit Attiya, Keren Censor |
| 2008 | SODA | Ranged hash functions and the price of churn. | James Aspnes, Muli Safra, Yitong Yin |
| 2007 | COLT | Learning Large-Alphabet and Analog Circuits with Value Injection Queries. | Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin |
| 2007 | OPODIS | Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. | James Aspnes, Navin Rustagi, Jared Saia |
| 2007 | OPODIS | O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. | James Aspnes, Yinghua Wu |
| 2007 | SODA | Path-independent load balancing with unreliable machines. | James Aspnes, Yang Richard Yang, Yitong Yin |
| 2006 | PODC | Stably computable predicates are semilinear. | Dana Angluin, James Aspnes, David Eisenstat |
| 2006 | STOC | Learning a circuit by injecting values. | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu |
| 2005 | ASIACRYPT | Spreading Alerts Quietly and the Subgroup Escape Problem. | James Aspnes, Zo Diamadi, Kristian Gjsteen, Ren Peralta, Aleksandr Yampolskiy |
| 2005 | DCOSS | Stably Computable Properties of Network Graphs. | Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, Ren Peralta |
| 2005 | OPODIS | Skip B-Trees. | Ittai Abraham, James Aspnes, Jian Yuan |
| 2005 | OPODIS | On the Power of Anonymous One-Way Communication. | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert |
| 2005 | OPODIS | Self-stabilizing Population Protocols. | Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang |
| 2005 | SODA | Inoculation strategies for victims of viruses and the sum-of-squares partition problem. | James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy |
| 2005 | SPAA | Fast construction of overlay networks. | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin |
| 2005 | SPAA | The expansion and mixing time of skip graphs with applications. | James Aspnes, Udi Wieder |
| 2004 | Algosensors | On the Computational Complexity of Sensor Network Localization. | James Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang |
| 2004 | ESORICS | Towards a Theory of Data Entanglement: (Extended Abstract). | James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong |
| 2004 | PODC | Computation in networks of passively mobile finite-state sensors. | Dana Angluin, James Aspnes, Zo Diamadi, Michael J. Fischer, Ren Peralta |
| 2004 | PODC | Load balancing and locality in range-queriable data structures. | James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy |
| 2003 | SODA | Skip graphs. | James Aspnes, Gauri Shah |
| 2002 | PODC | Fault-tolerant routing in peer-to-peer systems. | James Aspnes, Zo Diamadi, Gauri Shah |
| 2002 | STOC | Wait-free consensus with infinite arrivals. | James Aspnes, Gauri Shah, Jatin Shah |
| 2001 | ISAAC | A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. | James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah |
| 2001 | SODA | Towards understanding the predictability of stock markets from the perspective of computational complexity. | James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar |
| 2000 | PODC | Fast deterministic consensus in a noisy environment. | James Aspnes |
| 1997 | STOC | Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. | James Aspnes |
| 1996 | PODC | Spreading Rumors Rapidly Despite and Adversary. | James Aspnes, William Hurwood |
| 1996 | STOC | Modular Competitiveness for Distributed Algorithms. | James Aspnes, Orli Waarts |
| 1995 | PODC | A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). | James Aspnes, Orli Waarts |
| 1995 | SODA | Fairness in Scheduling. | Mikls Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts |
| 1994 | FOCS | A Theory of Competitive Analysis for Distributed Algorithms | Mikls Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts |
| 1994 | PODC | Competitiveness in Distributed Algorithms. | Mikls Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts |
| 1993 | STOC | On-line load balancing with applications to machine scheduling and virtual circuit routing. | James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts |
| 1992 | FOCS | Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor | James Aspnes, Orli Waarts |
| 1991 | STOC | The Expressive Power of Voting Polynomials | James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich |
| 1991 | STOC | Counting Networks and Multi-Processor Coordination | James Aspnes, Maurice Herlihy, Nir Shavit |
| 1990 | PODC | Time- and Space-Efficient Randomized Consensus. | James Aspnes |
| 1990 | SPAA | Wait-Free Data Structures in the Asynchronous PRAM Model. | James Aspnes, Maurice Herlihy |
| 1988 | VLDB | A Theory of Timestamp-Based Concurrency Control for Nested Transactions. | James Aspnes, Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl |