The SCEAS System
| |||||||

## Search the dblp DataBase
James Aspnes:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - James Aspnes
**Competitive Analysis of Distributed Algorithms.**[Citation Graph (0, 0)][DBLP] Online Algorithms, 1996, pp:118-146 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
**Self-stabilizing Population Protocols.**[Citation Graph (0, 0)][DBLP] OPODIS, 2005, pp:103-117 [Conf] - Ittai Abraham, James Aspnes, Jian Yuan
**Skip B-Trees.**[Citation Graph (0, 0)][DBLP] OPODIS, 2005, pp:366-380 [Conf] - James Aspnes
**Fast deterministic consensus in a noisy environment.**[Citation Graph (0, 0)][DBLP] PODC, 2000, pp:299-308 [Conf] - James Aspnes
**Time- and Space-Efficient Randomized Consensus.**[Citation Graph (0, 0)][DBLP] PODC, 1990, pp:325-331 [Conf] - 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] - James Aspnes, William Hurwood
**Spreading Rumors Rapidly Despite and Adversary.**[Citation Graph (0, 0)][DBLP] PODC, 1996, pp:143-151 [Conf] - 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] - James Aspnes, Orli Waarts
**A Modular Measure of Competitiveness for Distributed Algorithms (Abstract).**[Citation Graph (0, 0)][DBLP] PODC, 1995, pp:252- [Conf] - Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts
**Competitiveness in Distributed Algorithms.**[Citation Graph (0, 0)][DBLP] PODC, 1994, pp:398- [Conf] - 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] - Dana Angluin, James Aspnes, David Eisenstat
**Stably computable predicates are semilinear.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:292-299 [Conf] - 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] - 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] - 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] - James Aspnes, Gauri Shah
**Skip graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:384-393 [Conf] - James Aspnes, Maurice Herlihy
**Wait-Free Data Structures in the Asynchronous PRAM Model.**[Citation Graph (0, 0)][DBLP] SPAA, 1990, pp:340-349 [Conf] - 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] - 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] - 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] - James Aspnes
**Lower Bounds for Distributed Coin-Flipping and Randomized Consensus.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:559-568 [Conf] - 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] - James Aspnes, Maurice Herlihy, Nir Shavit
**Counting Networks and Multi-Processor Coordination**[Citation Graph (0, 0)][DBLP] STOC, 1991, pp:348-358 [Conf] - James Aspnes, Gauri Shah, Jatin Shah
**Wait-free consensus with infinite arrivals.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:524-533 [Conf] - James Aspnes, Orli Waarts
**Modular Competitiveness for Distributed Algorithms.**[Citation Graph (0, 0)][DBLP] STOC, 1996, pp:237-246 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - James Aspnes
**Fast Deterministic Consensus in a Noisy Environment**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - James Aspnes
**Randomized protocols for asynchronous consensus**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - 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] - James Aspnes, Gauri Shah
**Skip Graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - James Aspnes, Orli Waarts
**Compositional competitiveness for distributed algorithms**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - 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] - James Aspnes
**Randomized protocols for asynchronous consensus.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2003, v:16, n:2-3, pp:165-175 [Journal] - 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] - 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] - 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] - James Aspnes, Maurice Herlihy, Nir Shavit
**Counting Networks.**[Citation Graph (0, 0)][DBLP] J. ACM, 1994, v:41, n:5, pp:1020-1048 [Journal] - James Aspnes
**Time- and Space-Efficient Randomized Consensus.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1993, v:14, n:3, pp:414-431 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - James Aspnes
**Editorial.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2007, v:19, n:4, pp:253- [Journal] **Optimally Learning Social Networks with Activations and Suppressions.**[Citation Graph (, )][DBLP]**Inferring Social Networks from Outbreaks.**[Citation Graph (, )][DBLP]**Learning Acyclic Probabilistic Circuits Using Test Paths.**[Citation Graph (, )][DBLP]**Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?.**[Citation Graph (, )][DBLP]**O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1.**[Citation Graph (, )][DBLP]**Randomized consensus in expected O(n log n) individual work.**[Citation Graph (, )][DBLP]**Max registers, counters, and monotone circuits.**[Citation Graph (, )][DBLP]**A modular approach to shared-memory consensus, with applications to the probabilistic-write model.**[Citation Graph (, )][DBLP]**Ranged hash functions and the price of churn.**[Citation Graph (, )][DBLP]**Approximate shared-memory counting despite a strong adversary.**[Citation Graph (, )][DBLP]**Low-contention data structures.**[Citation Graph (, )][DBLP]**Storage Capacity of Labeled Graphs.**[Citation Graph (, )][DBLP]**The computational power of population protocols.**[Citation Graph (, )][DBLP]**A simple population protocol for fast robust approximate majority.**[Citation Graph (, )][DBLP]**Fast computation by population protocols with a leader.**[Citation Graph (, )][DBLP]**The expansion and mixing time of skip graphs with applications.**[Citation Graph (, )][DBLP]
Search in 0.008secs, Finished in 0.012secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |