Andréa W. Richa

According to our database1, Andréa W. Richa authored at least 91 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Computing by Programmable Particles.
Proceedings of the Distributed Computing by Mobile Entities, 2019

A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly.
Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019

A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.
Proceedings of the Approximation, 2019

2018
On the runtime of universal coating for programmable matter.
Natural Computing, 2018

A stochastic approach to shortcut bridging in programmable matter.
Natural Computing, 2018

Sade: competitive MAC under adversarial SINR.
Distributed Computing, 2018

Convex Hull Formation for Programmable Matter.
CoRR, 2018

Collaborative Computation in Self-organizing Particle Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2018 Doctoral Dissertation Award.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Overlay Networks for Peer-to-Peer Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Universal coating for programmable matter.
Theor. Comput. Sci., 2017

Phototactic Supersmarticles.
CoRR, 2017

Leader Election with High Probability for Self-Organizing Programmable Matter.
CoRR, 2017

Interest- and Content-Based Data Dissemination in Mobile Social Networks.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Automated synthesis of scalable algorithms for inferring non-local properties to assist in multi-robot teaming.
Proceedings of the 13th IEEE Conference on Automation Science and Engineering, 2017

Improved Leader Election for Self-organizing Programmable Matter.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Jamming-Resistant MAC Protocols for Wireless Networks.
Encyclopedia of Algorithms, 2016

Editorial to the Special Issue on SODA'12.
ACM Trans. Algorithms, 2016

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension.
ACM Trans. Algorithms, 2016

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271).
Dagstuhl Reports, 2016

Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design.
Comput. Networks, 2016

Universal Shape Formation for Programmable Matter.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

On the Runtime of Universal Coating for Programmable Matter.
Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

2015
Mutual Embeddings.
Journal of Interconnection Networks, 2015

Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.
Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, 2015

Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

Robust data mule networks with remote healthcare applications in the Amazon region: A fountain code approach.
Proceedings of the 17th International Conference on E-health Networking, 2015

Leader Election and Shape Formation with Self-organizing Programmable Matter.
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014
Principles of Robust Medium Access and an Application to Leader Election.
ACM Trans. Algorithms, 2014

A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory Comput. Syst., 2014

SKIP+: A Self-Stabilizing Skip Graph.
J. ACM, 2014

Infinite Object Coating in the Amoebot Model.
CoRR, 2014

Brief announcement: amoebot - a new model for programmable matter.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Competitive MAC under adversarial SINR.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

On shortest single/multiple path computation problems in Fiber-Wireless (FiWi) access networks.
Proceedings of the IEEE 15th International Conference on High Performance Switching and Routing, 2014

2013
Coping with a Smart Jammer in Wireless Networks: A Stackelberg Game Approach.
IEEE Trans. Wireless Communications, 2013

An Efficient and Fair MAC Protocol Robust to Reactive Interference.
IEEE/ACM Trans. Netw., 2013

Competitive throughput in multi-hop wireless networks despite adaptive jamming.
Distributed Computing, 2013

Ameba-inspired Self-organizing Particle Systems.
CoRR, 2013

Optimal Migration Contracts in Virtual Networks: Pay-as-You-Come vs Pay-as-You-Go Pricing.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Competitive and fair throughput for co-existing networks under adversarial interference.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Optimal transmission power control in the presence of a smart jammer.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011
Minimum Maximum-Degree Publish-Subscribe Overlay Network Design.
IEEE/ACM Trans. Netw., 2011

Self-Stabilizing De Bruijn Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Randomized compact routing in decomposable metrics.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Self-stabilizing leader election for single-hop wireless networks despite jamming.
Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2011

Towards jamming-resistant and competitive medium access in the SINR model.
Proceedings of the 3rd ACM workshop on Wireless of the students, 2011

Competitive and Fair Medium Access Despite Reactive Jamming.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

2010
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
CoRR, 2010

A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: towards robust medium access in multi-hop networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Broadcasting in unreliable radio networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks.
Ad Hoc Networks, 2009

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.
Proceedings of the Stabilization, 2009

Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Continuous-Time Collaborative Prefetching of Continuous Media.
TBC, 2008

Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

A jamming-resistant MAC protocol for single-hop wireless networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model.
Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

2007
Overlay Networks for Peer-to-Peer Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast.
Wireless Personal Communications, 2007

Optimal scale-free compact routing schemes in networks of low doubling dimension.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compact routing with slack in low doubling dimension.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Linearization: Locally Self-Stabilizing Sorting in Graphs.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance.
IEEE Trans. Mob. Comput., 2006

MONET Special Issue on Foundations of Mobile Computing.
MONET, 2006

Optimal-stretch name-independent compact routing in doubling metrics.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On Sampling in Higher-Dimensional Peer-to-Peer Systems.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

A Tight Lower Bound for the Steiner Point Removal Problem on Trees.
Proceedings of the Approximation, 2006

2005
A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media.
TBC, 2005

Dynamic Coverage in Ad-Hoc Sensor Networks.
MONET, 2005

Constant density spanners for wireless ad-hoc networks.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Resource mapping and scheduling for heterogeneous network processor systems.
Proceedings of the 2005 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, 2005

2004
New Approximation Techniques for Some Linear Ordering Problems.
SIAM J. Comput., 2004

Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks.
MONET, 2004

2003
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks.
Telecommunication Systems, 2003

2002
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
A data tracking scheme for general networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

1999
Tight Analyses of Two Local Load Balancing Algorithms.
SIAM J. Comput., 1999

Accessing Nearby Copies of Replicated Objects in a Distributed Environment.
Theory Comput. Syst., 1999

Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules.
Combinatorica, 1999

1998
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

New Approximation Techniques for Some Ordering Problems.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

On Balls and Bins with Deletions.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998


  Loading...