Travelled to:
1 × Canada
1 × Spain
6 × USA
Collaborated with:
O.Waarts D.Angluin ∅ R.B.Vargas G.Shah J.Shah M.Herlihy N.Shavit J.Chen Y.Wu R.Beigel M.L.Furst S.Rudich Y.Azar A.Fiat S.A.Plotkin A.Fekete N.A.Lynch M.Merritt W.E.Weihl
Talks about:
distribut (2) consensus (2) circuit (2) timestamp (1) processor (1) algorithm (1) transact (1) polynomi (1) competit (1) virtual (1)
Person: James Aspnes
DBLP: Aspnes:James
Contributed to:
Wrote 9 papers:
- LATA-2011-AngluinAV
- Mutation Systems (DA, JA, RBV), pp. 92–104.
- STOC-2006-AngluinACW #injection #learning
- Learning a circuit by injecting values (DA, JA, JC, YW), pp. 584–593.
- STOC-2002-AspnesSS #infinity
- Wait-free consensus with infinite arrivals (JA, GS, JS), pp. 524–533.
- STOC-1997-Aspnes #bound #distributed #random
- Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.
- STOC-1996-AspnesW #algorithm #composition #distributed
- Modular Competitiveness for Distributed Algorithms (JA, OW), pp. 237–246.
- STOC-1993-AspnesAFPW #online #scheduling
- On-line load balancing with applications to machine scheduling and virtual circuit routing (JA, YA, AF, SAP, OW), pp. 623–631.
- STOC-1991-AspnesBFR #power of
- The Expressive Power of Voting Polynomials (JA, RB, MLF, SR), pp. 402–409.
- STOC-1991-AspnesHS #coordination #multi #network
- Counting Networks and Multi-Processor Coordination (JA, MH, NS), pp. 348–358.
- VLDB-1988-AspnesFLMW #concurrent #formal method #transaction
- A Theory of Timestamp-Based Concurrency Control for Nested Transactions (JA, AF, NAL, MM, WEW), pp. 431–444.