 | 2012 |
|---|
| 111 |       | James Aspnes:
A modular approach to shared-memory consensus, with applications to the probabilistic-write model.
Distributed Computing 25(2): 179-188 (2012) |
| 110 | | James Aspnes,
Yitong Yin:
Randomized load balancing by joining and splitting bins.
Inf. Process. Lett. 112(8-9): 309-313 (2012) |
| 109 | | James Aspnes,
Hagit Attiya,
Keren Censor-Hillel:
Polylogarithmic concurrent data structures from monotone circuits.
J. ACM 59(1): 2 (2012) |
| 108 | | James Aspnes,
David Eisenstat,
Yitong Yin:
Low-contention data structures.
J. Parallel Distrib. Comput. 72(5): 705-715 (2012) |
| 2011 |
|---|
| 107 | | James Aspnes:
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers.
DISC 2011: 363-373 |
| 106 | | Dan Alistarh,
James Aspnes:
Sub-logarithmic Test-and-Set against a Weak Adversary.
DISC 2011: 97-109 |
| 105 | | Dan Alistarh,
James Aspnes,
Seth Gilbert,
Rachid Guerraoui:
The Complexity of Renaming.
FOCS 2011: 718-727 |
| 104 | | Dana Angluin,
James Aspnes,
Raonne Barbosa Vargas:
Mutation Systems.
LATA 2011: 92-104 |
| 103 | | Dan Alistarh,
James Aspnes,
Keren Censor-Hillel,
Seth Gilbert,
Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting.
PODC 2011: 239-248 |
| 102 | | James Aspnes,
Faith Ellen:
Tight bounds for anonymous adopt-commit objects.
SPAA 2011: 317-324 |
| 2010 |
|---|
| 101 | | James Aspnes,
Eric Blais,
Murat Demirbas,
Ryan O'Donnell,
Atri Rudra,
Steve Uurtamo:
k + Decision Trees - (Extended Abstract).
ALGOSENSORS 2010: 74-88 |
| 100 | | Dana Angluin,
James Aspnes,
Lev Reyzin:
Inferring Social Networks from Outbreaks.
ALT 2010: 104-118 |
| 99 | | James Aspnes:
A modular approach to shared-memory consensus, with applications to the probabilistic-write model.
PODC 2010: 460-467 |
| 98 | | James Aspnes,
David Eisenstat,
Yitong Yin:
Low-contention data structures.
SPAA 2010: 345-354 |
| 97 | | Dana Angluin,
James Aspnes,
Rida A. Bazzi,
Jiang Chen,
David Eisenstat,
Goran Konjevod:
Storage Capacity of Labeled Graphs.
SSS 2010: 573-587 |
| 96 | | James Aspnes,
Keren Censor:
Approximate shared-memory counting despite a strong adversary.
ACM Transactions on Algorithms 6(2): (2010) |
| 95 | | James Aspnes:
Slightly smaller splitter networks
CoRR abs/1011.3170: (2010) |
| 94 | | James Aspnes,
Hagit Attiya,
Keren Censor:
Combining shared-coin algorithms.
J. Parallel Distrib. Comput. 70(3): 317-322 (2010) |
| 93 | | Dana Angluin,
James Aspnes,
Lev Reyzin:
Optimally learning social networks with activations and suppressions.
Theor. Comput. Sci. 411(29-30): 2729-2740 (2010) |
| 2009 |
|---|
| 92 | | James Aspnes,
Hagit Attiya,
Keren Censor:
Max registers, counters, and monotone circuits.
PODC 2009: 36-45 |
| 91 | | James Aspnes,
Keren Censor:
Approximate shared-memory counting despite a strong adversary.
SODA 2009: 441-450 |
| 90 | | James Aspnes,
Udi Wieder:
The expansion and mixing time of skip graphs with applications.
Distributed Computing 21(6): 385-393 (2009) |
| 89 | | Dana Angluin,
James Aspnes,
Jiang Chen,
Yinghua Wu:
Learning a circuit by injecting values.
J. Comput. Syst. Sci. 75(1): 60-77 (2009) |
| 88 | | Dana Angluin,
James Aspnes,
Jiang Chen,
David Eisenstat,
Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths.
Journal of Machine Learning Research 10: 1881-1911 (2009) |
| 2008 |
|---|
| 87 | | Dana Angluin,
James Aspnes,
Lev Reyzin:
Optimally Learning Social Networks with Activations and Suppressions.
ALT 2008: 272-286 |
| 86 | | Dana Angluin,
James Aspnes,
Jiang Chen,
David Eisenstat,
Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths.
COLT 2008: 169-180 |
| 85 | | James Aspnes,
Hagit Attiya,
Keren Censor:
Randomized consensus in expected O(n log n) individual work.
PODC 2008: 325-334 |
| 84 | | James Aspnes,
Muli Safra,
Yitong Yin:
Ranged hash functions and the price of churn.
SODA 2008: 1066-1075 |
| 83 | | Dana Angluin,
James Aspnes,
David Eisenstat:
A simple population protocol for fast robust approximate majority.
Distributed Computing 21(2): 87-102 (2008) |
| 82 | | Dana Angluin,
James Aspnes,
David Eisenstat:
Fast computation by population protocols with a leader.
Distributed Computing 21(3): 183-199 (2008) |
| 81 | | Dana Angluin,
James Aspnes,
Jiang Chen,
Lev Reyzin:
Learning large-alphabet and analog circuits with value injection queries.
Machine Learning 72(1-2): 113-138 (2008) |
| 80 | | Dana Angluin,
James Aspnes,
Michael J. Fischer,
Hong Jiang:
Self-stabilizing population protocols.
TAAS 3(4): (2008) |
| 2007 |
|---|
| 79 |  | 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
Springer 2007 |
| 78 | | Dana Angluin,
James Aspnes,
Jiang Chen,
Lev Reyzin:
Learning Large-Alphabet and Analog Circuits with Value Injection Queries.
COLT 2007: 51-65 |
| 77 | | Dana Angluin,
James Aspnes,
David Eisenstat:
A Simple Population Protocol for Fast Robust Approximate Majority.
DISC 2007: 20-32 |
| 76 | | James Aspnes,
Yinghua Wu:
O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1.
OPODIS 2007: 286-300 |
| 75 | | 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 |
| 74 | | James Aspnes,
Yang Richard Yang,
Yitong Yin:
Path-independent load balancing with unreliable machines.
SODA 2007: 814-823 |
| 73 | | James Aspnes,
Gauri Shah:
Skip graphs.
ACM Transactions on Algorithms 3(4): (2007) |
| 72 | | James Aspnes,
Eric Ruppert:
An Introduction to Population Protocols.
Bulletin of the EATCS 93: 98-117 (2007) |
| 71 | | James Aspnes:
Editorial.
Distributed Computing 19(4): 253 (2007) |
| 70 | | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols.
Distributed Computing 20(4): 279-304 (2007) |
| 69 | | James Aspnes,
Joan Feigenbaum,
Aleksandr Yampolskiy,
Sheng Zhong:
Towards a theory of data entanglement.
Theor. Comput. Sci. 389(1-2): 26-43 (2007) |
| 2006 |
|---|
| 68 | | 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
Springer 2006 |
| 67 | | Dana Angluin,
James Aspnes,
David Eisenstat:
Fast Computation by Population Protocols with a Leader.
DISC 2006: 61-75 |
| 66 | | Dana Angluin,
James Aspnes,
David Eisenstat:
Stably computable predicates are semilinear.
PODC 2006: 292-299 |
| 65 | | Dana Angluin,
James Aspnes,
Jiang Chen,
Yinghua Wu:
Learning a circuit by injecting values.
STOC 2006: 584-593 |
| 64 | | James Aspnes,
Costas Busch,
Shlomi Dolev,
Panagiota Fatourou,
Chryssis Georgiou,
Alexander A. Shvartsman,
Paul G. Spirakis,
Roger Wattenhofer:
Eight Open Problems in Distributed Computing.
Bulletin of the EATCS 90: 109-126 (2006) |
| 63 | | James Aspnes,
Yang Richard Yang,
Yitong Yin:
Path-independent load balancing with unreliable machines
CoRR abs/cs/0607026: (2006) |
| 62 | | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols
CoRR abs/cs/0608084: (2006) |
| 61 | | James Aspnes,
Faith Ellen Fich,
Eric Ruppert:
Relationships between broadcast and shared memory in reliable anonymous distributed systems.
Distributed Computing 18(3): 209-219 (2006) |
| 60 | | Dana Angluin,
James Aspnes,
Zoë Diamadi,
Michael J. Fischer,
René Peralta:
Computation in networks of passively mobile finite-state sensors.
Distributed Computing 18(4): 235-253 (2006) |
| 59 | | 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) |
| 58 | | 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) |
| 2005 |
|---|
| 57 | | 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 |
| 56 | | James Aspnes,
Zoë Diamadi,
Kristian Gjøsteen,
René Peralta,
Aleksandr Yampolskiy:
Spreading Alerts Quietly and the Subgroup Escape Problem.
ASIACRYPT 2005: 253-272 |
| 55 | | Dana Angluin,
James Aspnes,
Melody Chan,
Michael J. Fischer,
Hong Jiang,
René Peralta:
Stably Computable Properties of Network Graphs.
DCOSS 2005: 63-74 |
| 54 | | Dana Angluin,
James Aspnes,
Michael J. Fischer,
Hong Jiang:
Self-stabilizing Population Protocols.
OPODIS 2005: 103-117 |
| 53 | | Ittai Abraham,
James Aspnes,
Jian Yuan:
Skip B-Trees.
OPODIS 2005: 366-380 |
| 52 | | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
On the Power of Anonymous One-Way Communication.
OPODIS 2005: 396-411 |
| 51 | | James Aspnes,
Kevin L. Chang,
Aleksandr Yampolskiy:
Inoculation strategies for victims of viruses and the sum-of-squares partition problem.
SODA 2005: 43-52 |
| 50 | | James Aspnes,
Udi Wieder:
The expansion and mixing time of skip graphs with applications.
SPAA 2005: 126-134 |
| 49 | | Dana Angluin,
James Aspnes,
Jiang Chen,
Yinghua Wu,
Yitong Yin:
Fast construction of overlay networks.
SPAA 2005: 145-154 |
| 48 | | James Aspnes,
Zoë Diamadi,
Kristian Gjøsteen,
René Peralta,
Aleksandr Yampolskiy:
Spreading Alerts Quietly and the Subgroup Escape Problem.
IACR Cryptology ePrint Archive 2005: 282 (2005) |
| 47 | | James Aspnes,
Orli Waarts:
Compositional competitiveness for distributed algorithms.
J. Algorithms 54(2): 127-151 (2005) |
| 2004 |
|---|
| 46 | | James Aspnes,
David Kiyoshi Goldenberg,
Yang Richard Yang:
On the Computational Complexity of Sensor Network Localization.
ALGOSENSORS 2004: 32-44 |
| 45 | | James Aspnes,
Faith Ellen Fich,
Eric Ruppert:
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems.
DISC 2004: 260-274 |
| 44 | | James Aspnes,
Joan Feigenbaum,
Aleksandr Yampolskiy,
Sheng Zhong:
Towards a Theory of Data Entanglement: (Extended Abstract).
ESORICS 2004: 177-192 |
| 43 | | James Aspnes,
Jonathan Kirsch,
Arvind Krishnamurthy:
Load balancing and locality in range-queriable data structures.
PODC 2004: 115-124 |
| 42 | | Dana Angluin,
James Aspnes,
Zoë Diamadi,
Michael J. Fischer,
René Peralta:
Computation in networks of passively mobile finite-state sensors.
PODC 2004: 290-299 |
| 2003 |
|---|
| 41 | | James Aspnes,
Gauri Shah:
Skip graphs.
SODA 2003: 384-393 |
| 40 | | James Aspnes,
Zoë Diamadi,
Gauri Shah:
Fault-tolerant routing in peer-to-peer systems
CoRR cs.DS/0302022: (2003) |
| 39 | | James Aspnes,
Gauri Shah:
Skip Graphs
CoRR cs.DS/0306043: (2003) |
| 38 | | James Aspnes,
Orli Waarts:
Compositional competitiveness for distributed algorithms
CoRR cs.DS/0306044: (2003) |
| 37 | | James Aspnes:
Randomized protocols for asynchronous consensus.
Distributed Computing 16(2-3): 165-175 (2003) |
| 2002 |
|---|
| 36 | | James Aspnes,
Zoë Diamadi,
Gauri Shah:
Fault-tolerant routing in peer-to-peer systems.
PODC 2002: 223-232 |
| 35 | | James Aspnes,
Gauri Shah,
Jatin Shah:
Wait-free consensus with infinite arrivals.
STOC 2002: 524-533 |
| 34 | | James Aspnes:
Fast Deterministic Consensus in a Noisy Environment
CoRR cs.DS/0206012: (2002) |
| 33 | | James Aspnes:
Randomized protocols for asynchronous consensus
CoRR cs.DS/0209014: (2002) |
| 32 | | James Aspnes:
Fast deterministic consensus in a noisy environment.
J. Algorithms 45(1): 16-39 (2002) |
| 31 | | 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.
Journal of Computational Biology 9(5): 721-742 (2002) |
| 2001 |
|---|
| 30 | | 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 |
| 29 | | 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 |
| 28 | | 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 |
|---|
| 27 | | James Aspnes:
Fast deterministic consensus in a noisy environment.
PODC 2000: 299-308 |
| 26 | | 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) |
| 25 | | Karhan Akcoglu,
James Aspnes,
Bhaskar DasGupta,
Ming-Yang Kao:
Opportunity Cost Algorithms for Combinatorial Auctions
CoRR cs.CE/0010031: (2000) |
| 1998 |
|---|
| 24 | | James Aspnes:
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus.
J. ACM 45(3): 415-450 (1998) |
| 23 | | James Aspnes,
William Hurwood:
Spreading Rumors Rapidly Despite an Adversary.
J. Algorithms 26(2): 386-411 (1998) |
| 22 | | 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 |
|---|
| 21 | | James Aspnes:
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus.
STOC 1997: 559-568 |
| 20 | | 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) |
| 1996 |
|---|
| 19 | | James Aspnes:
Competitive Analysis of Distributed Algorithms.
Online Algorithms 1996: 118-146 |
| 18 | | James Aspnes,
William Hurwood:
Spreading Rumors Rapidly Despite and Adversary.
PODC 1996: 143-151 |
| 17 | | James Aspnes,
Orli Waarts:
Modular Competitiveness for Distributed Algorithms.
STOC 1996: 237-246 |
| 16 | | James Aspnes,
Orli Waarts:
Randomized Consensus in Expected O(n log² n) Operations Per Processor.
SIAM J. Comput. 25(5): 1024-1044 (1996) |
| 1995 |
|---|
| 15 | | James Aspnes,
Orli Waarts:
A Modular Measure of Competitiveness for Distributed Algorithms (Abstract).
PODC 1995: 252 |
| 14 | | Miklós Ajtai,
James Aspnes,
Moni Naor,
Yuval Rabani,
Leonard J. Schulman,
Orli Waarts:
Fairness in Scheduling.
SODA 1995: 477-485 |
| 1994 |
|---|
| 13 | | Miklós Ajtai,
James Aspnes,
Cynthia Dwork,
Orli Waarts:
A Theory of Competitive Analysis for Distributed Algorithms
FOCS 1994: 401-411 |
| 12 | | Miklós Ajtai,
James Aspnes,
Cynthia Dwork,
Orli Waarts:
Competitiveness in Distributed Algorithms.
PODC 1994: 398 |
| 11 | | James Aspnes,
Richard Beigel,
Merrick L. Furst,
Steven Rudich:
The Expressive Power of Voting Polynomials.
Combinatorica 14(2): 135-148 (1994) |
| 10 | | James Aspnes,
Maurice Herlihy,
Nir Shavit:
Counting Networks.
J. ACM 41(5): 1020-1048 (1994) |
| 1993 |
|---|
| 9 | | 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 |
| 8 | | James Aspnes:
Time- and Space-Efficient Randomized Consensus.
J. Algorithms 14(3): 414-431 (1993) |
| 1992 |
|---|
| 7 | | James Aspnes,
Orli Waarts:
Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor
FOCS 1992: 137-146 |
| 1991 |
|---|
| 6 | | James Aspnes,
Maurice Herlihy,
Nir Shavit:
Counting Networks and Multi-Processor Coordination
STOC 1991: 348-358 |
| 5 | | James Aspnes,
Richard Beigel,
Merrick L. Furst,
Steven Rudich:
The Expressive Power of Voting Polynomials
STOC 1991: 402-409 |
| 1990 |
|---|
| 4 | | James Aspnes:
Time- and Space-Efficient Randomized Consensus.
PODC 1990: 325-331 |
| 3 | | James Aspnes,
Maurice Herlihy:
Wait-Free Data Structures in the Asynchronous PRAM Model.
SPAA 1990: 340-349 |
| 2 | | James Aspnes,
Maurice Herlihy:
Fast Randomized Consensus Using Shared Memory.
J. Algorithms 11(3): 441-461 (1990) |
| 1988 |
|---|
| 1 | | James Aspnes,
Alan Fekete,
Nancy A. Lynch,
Michael Merritt,
William E. Weihl:
A Theory of Timestamp-Based Concurrency Control for Nested Transactions.
VLDB 1988: 431-444 |
Data released under the ODC-BY 1.0 license — See also our legal information page