Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2009 | |
---|---|---|

88 | EE | James Aspnes, Hagit Attiya, Keren Censor: Max registers, counters, and monotone circuits. PODC 2009: 36-45 |

87 | EE | James Aspnes, Keren Censor: Approximate shared-memory counting despite a strong adversary. SODA 2009: 441-450 |

86 | EE | James Aspnes, Udi Wieder: The expansion and mixing time of skip graphs with applications. Distributed Computing 21(6): 385-393 (2009) |

85 | EE | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. J. Comput. Syst. Sci. 75(1): 60-77 (2009) |

2008 | ||

84 | EE | Dana Angluin, James Aspnes, Lev Reyzin: Optimally Learning Social Networks with Activations and Suppressions. ALT 2008: 272-286 |

83 | EE | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180 |

82 | EE | James Aspnes, Hagit Attiya, Keren Censor: Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334 |

81 | EE | James Aspnes, Muli Safra, Yitong Yin: Ranged hash functions and the price of churn. SODA 2008: 1066-1075 |

80 | EE | Dana Angluin, James Aspnes, David Eisenstat: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2): 87-102 (2008) |

79 | EE | Dana Angluin, James Aspnes, David Eisenstat: Fast computation by population protocols with a leader. Distributed Computing 21(3): 183-199 (2008) |

78 | EE | 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) |

77 | EE | Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing population protocols. TAAS 3(4): (2008) |

2007 | ||

76 | 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 | |

75 | EE | Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65 |

74 | EE | Dana Angluin, James Aspnes, David Eisenstat: A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32 |

73 | EE | James Aspnes, Yinghua Wu: O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. OPODIS 2007: 286-300 |

72 | EE | 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 |

71 | EE | James Aspnes, Yang Richard Yang, Yitong Yin: Path-independent load balancing with unreliable machines. SODA 2007: 814-823 |

70 | EE | James Aspnes, Gauri Shah: Skip graphs. ACM Transactions on Algorithms 3(4): (2007) |

69 | EE | James Aspnes: Editorial. Distributed Computing 19(4): 253 (2007) |

68 | EE | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. Distributed Computing 20(4): 279-304 (2007) |

67 | EE | James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong: Towards a theory of data entanglement. Theor. Comput. Sci. 389(1-2): 26-43 (2007) |

2006 | ||

66 | Phillip B. Gibbons, Tarek F. Abdelzaher, James Aspnes, Ramesh Rao: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings Springer 2006 | |

65 | EE | Dana Angluin, James Aspnes, David Eisenstat: Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75 |

64 | EE | Dana Angluin, James Aspnes, David Eisenstat: Stably computable predicates are semilinear. PODC 2006: 292-299 |

63 | EE | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. STOC 2006: 584-593 |

62 | EE | James Aspnes, Yang Richard Yang, Yitong Yin: Path-independent load balancing with unreliable machines CoRR abs/cs/0607026: (2006) |

61 | EE | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols CoRR abs/cs/0608084: (2006) |

60 | EE | 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) |

59 | EE | 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) |

58 | EE | 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) |

57 | EE | 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 | ||

56 | 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 | |

55 | EE | James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy: Spreading Alerts Quietly and the Subgroup Escape Problem. ASIACRYPT 2005: 253-272 |

54 | EE | Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta: Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74 |

53 | EE | Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing Population Protocols. OPODIS 2005: 103-117 |

52 | EE | Ittai Abraham, James Aspnes, Jian Yuan: Skip B-Trees. OPODIS 2005: 366-380 |

51 | EE | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411 |

50 | EE | James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy: Inoculation strategies for victims of viruses and the sum-of-squares partition problem. SODA 2005: 43-52 |

49 | EE | James Aspnes, Udi Wieder: The expansion and mixing time of skip graphs with applications. SPAA 2005: 126-134 |

48 | EE | Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin: Fast construction of overlay networks. SPAA 2005: 145-154 |

47 | EE | James Aspnes, Orli Waarts: Compositional competitiveness for distributed algorithms. J. Algorithms 54(2): 127-151 (2005) |

2004 | ||

46 | EE | James Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang: On the Computational Complexity of Sensor Network Localization. ALGOSENSORS 2004: 32-44 |

45 | EE | James Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC 2004: 260-274 |

44 | EE | James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong: Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS 2004: 177-192 |

43 | EE | James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy: Load balancing and locality in range-queriable data structures. PODC 2004: 115-124 |

42 | EE | 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 | EE | James Aspnes, Gauri Shah: Skip graphs. SODA 2003: 384-393 |

40 | EE | James Aspnes, Zoë Diamadi, Gauri Shah: Fault-tolerant routing in peer-to-peer systems CoRR cs.DS/0302022: (2003) |

39 | EE | James Aspnes, Gauri Shah: Skip Graphs CoRR cs.DS/0306043: (2003) |

38 | EE | James Aspnes, Orli Waarts: Compositional competitiveness for distributed algorithms CoRR cs.DS/0306044: (2003) |

37 | EE | James Aspnes: Randomized protocols for asynchronous consensus. Distributed Computing 16(2-3): 165-175 (2003) |

2002 | ||

36 | EE | James Aspnes, Zoë Diamadi, Gauri Shah: Fault-tolerant routing in peer-to-peer systems. PODC 2002: 223-232 |

35 | EE | James Aspnes, Gauri Shah, Jatin Shah: Wait-free consensus with infinite arrivals. STOC 2002: 524-533 |

34 | EE | James Aspnes: Fast Deterministic Consensus in a Noisy Environment CoRR cs.DS/0206012: (2002) |

33 | EE | James Aspnes: Randomized protocols for asynchronous consensus CoRR cs.DS/0209014: (2002) |

32 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | James Aspnes: Fast deterministic consensus in a noisy environment. PODC 2000: 299-308 |

26 | EE | 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 | EE | Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao: Opportunity Cost Algorithms for Combinatorial Auctions CoRR cs.CE/0010031: (2000) |

1998 | ||

24 | EE | 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 | EE | James Aspnes: Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. STOC 1997: 559-568 |

20 | EE | 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 | EE | 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 | EE | James Aspnes, Maurice Herlihy, Nir Shavit: Counting Networks. J. ACM 41(5): 1020-1048 (1994) |

1993 | ||

9 | EE | 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 | EE | James Aspnes: Time- and Space-Efficient Randomized Consensus. PODC 1990: 325-331 |

3 | EE | 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 | EE | 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 |