Richa, Andrea Werneck - Department of Computer Science and Engineering, Arizona State University

• Optimal-Stretch Name-Independent Compact Routing in Doubling Metrics
• Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
• Minimum Maximum Degree Publish-Subscribe Overlay Network Design
• TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING ALGORITHMS BHASKAR GHOSH 1 F. T. LEIGHTON 2 BRUCE M. MAGGS 3;4
• Randomized Protocols for LowCongestion Circuit Routing in Multistage Interconnection Networks
• Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules
• Applicationoriented Selforganizing Hierarchical Clustering in Dynamic Networks
• Models, Complexity and Algorithms for the Design of Multifiber WDM Networks
• New Approximation Techniques for Some Ordering Problems Satish Rao Andr ea W. Richa y
• Optimal Scale-free Compact Routing Schemes in Networks of Low Doubling Dimension
• A Data Tracking Scheme for General Networks Rajmohan Rajaraman 1 Andr'ea W. Richa 2 Berthold Vocking 3 Gayathri Vuppuluri 4
• Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in
• Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks Melih Onus and Andrea Richa
• The Power of Two Random Choices: A Survey of Techniques and Results
• An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model
• A Modular Algorithm-Theoretic Framework for the Fair and Efficient Collaborative Prefetching
• On Balls and Bins with Deletions Richard Cole \Lambda Alan Frieze y Bruce M. Maggs z Michael Mitzenmacher x
• Dynamic Coverage in Ad-hoc Sensor Networks Andrea W. Richa,
• A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
• Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks
• Brief Announcement: Parameterized Maximum and Average Degree Approximation in Topic-based
• Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization
• A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks
• Linearization: Locally Self-Stabilizing Sorting in Graphs Andrea Richa
• A Tight Lower Bound for the Steiner Point Removal Problem on Trees
• On Sampling in Higher-Dimensional Peer-to-Peer Systems
• Constant Density Spanners for Wireless Ad-Hoc Networks Kishore Kothapalli Christian Scheideler
• Overlay Networks for Peer-to-Peer Networks Andrea W. Richa
• Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
• A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs
• Parameterized Maximum and Average Degree Approximation in Topic-based Publish-Subscribe
• Accessing Nearby Copies of Replicated Objects in a Distributed Environment
• Resource Mapping and Scheduling for Heterogeneous Network Processor Systems
• Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-hoc Networks
• New Approximation Techniques for Some Ordering Problems Satish Rao \Lambda Andr'ea W. Richa y
• Compact Routing with Slack in Low Doubling Dimension Goran Konjevod
• Randomized Compact Routing in Decomposable Metrics Goran Konjevod
• Self-stabilizing De Bruijn Networks Andrea Richa1
• Competitive and Fair Medium Access despite Reactive Jamming Andrea Richa
• Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming