- Counting Networks1 James Aspnes y
- Towards Better Definitions and Measures of Internet Security (Position Paper)
- Stably computable properties of network graphs Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang,
- Yale University Department of Computer Science
- Towards a Theory of Data Entanglement , James Aspnes 1
- Randomized Protocols for Asynchronous Consensus James Aspnes
- Self-stabilizing Population Protocols Dana Angluin, James Aspnes , Michael J. Fischer, and Hong Jiang
- A Theory of Timestamp-Based Concurrency Control for Nested Transactions
- Randomized Consensus in Expected O(n log n) Individual Work
- Bulletin of the EATCS no 90, pp. 109126, October 2006 c European Association for Theoretical Computer Science
- Optimal-Time Adaptive Strong Renaming, with Applications to Counting
- Stably Computable Predicates are Semilinear Dana Angluin, James Aspnes and David Eisenstat
- Tight Bounds for Anonymous Adopt-Commit Objects James Aspnes
- On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine
- Relationships Between Broadcast and Shared Memory in Reliable Anonymous
- Inferring Social Networks from Outbreaks Dana Angluin1
- Combining Shared Coin Algorithms James Aspnes
- Journal of Machine Learning Research ?? (2009) ?????? Submitted 1/09; Revised 6/09; Published ?/?? Learning Acyclic Probabilistic Circuits Using Test Paths
- Skip B-Trees Ittai Abraham1
- Approximate Shared-Memory Counting Despite a Strong Adversary
- Yale University Department of Computer Science
- Mutation Systems Dana Angluin, James Aspnes, and Raonne Barbosa Vargas
- The Computational Power of Population Protocols Dana Angluin
- RANDOMIZED CONSENSUS IN EXPECTED O(N log2 N) OPERATIONS PER PROCESSOR
- Max Registers, Counters, and Monotone Circuits (Preliminary Version)
- A Modular Approach to Shared-Memory Consensus, with Applications to the Probabilistic-Write Model
- Distributed Computing manuscript No. (will be inserted by the editor)
- Ranged Hash Functions and the Price of Churn James Aspnes
- Fairness in Scheduling Miklos Ajtai James Aspnesy Moni Naorz Yuval Rabanix
- Path-Independent Load Balancing With Unreliable Machines James Aspnes
- Towards a Theory of Data Entanglement (Extended Abstract)
- Fast Computation by Population Protocols With a Dana Angluin1
- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
- Stably computable properties of network graphs Dana Angluin
- Wait-Free Consensus James Aspnes
- Decision Trees (Extended Abstract)
- Time-and Space-E cient Randomized Consensus James Aspnes
- Competitive Analysis of Distributed Algorithms James Aspnes?
- Tight Bounds for Adopt-Commit Objects James Aspnes
- A Simple Population Protocol for Fast Robust Approximate Majority
- Topology of sensor networks Population protocols
- The Complexity of Renaming Dan Alistarh
- Greedy Routing in Peer-to-Peer Systems James Aspnes
- Yale University Department of Computer Science
- Randomized Consensus in Expected O(n2 Total Work Using Single-Writer Registers
- On the Computational Complexity of Sensor Network Localization
- Randomized Load Balancing by Joining and Splitting Bins James Aspnes
- Yale University Department of Computer Science
- Decomposing consensus Building the components
- Tight bounds for anonymous adopt-commit objects James Aspnes1 Faith Ellen2
- The Expressive Power of Voting Polynomials James Aspnes y Richard Beigel z Merrick Furstx Steven Rudichx
- Fast Construction of Overlay Networks Dana Angluin
- Tight Bounds for Adopt-Commit
- Load Balancing and Locality in Range-Queriable Data James Aspnes
- Spreading Rumors Rapidly Despite an Adversary James Aspnes William Hurwoody
- arXiv:cs.CE/0101015v117Jan2001 A Combinatorial Toolbox for Protein Sequence Design and
- Population protocols Impossibility results
- Yale University Department of Computer Science
- Fairness in Scheduling (Extended Abstract)
- Computation in Networks of Passively Mobile Finite-State Dana Angluin
- Storage capacity of labeled graphs Dana Angluin1
- Polylogarithmic Concurrent Data Structures from Monotone James Aspnes
- Distributed Computing manuscript No. (will be inserted by the editor)
- Network Construction with Subgraph Connectivity Constraints
- Learning Large-Alphabet and Analog Circuits with Value Injection Queries
- Time and Space Lower Bounds for Restricted-Use Objects James Aspnes1, Hagit Attiya2, Keren Censor-Hillel3, Danny Hendler4
- Spreading Alerts Quietly and the Subgroup Escape Problem
- A Modular Measure of Competitiveness for Distributed Algorithms James Aspnes Orli Waartsy
- Yale University Department of Computer Science
- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
- O(log n)-time Overlay Network Construction from Graphs with Out-degree 1
- Yale University Department of Computer Science
- Yale University Department of Computer Science
- A Simple Population Protocol for Fast Robust Approximate Majority
- O(log n)-time Overlay Network Construction from Graphs with Out-degree 1
- Fault-tolerant Routing in Peer-to-peer Systems James Aspnes
- The Expansion and Mixing Time of Skip Graphs with Applications
- Yale University Department of Computer Science
- Spreading Rumors Rapidly Despite an Adversary James Aspnes William Hurwoody
- Approximate counting Randomized consensus
- Distributed Computing manuscript No. (will be inserted by the editor)
- A Theory of Competitive Analysis for Distributed Algorithms Miklos Ajtai
- Stably Computable Predicates are Semilinear Dana Angluin
- Approximate Shared-Memory Counting Despite a Strong Adversary James Aspnes
- Skip Graphs JAMES ASPNES1
- Modular Competitiveness for Distributed Algorithms James Aspnes Orli Waartsy
- On the Power of Anonymous One-Way Communication Dana Angluin1
- Low-Contention Data Structures$ James Aspnesa,1, David Eisenstat2, Yitong Yinb,3,
- A Theory of Competitive Analysis for Distributed Algorithms Miklos Ajtai James Aspnesy
- Lower Bounds for Distributed Coin-Flipping and Randomized Consensus James Aspnes
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- The Expansion and Mixing Time of Skip Graphs with Applications
- Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
- Low-Contention Data Structures [Extended Abstract]
- The Complexity of Renaming Dan Alistarh
- Population protocols Computation by epidemic
- Compositional Competitiveness for Distributed James Aspnes
- Learning a Circuit by Injecting Values Dana Angluin a
- Learning a Circuit by Injecting Values [Extended Abstract]
- Randomized consensus in expected O(n2 total work using single-writer registers
- Yale University Department of Computer Science
- Distributed Computing manuscript No. (will be inserted by the editor)
- THE DISTRIBUTED COMPUTING COLUMN MARIO MAVRONICOLAS
- Mutation Systems Dana Angluin James Aspnes Raonne Barbosa Vargas
- An Introduction to Population Protocols
- Sub-Logarithmic Test-and-Set Against a Weak Adversary
- Self-stabilizing Population Protocols Dana Angluin, James Aspnes, Michael J. Fischer
- Fast Randomized Consensus using Shared Memory
- Learning Large-Alphabet and Analog Circuits with Value Injection Queries
- Optimally Learning Social Networks with Activations and Suppressions
- Learning Acyclic Probabilistic Circuits Using Test Paths Dana Angluin1
- Wait-Free Consensus with Infinite Arrivals James Aspnes
- Lower Bounds for Restricted-Use Objects (Extended Abstract)
- Faster randomized consensus with an oblivious adversary James Aspnes
- Faster than Optimal Snapshots (for a While) James Aspnes