Andréa W. Richa
#169,158
Most Influential Person Now
Brazilian-American computer scientist
Andréa W. Richa's AcademicInfluence.com Rankings
Andréa W. Richacomputer-science Degrees
Computer Science
#10706
World Rank
#11258
Historical Rank
Distributed Computing
#17
World Rank
#18
Historical Rank
Database
#8826
World Rank
#9269
Historical Rank
Download Badge
Computer Science
Why Is Andréa W. Richa Influential?
(Suggest an Edit or Addition)According to Wikipedia, Andréa Werneck Richa is a Brazilian-American computer scientist known for her research in distributed computing, self-organizing particle systems, network routing and replication, and bio-inspired computing. She is a President's Professor of computer science and engineering at Arizona State University.
Andréa W. Richa'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
- Accessing Nearby Copies of Replicated Objects in a Distributed Environment (1997) (953)
- The power of two random choices: a survey of tech-niques and results (2001) (434)
- Coping with a Smart Jammer in Wireless Networks: A Stackelberg Game Approach (2013) (190)
- Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules (1995) (162)
- Stabilization, Safety, and Security of Distributed Systems (2012) (162)
- A jamming-resistant MAC protocol for single-hop wireless networks (2008) (161)
- An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model (2008) (117)
- Tight analyses of two local load balancing algorithms (1995) (97)
- Amoebot - a new model for programmable matter (2014) (84)
- New approximation techniques for some ordering problems (1998) (76)
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs (2009) (73)
- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks (2010) (71)
- Universal Shape Formation for Programmable Matter (2016) (71)
- Linearization: Locally Self-Stabilizing Sorting in Graphs (2007) (63)
- Broadcasting in unreliable radio networks (2010) (57)
- Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter (2015) (57)
- Minimum Maximum Degree Publish-Subscribe Overlay Network Design (2009) (56)
- Competitive and Fair Medium Access Despite Reactive Jamming (2011) (55)
- On the runtime of universal coating for programmable matter (2016) (52)
- On Balls and Bins with Deletions (1998) (51)
- Dynamic Coverage in Ad-Hoc Sensor Networks (2005) (51)
- An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems (2015) (50)
- Universal coating for programmable matter (2016) (49)
- Improved Leader Election for Self-organizing Programmable Matter (2017) (48)
- Randomized protocols for low-congestion circuit routing in multistage interconnection networks (1998) (47)
- New Approximation Techniques for Some Linear Ordering Problems (2005) (47)
- A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems (2016) (46)
- Optimal-stretch name-independent compact routing in doubling metrics (2006) (45)
- Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks (2002) (44)
- Constant density spanners for wireless ad-hoc networks (2005) (42)
- Optimal transmission power control in the presence of a smart jammer (2012) (42)
- An Efficient and Fair MAC Protocol Robust to Reactive Interference (2013) (41)
- Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance (2006) (39)
- Optimal scale-free compact routing schemes in networks of low doubling dimension (2007) (37)
- Competitive and fair throughput for co-existing networks under adversarial interference (2012) (37)
- Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design (2009) (35)
- Computing by Programmable Particles (2019) (35)
- Efficient broadcasting and gathering in wireless ad-hoc networks (2005) (32)
- A Tight Lower Bound for the Steiner Point Removal Problem on Trees (2006) (32)
- SKIP+: A Self-Stabilizing Skip Graph (2014) (32)
- Self-Stabilizing De Bruijn Networks (2011) (29)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming (2013) (27)
- Competitive MAC under adversarial SINR (2013) (26)
- Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks (2003) (26)
- A stochastic approach to shortcut bridging in programmable matter (2017) (24)
- A data tracking scheme for general networks (2001) (24)
- Compact routing with slack in low doubling dimension (2007) (24)
- Models, complexity and algorithms for the design of multifiber WDM networks (2003) (23)
- Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem (2015) (22)
- Phototactic supersmarticles (2017) (20)
- Convex Hull Formation for Programmable Matter (2018) (20)
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization (2010) (20)
- Minimum Maximum-Degree Publish-Subscribe Overlay Network Design (2011) (20)
- Programming active cohesive granular matter with mechanically induced phase changes (2020) (20)
- A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization (2014) (19)
- Self-stabilizing leader election for single-hop wireless networks despite jamming (2011) (19)
- Continuous-Time Collaborative Prefetching of Continuous Media (2008) (16)
- Dynamic routing and location services in metrics of low doubling dimension (2008) (15)
- Resource mapping and scheduling for heterogeneous network processor systems (2005) (15)
- Healthcare Supported by Data Mule Networks in Remote Communities of the Amazon Region (2014) (13)
- On the design of multifiber WDM networks (2001) (13)
- Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems (2018) (12)
- Sade: competitive MAC under adversarial SINR (2018) (12)
- Ad-hoc multi-hop underwater optical network for deep ocean monitoring (2013) (11)
- Infinite Object Coating in the Amoebot Model (2014) (11)
- Towards jamming-resistant and competitive medium access in the SINR model (2011) (10)
- The Canonical Amoebot Model: Algorithms and Concurrency Control (2021) (10)
- Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks (2009) (9)
- Ameba-inspired Self-organizing Particle Systems (2013) (9)
- MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast (2007) (8)
- Collaborative Computation in Self-Organizing Particle Systems (2017) (8)
- Principles of Robust Medium Access and an Application to Leader Election (2014) (8)
- Proceedings of the 2003 joint workshop on Foundations of mobile computing (2003) (8)
- Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271) (2017) (8)
- Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly (2019) (6)
- On shortest single/multiple path computation problems in Fiber-Wireless (FiWi) access networks (2014) (6)
- Automated synthesis of scalable algorithms for inferring non-local properties to assist in multi-robot teaming (2017) (6)
- A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media (2005) (6)
- A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling (2019) (6)
- Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (2010) (5)
- Jamming-Resistant MAC Protocols for Wireless Networks (2016) (5)
- Bio-Inspired Energy Distribution for Programmable Matter (2020) (5)
- Overlay Networks for Peer-to-Peer Networks (2007) (4)
- Modeling scalability in distributed self-stabilization: The case of graph linearization (2008) (4)
- Adaptive Packet Routing for Bursty Adversarial Traffic (1998) (4)
- Robust data mule networks with remote healthcare applications in the Amazon region: A fountain code approach (2015) (4)
- Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems (2021) (3)
- Leader Election with High Probability for Self-Organizing Programmable Matter (2017) (3)
- On Sampling in Higher-Dimensional Peer-to-Peer Systems (2006) (3)
- Editorial to the Special Issue on SODA'12 (2016) (3)
- Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities (2002) (2)
- Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization (2009) (2)
- Structural Information and Communication Complexity: 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings (2020) (2)
- Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271 (2017) (2)
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (2012) (2)
- Evaluation of Physical Carrier Sense Based Backbone Maintenance in Mobile Ad Hoc Networks (2009) (2)
- J ul 2 01 0 A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks ⋆ (2010) (1)
- Dynamic Coverage and Related Problems in Ad-hoc Sensor Networks (2014) (1)
- Multicast time maximization in energy constrained wireless networks (2007) (1)
- Interest- and Content-Based Data Dissemination in Mobile Social Networks (2017) (1)
- Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks (2020) (1)
- A stochastic approach to shortcut bridging in programmable matter (2018) (1)
- Application-oriented Self-organizing Hierarchical Clustering in Dynamic Networks [ Position Paper (2001) (1)
- Towards hybrid programmable matter : shape recognition, formation, and sealing algorithms for finite automaton robots (2018) (1)
- AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming (2010) (1)
- TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING (1999) (1)
- Session details: Session 4 (2016) (0)
- MONET Special Issue on Foundations of Mobile Computing (2006) (0)
- Randomized compact routing in decomposable metrics (2011) (0)
- Ameba-inspired Self-organizing Particle Systems (Extended Abstract) (2013) (0)
- Preliminary announcement and call for papers (1993) (0)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming (2012) (0)
- Self-Stabilizing DeBruijn Networks (2011) (0)
- Deadlock and Noise in Self-Organized Aggregation Without Computation (2021) (0)
- Collaborative prefetching frameworks of continuous media (2005) (0)
- Invited Paper: Asynchronous Deterministic Leader Election in Three-Dimensional Programmable Matter (2022) (0)
- A Smoothing Algorithm for the Dual Marching Tetrahedra Method (2011) (0)
- Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands (2020) (0)
- Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks (2023) (0)
- Mutual Embeddings (2015) (0)
- Proceedings of the 6th International Workshop on Foundations of Mobile Computing (2010) (0)
- A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization (2013) (0)
- On the runtime of universal coating for programmable matter (2017) (0)
- Session details: B3-1 (2009) (0)
- Stochastic Simulation Framework for a Data Mule Network in the Amazon Delta (2015) (0)
- Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems (2012) (0)
- J ul 2 01 3 Ameba-inspired Self-organizing Particle Systems ( Extended Abstract ) (2014) (0)
- An Investigation of Flow-based Algorithms for Sybil Defense. by Michael Bradley A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science Approved February 2018 by the Graduate Supervisory Committee: Rida Bazzi, Chair (2018) (0)
- Optimal Migration Contracts in Virtual Networks: Pay-as-You-Come vs Pay-as-You-Go Pricing (2013) (0)
- 2 16271 – Algorithmic Foundations of Programmable Matter 1 Executive Summary (2016) (0)
- Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Cambridge, Massachusetts, USA, September 16, 2010 (2010) (0)
- Proceedings of the Joint Workshop on Foundations of Mobile Computing: Foreword (2003) (0)
- Foraging in Particle Systems via Self-Induced Phase Changes (2022) (0)
- The Design and Analysis of Hash Families For Use in Broadcast Encryption (2012) (0)
- O-Hull Formation for Programmable Matter (2019) (0)
- Brief announcement: towards robust medium access in multi-hop networks (2010) (0)
- On Distributed Network Resource Allocation (1998) (0)
- Beyond the Packet Radio and Unit-Disk Models (2006) (0)
- 2018 Doctoral Dissertation Award (2018) (0)
- The superpowers of swarms (2019) (0)
- Phototactic supersmarticles (2018) (0)
- 2022 Edsger W. Dijkstra Prize in Distributed Computing (2022) (0)
- Sade: competitive MAC under adversarial SINR (2017) (0)
- Algorithms for two scheduling problems (1992) (0)
This paper list is powered by the following services:
Other Resources About Andréa W. Richa
What Schools Are Affiliated With Andréa W. Richa?
Andréa W. Richa is affiliated with the following schools:
