James Aspnes

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 42

Top Venues

Publications

James Aspnes, Othon Michail
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). J. Comput. Syst. Sci. 141 (2024)
Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. PODC (2023)
Talley Amir, James Aspnes
Privacy in Population Protocols with Probabilistic Scheduling. SSS (2023)
Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
Why Extension-Based Proofs Fail. SIAM J. Comput. 52 (4) (2023)
Talley Amir, James Aspnes
Privacy in Population Protocols with Probabilistic Scheduling. CoRR (2023)
Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. CoRR (2023)
James Aspnes
Clocked population protocols. J. Comput. Syst. Sci. 121 (2021)
Qiao Xiang, Haitao Yu, James Aspnes, Franck Le, Chin Guok, Linghe Kong, Yang Richard Yang
Optimizing in the Dark: Learning Optimal Network Resource Reservation Through a Simple Request Interface. IEEE/ACM Trans. Netw. 29 (2) (2021)
James Aspnes
Notes on Theory of Distributed Systems. CoRR (2020)
Talley Amir, James Aspnes, John Lazarsfeld
Approximate Majority With Catalytic Inputs. CoRR (2020)
James Aspnes
Notes on Randomized Algorithms. CoRR (2020)
Talley Amir, James Aspnes, John Lazarsfeld
Approximate Majority with Catalytic Inputs. OPODIS (2020)
Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
Brief Announcement: Why Extension-Based Proofs Fail. PODC (2020)
Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric E. Severson
Message Complexity of Population Protocols. DISC (2020)
Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari H., Eric E. Severson
Message complexity of population protocols. CoRR (2020)
James Aspnes, Heyang Er
Consensus with Max Registers. DISC (2019)
Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
Why extension-based proofs fail. STOC (2019)
Qiao Xiang, Haitao Yu, James Aspnes, Franck Le, Linghe Kong, Yang Richard Yang
Optimizing in the Dark: Learning an Optimal Solution through a Simple Request Interface. AAAI (2019)
Christopher Leet, Xin Wang, Yang Richard Yang, James Aspnes
Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths. INFOCOM (2018)
Dan Alistarh, James Aspnes, Valerie King, Jared Saia
Communication-efficient randomized consensus. Distributed Comput. 31 (6) (2018)
James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
Concurrent use of write-once memory. J. Parallel Distributed Comput. 113 (2018)
Dan Alistarh, James Aspnes, Rati Gelashvili
Space-Optimal Majority in Population Protocols. SODA (2018)
James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC (2018)
Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
Why Extension-Based Proofs Fail. CoRR (2018)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65 (6) (2018)
Joshua Lockerman, Jose M. Faleiro, Juno Kim, Soham Sankaran, Daniel J. Abadi, James Aspnes, Siddhartha Sen, Mahesh Balakrishnan
The FuzzyLog: A Partially Ordered Shared Log. OSDI (2018)
Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
Time-Space Trade-offs in Population Protocols. SODA (2017)
James Aspnes
Clocked Population Protocols. PODC (2017)
Yehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein
Brief Announcement: Object Oriented Consensus. PODC (2017)
Dan Alistarh, James Aspnes, Rati Gelashvili
Space-Optimal Majority in Population Protocols. CoRR (2017)
James Aspnes, Yuval Ishai, Peter Bro Miltersen
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013). SIAM J. Comput. 45 (2) (2016)
James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier
Time and Space Optimal Counting in Population Protocols. OPODIS (2016)
James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
Concurrent Use of Write-Once Memory. SIROCCO (2016)
James Aspnes, Eric Ruppert
Depth of a Random Binary Search Tree with Concurrent Insertions. DISC (2016)
Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
Time-Space Trade-offs in Population Protocols. CoRR (2016)
James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45 (3) (2016)
James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier
Time and Space Optimal Counting in Population Protocols. CoRR (2016)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62 (1) (2015)
Yves Mocquard, Emmanuelle Anceaume, James Aspnes, Yann Busnel, Bruno Sericola
Counting with Population Protocols. NCA (2015)
James Aspnes
Faster randomized consensus with an oblivious adversary. Distributed Comput. 28 (1) (2015)
Dana Angluin, James Aspnes, Lev Reyzin
Network construction with subgraph connectivity constraints. J. Comb. Optim. 29 (2) (2015)
James Aspnes, Zoë Diamadi, Aleksandr Yampolskiy, Kristian Gjøsteen, René Peralta
Spreading Alerts Quietly and the Subgroup Escape Problem. J. Cryptol. 28 (4) (2015)
James Aspnes, Faith Ellen
Tight Bounds for Adopt-Commit Objects. Theory Comput. Syst. 55 (3) (2014)
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
Effective storage capacity of labeled graphs. Inf. Comput. 234 (2014)
Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui
Tight Bounds for Asynchronous Renaming. J. ACM 61 (3) (2014)
Dan Alistarh, James Aspnes, Valerie King, Jared Saia
Communication-Efficient Randomized Consensus. DISC (2014)
Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert
Dynamic Task Allocation in Asynchronous Shared Memory. SODA (2014)
Dana Angluin, James Aspnes, Raonne Barbosa Vargas
Mutation systems. Int. J. Comput. Math. 90 (6) (2013)
James Aspnes, Keren Censor-Hillel
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. DISC (2013)
Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel
) time. PODC (2013)
Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich
On the learnability of shuffle ideals. J. Mach. Learn. Res. 14 (1) (2013)
James Aspnes, Hagit Attiya, Keren Censor-Hillel
Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59 (1) (2012)
James Aspnes
A one-bit swap object using test-and-sets and a max register CoRR (2012)
James Aspnes, Yitong Yin
Randomized load balancing by joining and splitting bins. Inf. Process. Lett. 112 (8-9) (2012)
Dana Angluin, James Aspnes, Aryeh Kontorovich
On the Learnability of Shuffle Ideals. ALT (2012)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler
Lower bounds for restricted-use objects: extended abstract. SPAA (2012)
James Aspnes
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. Distributed Comput. 25 (2) (2012)
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Faster than optimal snapshots (for a while): preliminary version. PODC (2012)
James Aspnes
Faster randomized consensus with an oblivious adversary. PODC (2012)
James Aspnes, David Eisenstat, Yitong Yin
Low-contention data structures. J. Parallel Distributed Comput. 72 (5) (2012)
Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui
The Complexity of Renaming. FOCS (2011)
James Aspnes, Faith Ellen
Tight bounds for anonymous adopt-commit objects. SPAA (2011)
Dan Alistarh, James Aspnes
Sub-logarithmic Test-and-Set against a Weak Adversary. DISC (2011)
Dana Angluin, James Aspnes, Raonne Barbosa Vargas
Mutation Systems. LATA (2011)
James Aspnes
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers. DISC (2011)
Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam
Optimal-time adaptive strong renaming, with applications to counting. PODC (2011)
Dana Angluin, James Aspnes, Lev Reyzin
Inferring Social Networks from Outbreaks. ALT (2010)
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
Storage Capacity of Labeled Graphs. SSS (2010)
Dana Angluin, James Aspnes, Lev Reyzin
Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. 411 (29-30) (2010)
James Aspnes, Keren Censor
Approximate shared-memory counting despite a strong adversary. ACM Trans. Algorithms 6 (2) (2010)
James Aspnes
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. PODC (2010)
James Aspnes, David Eisenstat, Yitong Yin
Low-contention data structures. SPAA (2010)
James Aspnes, Hagit Attiya, Keren Censor
Combining shared-coin algorithms. J. Parallel Distributed Comput. 70 (3) (2010)
James Aspnes
Slightly smaller splitter networks CoRR (2010)
James Aspnes, Eric Blais, Murat Demirbas, Ryan O'Donnell, Atri Rudra, Steve Uurtamo
Decision Trees - (Extended Abstract). ALGOSENSORS (2010)
James Aspnes, Keren Censor
Approximate shared-memory counting despite a strong adversary. SODA (2009)
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
Learning a circuit by injecting values. J. Comput. Syst. Sci. 75 (1) (2009)
Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. 10 (2009)
James Aspnes, Udi Wieder
The expansion and mixing time of skip graphs with applications. Distributed Comput. 21 (6) (2009)
James Aspnes, Hagit Attiya, Keren Censor
Max registers, counters, and monotone circuits. PODC (2009)
James Aspnes, Muli Safra, Yitong Yin
Ranged hash functions and the price of churn. SODA (2008)
Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3 (4) (2008)
Dana Angluin, James Aspnes, David Eisenstat
Fast computation by population protocols with a leader. Distributed Comput. 21 (3) (2008)
James Aspnes, Hagit Attiya, Keren Censor
Randomized consensus in expected O(n log n) individual work. PODC (2008)
Dana Angluin, James Aspnes, Lev Reyzin
Optimally Learning Social Networks with Activations and Suppressions. ALT (2008)
Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
Learning Acyclic Probabilistic Circuits Using Test Paths. COLT (2008)
Dana Angluin, James Aspnes, David Eisenstat
A simple population protocol for fast robust approximate majority. Distributed Comput. 21 (2) (2008)
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
Learning large-alphabet and analog circuits with value injection queries. Mach. Learn. 72 (1-2) (2008)
James Aspnes
Editorial. Distributed Comput. 19 (4) (2007)
Dana Angluin, James Aspnes, David Eisenstat
A Simple Population Protocol for Fast Robust Approximate Majority. DISC (2007)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
The computational power of population protocols. Distributed Comput. 20 (4) (2007)
James Aspnes, Yinghua Wu
O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. OPODIS (2007)
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT (2007)
James Aspnes, Gauri Shah
Skip graphs. ACM Trans. Algorithms 3 (4) (2007)
James Aspnes, Navin Rustagi, Jared Saia
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. OPODIS (2007)
James Aspnes, Yang Richard Yang, Yitong Yin
Path-independent load balancing with unreliable machines. SODA (2007)
James Aspnes, Eric Ruppert
An Introduction to Population Protocols. Bull. EATCS 93 (2007)
James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong
Towards a theory of data entanglement. Theor. Comput. Sci. 389 (1-2) (2007)
James Aspnes, Tolga Eren, David Kiyoshi Goldenberg, A. Stephen Morse, Walter Whiteley, Yang Richard Yang, Brian D. O. Anderson, Peter N. Belhumeur
A Theory of Network Localization. IEEE Trans. Mob. Comput. 5 (12) (2006)
Dana Angluin, James Aspnes, David Eisenstat
Fast Computation by Population Protocols with a Leader. DISC (2006)

James Aspnes.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

James Aspnes