James Aspnes - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Optimal-time adaptive strong renaming, with applications to countingDan Alistarh, James Aspnes, Keren Censor Hillel, Seth Gilbert, Morteza Zadimoghaddam. podc 2011: 239-248 [doi]

Mutation SystemsDana Angluin, James Aspnes, Raonne Barbosa Vargas. LATA 2011: 92-104 [doi]

Tight bounds for anonymous adopt-commit objectsJames Aspnes, Faith Ellen. spaa 2011: 317-324 [doi]

2010

Inferring Social Networks from OutbreaksDana Angluin, James Aspnes, Lev Reyzin. alt 2010: 104-118 [doi]

Optimally learning social networks with activations and suppressionsDana Angluin, James Aspnes, Lev Reyzin. TCS, 411(29-30):2729-2740, 2010. [doi]

Storage Capacity of Labeled GraphsDana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod. sss 2010: 573-587 [doi]

Approximate shared-memory counting despite a strong adversaryJames Aspnes, Keren Censor. talg, 6(2), 2010. [doi]

k::: + ::: Decision Trees - (Extended Abstract)James Aspnes, Eric Blais, Murat Demirbas, Ryan O Donnell, Atri Rudra, Steve Uurtamo. algosensors 2010: 74-88 [doi]

Combining shared-coin algorithmsJames Aspnes, Hagit Attiya, Keren Censor. jpdc, 70(3):317-322, 2010. [doi]

Low-contention data structuresJames Aspnes, David Eisenstat, Yitong Yin. spaa 2010: 345-354 [doi]

A modular approach to shared-memory consensus, with applications to the probabilistic-write modelJames Aspnes. podc 2010: 460-467 [doi]

2009

2008

Learning large-alphabet and analog circuits with value injection queriesDana Angluin, James Aspnes, Jiang Chen, Lev Reyzin. ml, 72(1-2):113-138, 2008. [doi]

Optimally Learning Social Networks with Activations and SuppressionsDana Angluin, James Aspnes, Lev Reyzin. alt 2008: 272-286 [doi]

Learning Acyclic Probabilistic Circuits Using Test PathsDana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin. colt 2008: 169-180 [doi]

Self-stabilizing population protocolsDana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang. taas, 3(4), 2008. [doi]

Fast computation by population protocols with a leaderDana Angluin, James Aspnes, David Eisenstat. dc, 21(3):183-199, 2008. [doi]

A simple population protocol for fast robust approximate majorityDana Angluin, James Aspnes, David Eisenstat. dc, 21(2):87-102, 2008. [doi]

Randomized consensus in expected O(n log n) individual workJames Aspnes, Hagit Attiya, Keren Censor. podc 2008: 325-334 [doi]

Ranged hash functions and the price of churnJames Aspnes, Muli Safra, Yitong Yin. soda 2008: 1066-1075 [doi]

2007

Learning Large-Alphabet and Analog Circuits with Value Injection QueriesDana Angluin, James Aspnes, Jiang Chen, Lev Reyzin. colt 2007: 51-65 [doi]

A Simple Population Protocol for Fast Robust Approximate MajorityDana Angluin, James Aspnes, David Eisenstat. wdag 2007: 20-32 [doi]

The computational power of population protocolsDana Angluin, James Aspnes, David Eisenstat, Eric Ruppert. dc, 20(4):279-304, 2007. [doi]

EditorialJames Aspnes. dc, 19(4):253, 2007. [doi]

Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, ProceedingsJames Aspnes, Christian Scheideler, Anish Arora, Samuel Madden, editors, Volume 4549 of Lecture Notes in Computer Science, Springer, 2007.

Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?James Aspnes, Navin Rustagi, Jared Saia. opodis 2007: 443-456 [doi]

Path-independent load balancing with unreliable machinesJames Aspnes, Yang Richard Yang, Yitong Yin. soda 2007: 814-823 [doi]

O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1James Aspnes, Yinghua Wu. opodis 2007: 286-300 [doi]

Skip graphsJames Aspnes, Gauri Shah. talg, 3(4), 2007. [doi]

Towards a theory of data entanglementJames Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong. TCS, 389(1-2):26-43, 2007. [doi]

2006

Learning a circuit by injecting valuesDana Angluin, James Aspnes, Jiang Chen, Yinghua Wu. stoc 2006: 584-593 [doi]

Stably computable predicates are semilinearDana Angluin, James Aspnes, David Eisenstat. podc 2006: 292-299 [doi]

Computation in networks of passively mobile finite-state sensorsDana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, René Peralta. dc, 18(4):235-253, 2006. [doi]

Fast Computation by Population Protocols with a LeaderDana Angluin, James Aspnes, David Eisenstat. wdag 2006: 61-75 [doi]

A Theory of Network LocalizationJames Aspnes, Tolga Eren, David Kiyoshi Goldenberg, A. Stephen Morse, Walter Whiteley, Yang Richard Yang, Brian D. O. Anderson, Peter N. Belhumeur. tmc, 5(12):1663-1678, 2006. [doi]

