dblp.uni-trier.dewww.uni-trier.de

James Aspnes Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
88EEJames Aspnes, Hagit Attiya, Keren Censor: Max registers, counters, and monotone circuits. PODC 2009: 36-45
87EEJames Aspnes, Keren Censor: Approximate shared-memory counting despite a strong adversary. SODA 2009: 441-450
86EEJames Aspnes, Udi Wieder: The expansion and mixing time of skip graphs with applications. Distributed Computing 21(6): 385-393 (2009)
85EEDana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. J. Comput. Syst. Sci. 75(1): 60-77 (2009)
2008
84EEDana Angluin, James Aspnes, Lev Reyzin: Optimally Learning Social Networks with Activations and Suppressions. ALT 2008: 272-286
83EEDana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180
82EEJames Aspnes, Hagit Attiya, Keren Censor: Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334
81EEJames Aspnes, Muli Safra, Yitong Yin: Ranged hash functions and the price of churn. SODA 2008: 1066-1075
80EEDana Angluin, James Aspnes, David Eisenstat: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2): 87-102 (2008)
79EEDana Angluin, James Aspnes, David Eisenstat: Fast computation by population protocols with a leader. Distributed Computing 21(3): 183-199 (2008)
78EEDana 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)
77EEDana 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
75EEDana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65
74EEDana Angluin, James Aspnes, David Eisenstat: A Simple Population Protocol for Fast Robust Approximate Majority. DISC 2007: 20-32
73EEJames Aspnes, Yinghua Wu: O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. OPODIS 2007: 286-300
72EEJames Aspnes, Navin Rustagi, Jared Saia: Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. OPODIS 2007: 443-456
71EEJames Aspnes, Yang Richard Yang, Yitong Yin: Path-independent load balancing with unreliable machines. SODA 2007: 814-823
70EEJames Aspnes, Gauri Shah: Skip graphs. ACM Transactions on Algorithms 3(4): (2007)
69EEJames Aspnes: Editorial. Distributed Computing 19(4): 253 (2007)
68EEDana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols. Distributed Computing 20(4): 279-304 (2007)
67EEJames 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
65EEDana Angluin, James Aspnes, David Eisenstat: Fast Computation by Population Protocols with a Leader. DISC 2006: 61-75
64EEDana Angluin, James Aspnes, David Eisenstat: Stably computable predicates are semilinear. PODC 2006: 292-299
63EEDana Angluin, James Aspnes, Jiang Chen, Yinghua Wu: Learning a circuit by injecting values. STOC 2006: 584-593
62EEJames Aspnes, Yang Richard Yang, Yitong Yin: Path-independent load balancing with unreliable machines CoRR abs/cs/0607026: (2006)
61EEDana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: The computational power of population protocols CoRR abs/cs/0608084: (2006)
60EEJames Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Computing 18(3): 209-219 (2006)
59EEDana 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)
58EEJames 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)
57EEJames 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
55EEJames Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy: Spreading Alerts Quietly and the Subgroup Escape Problem. ASIACRYPT 2005: 253-272
54EEDana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta: Stably Computable Properties of Network Graphs. DCOSS 2005: 63-74
53EEDana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang: Self-stabilizing Population Protocols. OPODIS 2005: 103-117
52EEIttai Abraham, James Aspnes, Jian Yuan: Skip B-Trees. OPODIS 2005: 366-380
51EEDana Angluin, James Aspnes, David Eisenstat, Eric Ruppert: On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411
50EEJames Aspnes, Kevin L. Chang, Aleksandr Yampolskiy: Inoculation strategies for victims of viruses and the sum-of-squares partition problem. SODA 2005: 43-52
49EEJames Aspnes, Udi Wieder: The expansion and mixing time of skip graphs with applications. SPAA 2005: 126-134
48EEDana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin: Fast construction of overlay networks. SPAA 2005: 145-154
47EEJames Aspnes, Orli Waarts: Compositional competitiveness for distributed algorithms. J. Algorithms 54(2): 127-151 (2005)
2004
46EEJames Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang: On the Computational Complexity of Sensor Network Localization. ALGOSENSORS 2004: 32-44
45EEJames Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC 2004: 260-274
44EEJames Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong: Towards a Theory of Data Entanglement: (Extended Abstract). ESORICS 2004: 177-192
43EEJames Aspnes, Jonathan Kirsch, Arvind Krishnamurthy: Load balancing and locality in range-queriable data structures. PODC 2004: 115-124
42EEDana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta: Computation in networks of passively mobile finite-state sensors. PODC 2004: 290-299
2003
41EEJames Aspnes, Gauri Shah: Skip graphs. SODA 2003: 384-393
40EEJames Aspnes, Zoë Diamadi, Gauri Shah: Fault-tolerant routing in peer-to-peer systems CoRR cs.DS/0302022: (2003)
39EEJames Aspnes, Gauri Shah: Skip Graphs CoRR cs.DS/0306043: (2003)
38EEJames Aspnes, Orli Waarts: Compositional competitiveness for distributed algorithms CoRR cs.DS/0306044: (2003)
37EEJames Aspnes: Randomized protocols for asynchronous consensus. Distributed Computing 16(2-3): 165-175 (2003)
2002
36EEJames Aspnes, Zoë Diamadi, Gauri Shah: Fault-tolerant routing in peer-to-peer systems. PODC 2002: 223-232
35EEJames Aspnes, Gauri Shah, Jatin Shah: Wait-free consensus with infinite arrivals. STOC 2002: 524-533
34EEJames Aspnes: Fast Deterministic Consensus in a Noisy Environment CoRR cs.DS/0206012: (2002)
33EEJames Aspnes: Randomized protocols for asynchronous consensus CoRR cs.DS/0209014: (2002)
32EEJames 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
30EEJames 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
29EEJames 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
28EEJames 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
27EEJames Aspnes: Fast deterministic consensus in a noisy environment. PODC 2000: 299-308
26EEJames 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)
25EEKarhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao: Opportunity Cost Algorithms for Combinatorial Auctions CoRR cs.CE/0010031: (2000)
1998
24EEJames 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
21EEJames Aspnes: Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. STOC 1997: 559-568
20EEJames 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
17EEJames 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)
10EEJames Aspnes, Maurice Herlihy, Nir Shavit: Counting Networks. J. ACM 41(5): 1020-1048 (1994)
1993
9EEJames 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
4EEJames Aspnes: Time- and Space-Efficient Randomized Consensus. PODC 1990: 325-331
3EEJames 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
1EEJames 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

