The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
James Aspnes: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James Aspnes, Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl
    A Theory of Timestamp-Based Concurrency Control for Nested Transactions. [Citation Graph (5, 7)][DBLP]
    VLDB, 1988, pp:431-444 [Conf]
  2. James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
    On-line load balancing with applications to machine scheduling and virtual circuit routing. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:623-631 [Conf]
  3. James Aspnes, David Kiyoshi Goldenberg, Yang Richard Yang
    On the Computational Complexity of Sensor Network Localization. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:32-44 [Conf]
  4. James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
    Spreading Alerts Quietly and the Subgroup Escape Problem. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:253-272 [Conf]
  5. James Aspnes
    Competitive Analysis of Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:118-146 [Conf]
  6. Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
    Stably Computable Properties of Network Graphs. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2005, pp:63-74 [Conf]
  7. James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong
    Towards a Theory of Data Entanglement: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESORICS, 2004, pp:177-192 [Conf]
  8. Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
    A Theory of Competitive Analysis for Distributed Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:401-411 [Conf]
  9. James Aspnes, Orli Waarts
    Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:137-146 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:403-415 [Conf]
  11. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
    On the Power of Anonymous One-Way Communication. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:396-411 [Conf]
  12. Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
    Self-stabilizing Population Protocols. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:103-117 [Conf]
  13. Ittai Abraham, James Aspnes, Jian Yuan
    Skip B-Trees. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:366-380 [Conf]
  14. James Aspnes
    Fast deterministic consensus in a noisy environment. [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:299-308 [Conf]
  15. James Aspnes
    Time- and Space-Efficient Randomized Consensus. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:325-331 [Conf]
  16. James Aspnes, Zoë Diamadi, Gauri Shah
    Fault-tolerant routing in peer-to-peer systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:223-232 [Conf]
  17. James Aspnes, William Hurwood
    Spreading Rumors Rapidly Despite and Adversary. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:143-151 [Conf]
  18. James Aspnes, Jonathan Kirsch, Arvind Krishnamurthy
    Load balancing and locality in range-queriable data structures. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:115-124 [Conf]
  19. James Aspnes, Orli Waarts
    A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:252- [Conf]
  20. Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
    Competitiveness in Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:398- [Conf]
  21. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
    Computation in networks of passively mobile finite-state sensors. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:290-299 [Conf]
  22. Dana Angluin, James Aspnes, David Eisenstat
    Stably computable predicates are semilinear. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:292-299 [Conf]
  23. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:477-485 [Conf]
  24. James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy
    Inoculation strategies for victims of viruses and the sum-of-squares partition problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:43-52 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:745-754 [Conf]
  26. James Aspnes, Gauri Shah
    Skip graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:384-393 [Conf]
  27. James Aspnes, Maurice Herlihy
    Wait-Free Data Structures in the Asynchronous PRAM Model. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:340-349 [Conf]
  28. James Aspnes, Udi Wieder
    The expansion and mixing time of skip graphs with applications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:126-134 [Conf]
  29. Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin
    Fast construction of overlay networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:145-154 [Conf]
  30. Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
    Learning a circuit by injecting values. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:584-593 [Conf]
  31. James Aspnes
    Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:559-568 [Conf]
  32. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:402-409 [Conf]
  33. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks and Multi-Processor Coordination [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:348-358 [Conf]
  34. James Aspnes, Gauri Shah, Jatin Shah
    Wait-free consensus with infinite arrivals. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:524-533 [Conf]
  35. James Aspnes, Orli Waarts
    Modular Competitiveness for Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:237-246 [Conf]
  36. James Aspnes, Faith Ellen Fich, Eric Ruppert
    Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:260-274 [Conf]
  37. Dana Angluin, James Aspnes, David Eisenstat
    Fast Computation by Population Protocols with a Leader. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:61-75 [Conf]
  38. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:135-148 [Journal]
  39. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  40. Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao
    Opportunity Cost Algorithms for Combinatorial Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  41. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  42. James Aspnes
    Fast Deterministic Consensus in a Noisy Environment [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  43. James Aspnes
    Randomized protocols for asynchronous consensus [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  44. James Aspnes, Zoë Diamadi, Gauri Shah
    Fault-tolerant routing in peer-to-peer systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  45. James Aspnes, Gauri Shah
    Skip Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  46. James Aspnes, Orli Waarts
    Compositional competitiveness for distributed algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  47. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta
    Computation in networks of passively mobile finite-state sensors. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:235-253 [Journal]
  48. James Aspnes
    Randomized protocols for asynchronous consensus. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:165-175 [Journal]
  49. James Aspnes, Faith Ellen Fich, Eric Ruppert
    Relationships between broadcast and shared memory in reliable anonymous distributed systems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:209-219 [Journal]
  50. James Aspnes
    Lower Bounds for Distributed Coin-Flipping and Randomized Consensus. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:3, pp:415-450 [Journal]
  51. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:486-504 [Journal]
  52. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:1020-1048 [Journal]
  53. James Aspnes
    Time- and Space-Efficient Randomized Consensus. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:414-431 [Journal]
  54. James Aspnes, Maurice Herlihy
    Fast Randomized Consensus Using Shared Memory. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:3, pp:441-461 [Journal]
  55. James Aspnes, William Hurwood
    Spreading Rumors Rapidly Despite an Adversary. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:386-411 [Journal]
  56. James Aspnes, Orli Waarts
    Compositional competitiveness for distributed algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:2, pp:127-151 [Journal]
  57. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:306-357 [Journal]
  58. James Aspnes
    Fast deterministic consensus in a noisy environment. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:1, pp:16-39 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:5, pp:721-742 [Journal]
  60. James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy
    Inoculation strategies for victims of viruses and the sum-of-squares partition problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:6, pp:1077-1093 [Journal]
  61. James Aspnes, Orli Waarts
    Randomized Consensus in Expected O(n log² n) Operations Per Processor. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:5, pp:1024-1044 [Journal]
  62. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2006, v:5, n:12, pp:1663-1678 [Journal]
  63. Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
    Learning Large-Alphabet and Analog Circuits with Value Injection Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:51-65 [Conf]
  64. James Aspnes, Yang Richard Yang, Yitong Yin
    Path-independent load balancing with unreliable machines. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:814-823 [Conf]
  65. Dana Angluin, James Aspnes, David Eisenstat
    A Simple Population Protocol for Fast Robust Approximate Majority. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:20-32 [Conf]
  66. James Aspnes, Yang Richard Yang, Yitong Yin
    Path-independent load balancing with unreliable machines [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  67. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
    The computational power of population protocols [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  68. James Aspnes
    Editorial. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2007, v:19, n:4, pp:253- [Journal]

  69. Optimally Learning Social Networks with Activations and Suppressions. [Citation Graph (, )][DBLP]


  70. Inferring Social Networks from Outbreaks. [Citation Graph (, )][DBLP]


  71. Learning Acyclic Probabilistic Circuits Using Test Paths. [Citation Graph (, )][DBLP]


  72. Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. [Citation Graph (, )][DBLP]


  73. O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. [Citation Graph (, )][DBLP]


  74. Randomized consensus in expected O(n log n) individual work. [Citation Graph (, )][DBLP]


  75. Max registers, counters, and monotone circuits. [Citation Graph (, )][DBLP]


  76. A modular approach to shared-memory consensus, with applications to the probabilistic-write model. [Citation Graph (, )][DBLP]


  77. Ranged hash functions and the price of churn. [Citation Graph (, )][DBLP]


  78. Approximate shared-memory counting despite a strong adversary. [Citation Graph (, )][DBLP]


  79. Low-contention data structures. [Citation Graph (, )][DBLP]


  80. Storage Capacity of Labeled Graphs. [Citation Graph (, )][DBLP]


  81. The computational power of population protocols. [Citation Graph (, )][DBLP]


  82. A simple population protocol for fast robust approximate majority. [Citation Graph (, )][DBLP]


  83. Fast computation by population protocols with a leader. [Citation Graph (, )][DBLP]


  84. The expansion and mixing time of skip graphs with applications. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002