Relationships between broadcast and shared memory in reliable anonymous distributed systemsJames Aspnes, Faith Ellen Fich, Eric Ruppert. dc, 18(3):209-219, 2006. [doi]

Inoculation strategies for victims of viruses and the sum-of-squares partition problemJames Aspnes, Kevin L. Chang, Aleksandr Yampolskiy. jcss, 72(6):1077-1093, 2006. [doi]

Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, ProceedingsPhillip B. Gibbons, Tarek F. Abdelzaher, James Aspnes, Ramesh Rao, editors, Volume 4026 of Lecture Notes in Computer Science, Springer, 2006.

2005

Skip B-TreesIttai Abraham, James Aspnes, Jian Yuan. opodis 2006: 366-380 [doi]

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005Marcos Kawazoe Aguilera, James Aspnes, editors, ACM, 2005.

Fast construction of overlay networksDana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin. spaa 2005: 145-154 [doi]

On the Power of Anonymous One-Way CommunicationDana Angluin, James Aspnes, David Eisenstat, Eric Ruppert. opodis 2006: 396-411 [doi]

Self-stabilizing Population ProtocolsDana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang. opodis 2006: 103-117 [doi]

Stably Computable Properties of Network GraphsDana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta. dcoss 2005: 63-74 [doi]

Spreading Alerts Quietly and the Subgroup Escape ProblemJames Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy. asiacrypt 2005: 253-272 [doi]

Inoculation strategies for victims of viruses and the sum-of-squares partition problemJames Aspnes, Kevin L. Chang, Aleksandr Yampolskiy. soda 2005: 43-52 [doi]

Compositional competitiveness for distributed algorithmsJames Aspnes, Orli Waarts. jal, 54(2):127-151, 2005. [doi]

The expansion and mixing time of skip graphs with applicationsJames Aspnes, Udi Wieder. spaa 2005: 126-134 [doi]

2004

2003

Randomized protocols for asynchronous consensusJames Aspnes. dc, 16(2-3):165-175, 2003. [doi]

Skip graphsJames Aspnes, Gauri Shah. soda 2003: 384-393 [doi]

2002

2001

Towards understanding the predictability of stock markets from the perspective of computational complexityJames Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar. soda 2001: 745-754 [doi]

A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical ModelJames Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah. isaac 2001: 403-415 [doi]

2000

Fast deterministic consensus in a noisy environmentJames Aspnes. podc 2000: 299-308 [doi]

1998

Fairness in SchedulingMiklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts. jal, 29(2):306-357, 1998.

Spreading Rumors Rapidly Despite an AdversaryJames Aspnes, William Hurwood. jal, 26(2):386-411, 1998.

Lower Bounds for Distributed Coin-Flipping and Randomized ConsensusJames Aspnes. JACM, 45(3):415-450, 1998. [doi]

1997

Lower Bounds for Distributed Coin-Flipping and Randomized ConsensusJames Aspnes. stoc 1997: 559-568 [doi]

On-line routing of virtual circuits with applications to load balancing and machine schedulingJames Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts. JACM, 44(3):486-504, 1997. [doi]

1996

Modular Competitiveness for Distributed AlgorithmsJames Aspnes, Orli Waarts. stoc 1996: 237-246 [doi]

Spreading Rumors Rapidly Despite and AdversaryJames Aspnes, William Hurwood. podc 1996: 143-151

Randomized Consensus in Expected O(n log² n) Operations Per ProcessorJames Aspnes, Orli Waarts. siamcomp, 25(5):1024-1044, 1996.

Competitive Analysis of Distributed AlgorithmsJames Aspnes. dagstuhl 1998: 118-146

1995

Fairness in SchedulingMiklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts. soda 1995: 477-485

A Modular Measure of Competitiveness for Distributed Algorithms (Abstract)James Aspnes, Orli Waarts. podc 1995: 252

1994

1993

Time- and Space-Efficient Randomized ConsensusJames Aspnes. jal, 14(3):414-431, 1993.

On-line load balancing with applications to machine scheduling and virtual circuit routingJames Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts. stoc 1993: 623-631 [doi]

1992

Randomized Consensus in Expected O(n log ^2 n) Operations Per ProcessorJames Aspnes, Orli Waarts. focs 1992: 137-146

1991

The Expressive Power of Voting PolynomialsJames Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich. stoc 1991: 402-409

Counting Networks and Multi-Processor CoordinationJames Aspnes, Maurice Herlihy, Nir Shavit. stoc 1991: 348-358

1990

Fast Randomized Consensus Using Shared MemoryJames Aspnes, Maurice Herlihy. jal, 11(3):441-461, 1990.

Time- and Space-Efficient Randomized ConsensusJames Aspnes. podc 1990: 325-331 [doi]

Wait-Free Data Structures in the Asynchronous PRAM ModelJames Aspnes, Maurice Herlihy. spaa 1990: 340-349 [doi]

1988

A Theory of Timestamp-Based Concurrency Control for Nested TransactionsJames Aspnes, Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl. VLDB 1988: 431-444 [doi]