Coauthor Index

1Tarek F. Abdelzaher [66]
2Ittai Abraham [52]
3Marcos Kawazoe Aguilera [56]
4Miklós Ajtai [12] [13] [14] [22]
5Karhan Akcoglu [25]
6Brian D. O. Anderson [58]
7Dana Angluin [42] [48] [51] [53] [54] [59] [61] [63] [64] [65] [68] [74] [75] [77] [78] [79] [80] [83] [84] [85]
8Anish Arora [76]
9Hagit Attiya (Chagit Attiya) [82] [88]
10Yossi Azar [9] [20]
11Richard Beigel [5] [11]
12Peter N. Belhumeur [58]
13Keren Censor [82] [87] [88]
14Melody Chan [54]
15Kevin L. Chang [50] [57]
16Jiang Chen [48] [63] [75] [78] [83] [85]
17Bhaskar DasGupta [25]
18Zoë Diamadi [36] [40] [42] [55] [59]
19Cynthia Dwork [12] [13]
20David Eisenstat [51] [61] [64] [65] [68] [74] [79] [80] [83]
21Faith Ellen (Faith Ellen Fich, Faith E. Fich) [45] [60]
22Tolga Eren [58]
23Joan Feigenbaum [44] [67]
24Alan Fekete (Alan David Fekete, A. D. Fekete) [1]
25Amos Fiat [9] [20]
26David F. Fischer [26] [29]
27Michael J. Fischer [26] [29] [42] [53] [54] [59] [77]
28Merrick L. Furst [5] [11]
29Phillip B. Gibbons [66]
30Kristian Gjøsteen [55]
31David Kiyoshi Goldenberg [46] [58]
32Julia Hartling [28] [30] [31]
33Maurice Herlihy [2] [3] [6] [10]
34William Hurwood [18] [23]
35Hong Jiang [53] [54] [77]
36Ming-Yang Kao [25] [26] [28] [29] [30] [31]
37Junhyong Kim [28] [30] [31]
38Jonathan Kirsch [43]
39Arvind Krishnamurthy [43]
40Alok Kumar [26] [29]
41Nancy A. Lynch [1]
42Samuel Madden [76]
43Michael Merritt [1]
44A. Stephen Morse [58]
45Moni Naor [14] [22]
46René Peralta [42] [54] [55] [59]
47Serge A. Plotkin [9] [20]
48Yuval Rabani [14] [22]
49Ramesh Rao [66]
50Lev Reyzin [75] [78] [83] [84]
51Steven Rudich [5] [11]
52Eric Ruppert [45] [51] [60] [61] [68]
53Navin Rustagi [72]
54Muli Safra [81]
55Jared Saia [72]
56Christian Scheideler [76]
57Leonard J. Schulman [14] [22]
58Gauri Shah [28] [30] [31] [35] [36] [39] [40] [41] [70]
59Jatin Shah [35]
60Nir Shavit [6] [10]
61Orli Waarts [7] [9] [12] [13] [14] [15] [16] [17] [20] [22] [38] [47]
62William E. Weihl [1]
63Walter Whiteley [58]
64Udi Wieder [49] [86]
65Yinghua Wu [48] [63] [73] [85]
66Aleksandr Yampolskiy [44] [50] [55] [57] [67]
67Yang Richard Yang [46] [58] [62] [71]
68Yitong Yin [48] [62] [71] [81]
69Jian Yuan [52]
70Sheng Zhong [44] [67]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)