default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Aspnes
Person information
- affiliation: Yale University, New Haven, Connecticut, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j56]Talley Amir
, James Aspnes:
Privacy in population protocols with probabilistic scheduling. Theor. Comput. Sci. 1024: 114926 (2025)- 2024
- [j55]James Aspnes, Othon Michail:
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). J. Comput. Syst. Sci. 141: 103503 (2024) - 2023
- [j54]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. SIAM J. Comput. 52(4): 913-944 (2023) - [c86]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: 13-23 - [c85]Talley Amir, James Aspnes:
Privacy in Population Protocols with Probabilistic Scheduling. SSS 2023: 400-413 - [i23]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 abs/2302.12508 (2023) - [i22]Talley Amir, James Aspnes:
Privacy in Population Protocols with Probabilistic Scheduling. CoRR abs/2305.02377 (2023) - 2022
- [e5]James Aspnes, Othon Michail:
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. LIPIcs 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-224-2 [contents] - 2021
- [j53]James Aspnes:
Clocked population protocols. J. Comput. Syst. Sci. 121: 34-48 (2021) - [j52]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): 571-584 (2021) - 2020
- [c84]Talley Amir, James Aspnes, John Lazarsfeld:
Approximate Majority with Catalytic Inputs. OPODIS 2020: 19:1-19:16 - [c83]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Brief Announcement: Why Extension-Based Proofs Fail. PODC 2020: 54-56 - [c82]Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric E. Severson:
Message Complexity of Population Protocols. DISC 2020: 6:1-6:18 - [i21]James Aspnes:
Notes on Theory of Distributed Systems. CoRR abs/2001.04235 (2020) - [i20]James Aspnes:
Notes on Randomized Algorithms. CoRR abs/2003.01902 (2020) - [i19]Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari H., Eric E. Severson:
Message complexity of population protocols. CoRR abs/2003.09532 (2020) - [i18]Talley Amir, James Aspnes, John Lazarsfeld:
Approximate Majority With Catalytic Inputs. CoRR abs/2009.08847 (2020)
2010 – 2019
- 2019
- [c81]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: 1674-1681 - [c80]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why extension-based proofs fail. STOC 2019: 986-996 - [c79]James Aspnes, Heyang Er:
Consensus with Max Registers. DISC 2019: 1:1-1:9 - 2018
- [j51]Dan Alistarh, James Aspnes, Valerie King, Jared Saia:
Communication-efficient randomized consensus. Distributed Comput. 31(6): 489-501 (2018) - [j50]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65(6): 38:1-38:2 (2018) - [j49]James Aspnes, Keren Censor-Hillel, Eitan Yaakobi:
Concurrent use of write-once memory. J. Parallel Distributed Comput. 113: 250-260 (2018) - [c78]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: 711-719 - [c77]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: 357-372 - [c76]Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. SODA 2018: 2221-2239 - [c75]James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel:
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC 2018: 8:1-8:17 - [e4]James Aspnes, Alysson Bessani, Pascal Felber, João Leitão:
21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017. LIPIcs 95, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-061-3 [contents] - [i17]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. CoRR abs/1811.01421 (2018) - 2017
- [c74]Yehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein:
Brief Announcement: Object Oriented Consensus. PODC 2017: 367-369 - [c73]James Aspnes:
Clocked Population Protocols. PODC 2017: 431-440 - [c72]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. SODA 2017: 2560-2579 - [i16]Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. CoRR abs/1704.04947 (2017) - 2016
- [j48]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): 459-460 (2016) - [j47]James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45(3): 734-762 (2016) - [c71]James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier:
Time and Space Optimal Counting in Population Protocols. OPODIS 2016: 13:1-13:17 - [c70]James Aspnes, Keren Censor-Hillel, Eitan Yaakobi:
Concurrent Use of Write-Once Memory. SIROCCO 2016: 127-142 - [c69]James Aspnes, Eric Ruppert:
Depth of a Random Binary Search Tree with Concurrent Insertions. DISC 2016: 371-384 - [i15]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. CoRR abs/1602.08032 (2016) - [i14]James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier:
Time and Space Optimal Counting in Population Protocols. CoRR abs/1611.07238 (2016) - 2015
- [j46]James Aspnes:
Faster randomized consensus with an oblivious adversary. Distributed Comput. 28(1): 21-29 (2015) - [j45]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62(1): 3:1-3:22 (2015) - [j44]Dana Angluin, James Aspnes, Lev Reyzin:
Network construction with subgraph connectivity constraints. J. Comb. Optim. 29(2): 418-432 (2015) - [j43]James Aspnes, Zoë Diamadi, Aleksandr Yampolskiy, Kristian Gjøsteen, René Peralta:
Spreading Alerts Quietly and the Subgroup Escape Problem. J. Cryptol. 28(4): 796-819 (2015) - [c68]Yves Mocquard, Emmanuelle Anceaume, James Aspnes, Yann Busnel, Bruno Sericola:
Counting with Population Protocols. NCA 2015: 35-42 - 2014
- [j42]Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod:
Effective storage capacity of labeled graphs. Inf. Comput. 234: 44-56 (2014) - [j41]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui:
Tight Bounds for Asynchronous Renaming. J. ACM 61(3): 18:1-18:51 (2014) - [j40]James Aspnes, Faith Ellen:
Tight Bounds for Adopt-Commit Objects. Theory Comput. Syst. 55(3): 451-474 (2014) - [c67]Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert:
Dynamic Task Allocation in Asynchronous Shared Memory. SODA 2014: 416-435 - [c66]Dan Alistarh, James Aspnes, Valerie King, Jared Saia:
Communication-Efficient Randomized Consensus. DISC 2014: 61-75 - 2013
- [j39]Dana Angluin, James Aspnes, Raonne Barbosa Vargas:
Mutation systems. Int. J. Comput. Math. 90(6): 1132-1149 (2013) - [j38]Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich:
On the learnability of shuffle ideals. J. Mach. Learn. Res. 14(1): 1513-1531 (2013) - [c65]Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel:
Randomized loose renaming in O(log log n) time. PODC 2013: 200-209 - [c64]James Aspnes, Keren Censor-Hillel:
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. DISC 2013: 254-268 - 2012
- [j37]James Aspnes:
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. Distributed Comput. 25(2): 179-188 (2012) - [j36]James Aspnes, Yitong Yin:
Randomized load balancing by joining and splitting bins. Inf. Process. Lett. 112(8-9): 309-313 (2012) - [j35]James Aspnes, Hagit Attiya, Keren Censor-Hillel:
Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1): 2:1-2:24 (2012) - [j34]James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. J. Parallel Distributed Comput. 72(5): 705-715 (2012) - [c63]Dana Angluin, James Aspnes, Aryeh Kontorovich:
On the Learnability of Shuffle Ideals. ALT 2012: 111-123 - [c62]James Aspnes:
Faster randomized consensus with an oblivious adversary. PODC 2012: 1-8 - [c61]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Faster than optimal snapshots (for a while): preliminary version. PODC 2012: 375-384 - [c60]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler:
Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181 - [i13]James Aspnes:
A one-bit swap object using test-and-sets and a max register. CoRR abs/1210.6286 (2012) - 2011
- [c59]Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui:
The Complexity of Renaming. FOCS 2011: 718-727 - [c58]Dana Angluin, James Aspnes, Raonne Barbosa Vargas:
Mutation Systems. LATA 2011: 92-104 - [c57]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248 - [c56]James Aspnes, Faith Ellen:
Tight bounds for anonymous adopt-commit objects. SPAA 2011: 317-324 - [c55]Dan Alistarh, James Aspnes:
Sub-logarithmic Test-and-Set against a Weak Adversary. DISC 2011: 97-109 - [c54]James Aspnes:
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers. DISC 2011: 363-373 - 2010
- [j33]James Aspnes, Hagit Attiya, Keren Censor:
Combining shared-coin algorithms. J. Parallel Distributed Comput. 70(3): 317-322 (2010) - [j32]James Aspnes, Keren Censor:
Approximate shared-memory counting despite a strong adversary. ACM Trans. Algorithms 6(2): 25:1-25:23 (2010) - [j31]Dana Angluin, James Aspnes, Lev Reyzin:
Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. 411(29-30): 2729-2740 (2010) - [c53]James Aspnes, Eric Blais, Murat Demirbas, Ryan O'Donnell, Atri Rudra, Steve Uurtamo:
k + Decision Trees - (Extended Abstract). ALGOSENSORS 2010: 74-88 - [c52]Dana Angluin, James Aspnes, Lev Reyzin:
Inferring Social Networks from Outbreaks. ALT 2010: 104-118 - [c51]James Aspnes:
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. PODC 2010: 460-467 - [c50]James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. SPAA 2010: 345-354 - [c49]Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod:
Storage Capacity of Labeled Graphs. SSS 2010: 573-587 - [i12]James Aspnes:
Slightly smaller splitter networks. CoRR abs/1011.3170 (2010)
2000 – 2009
- 2009
- [j30]James Aspnes, Udi Wieder:
The expansion and mixing time of skip graphs with applications. Distributed Comput. 21(6): 385-393 (2009) - [j29]Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu:
Learning a circuit by injecting values. J. Comput. Syst. Sci. 75(1): 60-77 (2009) - [j28]Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. 10: 1881-1911 (2009) - [c48]James Aspnes, Hagit Attiya, Keren Censor:
Max registers, counters, and monotone circuits. PODC 2009: 36-45 - [c47]James Aspnes, Keren Censor:
Approximate shared-memory counting despite a strong adversary. SODA 2009: 441-450 - [p2]James Aspnes, Eric Ruppert:
An Introduction to Population Protocols. Middleware for Network Eccentric and Mobile Applications 2009: 97-120 - 2008
- [j27]Dana Angluin, James Aspnes, David Eisenstat:
A simple population protocol for fast robust approximate majority. Distributed Comput. 21(2): 87-102 (2008) - [j26]Dana Angluin, James Aspnes, David Eisenstat:
Fast computation by population protocols with a leader. Distributed Comput. 21(3): 183-199 (2008) - [j25]Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin:
Learning large-alphabet and analog circuits with value injection queries. Mach. Learn. 72(1-2): 113-138 (2008) - [j24]Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang:
Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3(4): 13:1-13:28 (2008) - [c46]Dana Angluin, James Aspnes, Lev Reyzin:
Optimally Learning Social Networks with Activations and Suppressions. ALT 2008: 272-286 - [c45]Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180 - [c44]James Aspnes, Hagit Attiya, Keren Censor:
Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334 - [c43]James Aspnes, Muli Safra, Yitong Yin:
Ranged hash functions and the price of churn. SODA 2008: 1066-1075 - 2007
- [j23]James Aspnes:
Editorial. Distributed Comput. 19(4): 253 (2007) - [j22]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. Distributed Comput. 20(4): 279-304 (2007) - [j21]James Aspnes, Eric Ruppert:
An Introduction to Population Protocols. Bull. EATCS 93: 98-117 (2007) - [j20]James Aspnes, Gauri Shah:
Skip graphs. ACM Trans. Algorithms 3(4): 37:1--37:25 (2007) - [j19]James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong:
Towards a theory of data entanglement. Theor. Comput. Sci. 389(1-2): 26-43 (2007) - [c42]Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin:
Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65 - [c41]James Aspnes, Yinghua Wu:
O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. OPODIS 2007: 286-300 - [c40]James Aspnes, Navin Rustagi, Jared Saia:
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. OPODIS 2007: 443-456 - [c39]James Aspnes, Yang Richard Yang, Yitong Yin:
Path-independent load balancing with unreliable machines. SODA 2007: 814-823 - [c38]Dana Angluin, James Aspnes, David Eisenstat:
A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32 - [e3]James Aspnes, Christian Scheideler, Anish Arora, Samuel Madden:
Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings. Lecture Notes in Computer Science 4549, Springer 2007, ISBN 978-3-540-73089-7 [contents] - 2006
- [j18]James Aspnes, Faith Ellen Fich, Eric Ruppert:
Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Comput. 18(3): 209-219 (2006) - [j17]Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta:
Computation in networks of passively mobile finite-state sensors. Distributed Comput. 18(4): 235-253 (2006) - [j16]James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer:
Eight Open Problems in Distributed Computing. Bull. EATCS 90: 109-126 (2006) - [j15]James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy:
Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci. 72(6): 1077-1093 (2006) - [j14]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): 1663-1678 (2006) - [c37]Dana Angluin, James Aspnes, David Eisenstat:
Stably computable predicates are semilinear. PODC 2006: 292-299 - [c36]Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu:
Learning a circuit by injecting values. STOC 2006: 584-593 - [c35]Dana Angluin, James Aspnes, David Eisenstat:
Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75 - [e2]Phillip B. Gibbons, Tarek F. Abdelzaher, James Aspnes, Ramesh R. Rao:
Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings. Lecture Notes in Computer Science 4026, Springer 2006, ISBN 3-540-35227-9 [contents] - [i11]James Aspnes, Yang Richard Yang, Yitong Yin:
Path-independent load balancing with unreliable machines. CoRR abs/cs/0607026 (2006) - [i10]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. CoRR abs/cs/0608084 (2006) - 2005
- [j13]James Aspnes, Orli Waarts:
Compositional competitiveness for distributed algorithms. J. Algorithms 54(2): 127-151 (2005) - [c34]James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy:
Spreading Alerts Quietly and the Subgroup Escape Problem. ASIACRYPT 2005: 253-272 - [c33]Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta:
Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74 - [c32]Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang:
Self-stabilizing Population Protocols. OPODIS 2005: 103-117 - [c31]Ittai Abraham, James Aspnes, Jian Yuan:
Skip B-Trees. OPODIS 2005: 366-380 - [c30]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411 - [c29]James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy:
Inoculation strategies for victims of viruses and the sum-of-squares partition problem. SODA 2005: 43-52 - [c28]James Aspnes, Udi Wieder:
The expansion and mixing time of skip graphs with applications. SPAA 2005: 126-134 - [c27]Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin:
Fast construction of overlay networks. SPAA 2005: 145-154 - [p1]James Aspnes, Gauri Shah:
Distributed Data Structures for Peer-to-Peer Systems. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2005: 685-700 - [e1]Marcos Kawazoe Aguilera, James Aspnes:
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005. ACM 2005, ISBN 1-58113-994-2 [contents] - [i9]James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy:
Spreading Alerts Quietly and the Subgroup Escape Problem. IACR Cryptol. ePrint Arch. 2005: 282 (2005) - 2004
- [c26]James Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang:
On the Computational Complexity of Sensor Network Localization. ALGOSENSORS 2004: 32-44 - [c25]James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong:
Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS 2004: 177-192 - [c24]James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy:
Load balancing and locality in range-queriable data structures. PODC 2004: 115-124 - [c23]Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta:
Computation in networks of passively mobile finite-state sensors. PODC 2004: 290-299 - [c22]James Aspnes, Faith E. Fich, Eric Ruppert:
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC 2004: 260-274 - 2003
- [j12]James Aspnes:
Randomized protocols for asynchronous consensus. Distributed Comput. 16(2-3): 165-175 (2003) - [c21]James Aspnes, Gauri Shah:
Skip graphs. SODA 2003: 384-393 - [i8]James Aspnes, Zoë Diamadi, Gauri Shah:
Fault-tolerant routing in peer-to-peer systems. CoRR cs.DS/0302022 (2003) - [i7]James Aspnes, Gauri Shah:
Skip Graphs. CoRR cs.DS/0306043 (2003) - [i6]James Aspnes, Orli Waarts:
Compositional competitiveness for distributed algorithms. CoRR cs.DS/0306044 (2003) - 2002
- [j11]James Aspnes:
Fast deterministic consensus in a noisy environment. J. Algorithms 45(1): 16-39 (2002) - [j10]James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. J. Comput. Biol. 9(5): 721-741 (2002) - [c20]James Aspnes, Zoë Diamadi, Gauri Shah:
Fault-tolerant routing in peer-to-peer systems. PODC 2002: 223-232 - [c19]James Aspnes, Gauri Shah, Jatin Shah:
Wait-free consensus with infinite arrivals. STOC 2002: 524-533 - [i5]James Aspnes:
Fast Deterministic Consensus in a Noisy Environment. CoRR cs.DS/0206012 (2002) - [i4]James Aspnes:
Randomized protocols for asynchronous consensus. CoRR cs.DS/0209014 (2002) - 2001
- [c18]James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. ISAAC 2001: 403-415 - [c17]James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar:
Towards understanding the predictability of stock markets from the perspective of computational complexity. SODA 2001: 745-754 - [i3]James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. CoRR cs.CE/0101015 (2001) - 2000
- [c16]James Aspnes:
Fast deterministic consensus in a noisy environment. PODC 2000: 299-308 - [i2]James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar:
Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity. CoRR cs.CE/0010021 (2000) - [i1]Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao:
Opportunity Cost Algorithms for Combinatorial Auctions. CoRR cs.CE/0010031 (2000)
1990 – 1999
- 1998
- [j9]James Aspnes:
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. J. ACM 45(3): 415-450 (1998) - [j8]James Aspnes, William Hurwood:
Spreading Rumors Rapidly Despite an Adversary. J. Algorithms 26(2): 386-411 (1998) - [j7]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. J. Algorithms 29(2): 306-357 (1998) - 1997
- [j6]James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts:
On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3): 486-504 (1997) - [c15]James Aspnes:
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. STOC 1997: 559-568 - 1996
- [j5]James Aspnes, Orli Waarts:
Randomized Consensus in Expected O(n log² n) Operations Per Processor. SIAM J. Comput. 25(5): 1024-1044 (1996) - [c14]James Aspnes:
Competitive Analysis of Distributed Algorithms. Online Algorithms 1996: 118-146 - [c13]James Aspnes, William Hurwood:
Spreading Rumors Rapidly Despite and Adversary. PODC 1996: 143-151 - [c12]James Aspnes, Orli Waarts:
Modular Competitiveness for Distributed Algorithms. STOC 1996: 237-246 - 1995
- [c11]James Aspnes, Orli Waarts:
A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). PODC 1995: 252 - [c10]Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. SODA 1995: 477-485 - 1994
- [j4]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich:
The Expressive Power of Voting Polynomials. Comb. 14(2): 135-148 (1994) - [j3]James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks. J. ACM 41(5): 1020-1048 (1994) - [c9]Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
A Theory of Competitive Analysis for Distributed Algorithms. FOCS 1994: 401-411 - [c8]Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
Competitiveness in Distributed Algorithms. PODC 1994: 398 - 1993
- [j2]James Aspnes:
Time- and Space-Efficient Randomized Consensus. J. Algorithms 14(3): 414-431 (1993) - [c7]James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts:
On-line load balancing with applications to machine scheduling and virtual circuit routing. STOC 1993: 623-631 - 1992
- [c6]James Aspnes, Orli Waarts:
Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor. FOCS 1992: 137-146 - 1991
- [c5]James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks and Multi-Processor Coordination. STOC 1991: 348-358 - [c4]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich:
The Expressive Power of Voting Polynomials. STOC 1991: 402-409 - 1990
- [j1]James Aspnes, Maurice Herlihy:
Fast Randomized Consensus Using Shared Memory. J. Algorithms 11(3): 441-461 (1990) - [c3]James Aspnes:
Time- and Space-Efficient Randomized Consensus. PODC 1990: 325-331 - [c2]James Aspnes, Maurice Herlihy:
Wait-Free Data Structures in the Asynchronous PRAM Model. SPAA 1990: 340-349
1980 – 1989
- 1988
- [c1]James Aspnes, Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
A Theory of Timestamp-Based Concurrency Control for Nested Transactions. VLDB 1988: 431-444
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
