James Aspnes | Academic Influence

James Aspnes's AcademicInfluence.com Rankings

James Aspnes

Computer Science

#1997

World Rank

#2075

Historical Rank

#933

USA Rank

Database

#7628

World Rank

#7922

Historical Rank

#950

USA Rank

computer-science Degrees

Download Badge

Computer Science

James Aspnes's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Why Is James Aspnes Influential?

(Suggest an Edit or Addition)

According to Wikipedia, James Aspnes is a professor in Computer Science at Yale University. He earned his Ph.D. in computer science from Carnegie Mellon University in 1992. His main research interest is distributed algorithms.

(See a Problem?)

James Aspnes's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Skip graphs (2003) (736)
A Theory of Network Localization (2006) (625)
Computation in networks of passively mobile finite-state sensors (2004) (590)
On-line routing of virtual circuits with applications to load balancing and machine scheduling (1997) (295)
The computational power of population protocols (2006) (291)
Fast Randomized Consensus Using Shared Memory (1990) (268)
An Introduction to Population Protocols (2007) (239)
Fast computation by population protocols with a leader (2006) (225)
On-line load balancing with applications to machine scheduling and virtual circuit routing (1993) (225)
On the Computational Complexity of Sensor Network Localization (2004) (217)
The expressive power of voting polynomials (1991) (211)
Inoculation strategies for victims of viruses and the sum-of-squares partition problem (2005) (209)
A simple population protocol for fast robust approximate majority (2007) (208)
Counting networks (1994) (170)
Randomized protocols for asynchronous consensus (2002) (166)
Self-stabilizing population protocols (2005) (160)
Stably computable predicates are semilinear (2006) (149)
Fault-tolerant routing in peer-to-peer systems (2002) (128)
Wait-free data structures in the asynchronous PRAM model (1990) (121)
Time-Space Trade-offs in Population Protocols (2016) (113)
Load balancing and locality in range-queriable data structures (2004) (99)
Space-Optimal Majority in Population Protocols (2017) (93)
Stably Computable Properties of Network Graphs (2005) (91)
Counting networks and multi-processor coordination (1991) (81)
A theory of competitive analysis for distributed algorithms (1994) (75)
Exposing Computationally-Challenged Byzantine Impostors (2005) (72)
Time-and space-efficient randomized consensus (1990) (59)
Randomized Consensus in Expected O(n log² n) Operations Per Processor (1996) (58)
Fast construction of overlay networks (2005) (55)
Fairness in scheduling (1995) (50)
Lower bounds for distributed coin-flipping and randomized consensus (1997) (49)
Opportunity Cost Algorithms for Combinatorial Auctions (2000) (49)
Polylogarithmic concurrent data structures from monotone circuits (2012) (43)
The expansion and mixing time of skip graphs with applications (2005) (39)
Inferring Social Networks from Outbreaks (2010) (38)
Sub-logarithmic Test-and-Set against a Weak Adversary (2011) (37)
The Complexity of Renaming (2011) (36)
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network? (2007) (36)
Fast deterministic consensus in a noisy environment (2000) (35)
Optimal-time adaptive strong renaming, with applications to counting (2011) (33)
Relationships between broadcast and shared memory in reliable anonymous distributed systems (2004) (33)
Wait-free consensus with infinite arrivals (2002) (33)
A modular approach to shared-memory consensus, with applications to the probabilistic-write model (2010) (33)
Randomized consensus in expected O(n log/sup 2/ n) operations per processor (1992) (31)
Time- and Space-Efficient Randomized Consensus (1993) (30)
Faster randomized consensus with an oblivious adversary (2012) (28)
Approximate shared-memory counting despite a strong adversary (2009) (28)
Lower bounds for distributed coin-flipping and randomized consensus (1998) (27)
Counting with Population Protocols (2015) (27)
O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1 (2007) (27)
Time and Space Optimal Counting in Population Protocols (2016) (26)
Max registers, counters, and monotone circuits (2009) (26)
On the Power of Anonymous One-Way Communication (2005) (26)
Time-and Space-eecient Randomized Consensus (1992) (26)
Tight Bounds for Adopt-Commit Objects (2014) (26)
Towards a theory of data entanglement (2007) (25)
A Theory of Timestamp-Based Concurrency Control for Nested Transactions (1988) (24)
Spreading rumors rapidly despite an adversary (1996) (24)
The FuzzyLog: A Partially Ordered Shared Log (2018) (23)
Communication-efficient randomized consensus (2014) (21)
Tight Bounds for Asynchronous Renaming (2014) (20)
Skip B-Trees (2005) (20)
Modular competitiveness for distributed algorithms (1996) (19)
A summary and analysis of bachelor of science degree requirements reported by 125 electrical engineering departments (1994) (16)
Network construction with subgraph connectivity constraints (2015) (15)
Learning a circuit by injecting values (2006) (15)
Randomized consensus in expected O(n log n) individual work (2008) (14)
Eight Open Problems in Distributed Computing (2006) (12)
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (2015) (12)
Distributed Data Structures for Peer-to-Peer Systems (2005) (12)
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping (2013) (11)
Optimally learning social networks with activations and suppressions (2008) (11)
Why extension-based proofs fail (2018) (11)
Learning large-alphabet and analog circuits with value injection queries (2007) (11)
Competitive Analysis of Distributed Algorithms (1996) (11)
Notes on Theory of Distributed Systems (2014) (10)
Clocked Population Protocols (2017) (10)
Combining shared-coin algorithms (2010) (9)
On the learnability of shuffle ideals (2012) (7)
Towards understanding the predictability of stock markets from the perspective of computational complexity (2000) (7)
Tight bounds for anonymous adopt-commit objects (2011) (7)
Slightly smaller splitter networks (2010) (7)
Allocate-On-Use Space Complexity of Shared-Memory Algorithms (2018) (6)
Dynamic Task Allocation in Asynchronous Shared Memory (2014) (6)
k + Decision Trees - (Extended Abstract) (2010) (6)
Faster than optimal snapshots (for a while): preliminary version (2012) (6)
Message complexity of population protocols (2020) (6)
Lower bounds for restricted-use objects: extended abstract (2012) (6)
Faster than Optimal Snapshots ( for a While ) (2012) (5)
Learning Acyclic Probabilistic Circuits Using Test Paths (2009) (5)
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers (2011) (5)
Time-Space Trade-offs in Molecular Computation (2016) (5)
A modular measure of competitiveness for distributed algorithms (1995) (5)
k Decision Trees (2009) (5)
Lower Bounds for Restricted-Use Objects (2016) (5)
Brief Announcement: Why Extension-Based Proofs Fail (2020) (4)
Distributed Algorithms for Maintaining Dynamic Expander Graphs (2008) (4)
Low-contention data structures (2010) (4)
Compositional competitiveness for distributed algorithms (2003) (4)
Path-independent load balancing with unreliable machines (2006) (4)
Randomized loose renaming in o(log log n) time (2013) (4)
Greedy Routing in Peer-to-Peer Systems ∗ (2006) (3)
Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems (2007) (3)
Brief Announcement: Object Oriented Consensus (2017) (3)
Optimizing in the Dark: Learning an Optimal Solution through a Simple Request Interface (2019) (3)
Spreading Alerts Quietly and the Subgroup Escape Problem (2005) (3)
Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths (2018) (3)
Ranged hash functions and the price of churn (2008) (3)
Dynamic Task Allocation (2013) (3)
k+ decision trees – (extended abstract) (2010) (2)
Depth of a Random Binary Search Tree with Concurrent Insertions (2016) (2)
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model (2001) (2)
Effective storage capacity of labeled graphs (2014) (2)
Towards Better Definitions and Measures of Internet Security (2011) (2)
Atomic snapshots in expected O(log3 n) steps using randomized helping (2013) (2)
Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings (2007) (2)
Towards a Theory of Data Entanglement: (Extended Abstract) (2004) (2)
Notes on Discrete Mathematics CS 202: Fall 2013 (2014) (2)
Approximate Majority With Catalytic Inputs (2020) (2)
A Population Protocol for Binary Signaling Consensus (2016) (2)
Mutation systems (2011) (2)
A modular approach to shared-memory consensus, with applications to the probabilistic-write model (2011) (1)
Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings (2006) (1)
Collisions Lead to Shallower Decision Trees (2008) (1)
Communication-efficient randomized consensus (2017) (1)
Object Oriented Consensus (2017) (1)
Faster randomized consensus with an oblivious adversary (2013) (1)
Competitiveness in distributed algorithms (1994) (1)
Notes on Randomized Algorithms (2014) (1)
Notes on Linear Algebra (2005) (1)
Notes on Randomized Algorithms CS 469/569: Spring 2011 (2011) (1)
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (2018) (1)
21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017 (2018) (1)
Randomized load balancing by joining and splitting bins (2012) (1)
Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
A one-bit swap object using test-and-sets and a max register (2012) (0)
Editorial (2013) (0)
Fast construction algorithms for overlay networks (2009) (0)
The Distributed Computing Column an Introduction to Population Protocols (2007) (0)
New Haven , CT 06520 – 8285 Urn Automata (2006) (0)
Network construction with subgraph connectivity constraints (2013) (0)
Improved Randomized Upper Bounds for Conflict Detectors and Strong Group Renaming Computer Science 490 Project (2012) (0)
7-2010 k + Decision Trees (2015) (0)
Ju n 20 03 Compositional Competitiveness for Distributed Algorithms ∗ (2013) (0)
Concept Learning Using Equivalence Queries With Random Target Concepts , Random Hypotheses , and Random Counterexamples (2017) (0)
Erratum (2018) (0)
Session details: Distributed algorithms (2011) (0)
Timestamp ordering and nested transactions (1987) (0)
Front Matter, Table of Contents, Preface, Conference Organization (2017) (0)
Max Registers, Counters, and Monotone Circuits (Preliminary Version) (2009) (0)
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model (2023) (0)
Low-Contention Data Structures ( Regular Submission ) (2010) (0)
Low-Contention Data Structures (Extended Abstract) (2010) (0)
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013) (2016) (0)
Finding an Optimal Hitting Set of a Fixed Size for Special Graphs (2008) (0)
Optimizing in the Dark: Learning Optimal Network Resource Reservation Through a Simple Request Interface (2021) (0)
The Computational Power of Collision Detection (2008) (0)
Storage Capacity of Labeled Graphs (2010) (0)
Yale University Department of Computer Science Towards a Theory of Data Entanglement (2004) (0)
Counting Networks and Multi-processor Coordination (extended Abstract) (1991) (0)
Consensus with max registers 1 (2019) (0)
Assigning and Scheduling Teachers and Students (2016) (0)
Wait-Free Consensus (1992) (0)
Session details: Joint session (2005) (0)
WHY EXTENSION-BASED (2023) (0)
Notes on induction proofs and recursive definitions (2010) (0)
Consensus with Max Registers (2019) (0)
Distributed Computing in Sensor Systems (vol. # 4026) Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings (2006) (0)
Tight Bounds for Adopt-Commit Objects (2013) (0)
Randomized Loose Renaming in O(loglogn) Time (Extended Abstract) (2013) (0)
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference (2022) (0)
Session details: Routing and distributed algorithms (2013) (0)
RESEARCH ARTICLE Mutation systems (2012) (0)
Privacy in Population Protocols with Probabilistic Scheduling (2023) (0)
Concurrent Use of Write-Once Memory (2016) (0)
Societies of randomly interacting finite-state automata (2004) (0)
Efficient cryptographic tools for secure distributed computing (2006) (0)
4 : 2 Deterministic Subgraph Detection in Broadcast CONGEST Results (0)
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005 (2005) (0)

This paper list is powered by the following services:

Other Resources About James Aspnes

en.wikipedia.org

What Schools Are Affiliated With James Aspnes?

James Aspnes is affiliated with the following schools: