| 2009 | ||
|---|---|---|
| 34 | Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. PODC 2009: 131-140 | |
| 33 | Melih Onus, Andréa W. Richa: Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. SPAA 2009: 39-40 | |
| 32 | Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. SSS 2009: 781-782 | |
| 31 | Luke Ritchie, Sapna Deval, Martin Reisslein, Andréa W. Richa: Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks. Ad Hoc Networks 7(7): 1347-1369 (2009) | |
| 2008 | ||
| 30 | Goran Konjevod, Andréa W. Richa, Donglin Xia: Dynamic Routing and Location Services in Metrics of Low Doubling Dimension. DISC 2008: 379-393 | |
| 29 | Christian Scheideler, Andréa W. Richa, Paolo Santi: An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. MobiHoc 2008: 91-100 | |
| 28 | Goran Konjevod, Andréa W. Richa, Donglin Xia: Dynamic routing and location services in metrics of low doubling dimension. PODC 2008: 417 | |
| 27 | Baruch Awerbuch, Andréa W. Richa, Christian Scheideler: A jamming-resistant MAC protocol for single-hop wireless networks. PODC 2008: 45-54 | |
| 2007 | ||
| 26 | Melih Onus, Andréa W. Richa, Christian Scheideler: Linearization: Locally Self-Stabilizing Sorting in Graphs. ALENEX 2007 | |
| 25 | Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu: Compact routing with slack in low doubling dimension. PODC 2007: 71-80 | |
| 24 | Goran Konjevod, Andréa W. Richa, Donglin Xia: Optimal scale-free compact routing schemes in networks of low doubling dimension. SODA 2007: 939-948 | |
| 2006 | ||
| 23 | Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa: A Tight Lower Bound for the Steiner Point Removal Problem on Trees. APPROX-RANDOM 2006: 70-81 | |
| 22 | Goran Konjevod, Andréa W. Richa, Donglin Xia: On Sampling in Higher-Dimensional Peer-to-Peer Systems. LATIN 2006: 641-652 | |
| 21 | Goran Konjevod, Andréa W. Richa, Donglin Xia: Optimal-stretch name-independent compact routing in doubling metrics. PODC 2006: 198-207 | |
| 20 | Luke Ritchie, Hyo-Sik Yang, Andréa W. Richa, Martin Reisslein: Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance. IEEE Trans. Mob. Comput. 5(6): 653-667 (2006) | |
| 19 | Andréa W. Richa, Jennifer L. Welch: MONET Special Issue on Foundations of Mobile Computing. MONET 11(2): 119-120 (2006) | |
| 2005 | ||
| 18 | Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen, Andréa W. Richa: Resource mapping and scheduling for heterogeneous network processor systems. ANCS 2005: 19-28 | |
| 17 | Melih Onus, Andréa W. Richa, Kishore Kothapalli, Christian Scheideler: Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. ISPAN 2005: 346-351 | |
| 16 | Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa: Constant density spanners for wireless ad-hoc networks. SPAA 2005: 116-125 | |
| 15 | Hai Huang, Andréa W. Richa, Michael Segal: Dynamic Coverage in Ad-Hoc Sensor Networks. MONET 10(1-2): 9-17 (2005) | |
| 2004 | ||
| 14 | Hai Huang, Andréa W. Richa, Michael Segal: Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks. MONET 9(2): 151-161 (2004) | |
| 13 | Satish Rao, Andréa W. Richa: New Approximation Techniques for Some Linear Ordering Problems. SIAM J. Comput. 34(2): 388-404 (2004) | |
| 2003 | ||
| 12 | Afonso Ferreira, Stephane Perennes, Hervé Rivano, Andréa W. Richa, Nicolás E. Stier Moses: Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommunication Systems 24(2-4): 123-138 (2003) | |
| 2002 | ||
| 11 | Hai Huang, Andréa W. Richa, Michael Segal: Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. DIAL-M 2002: 52-61 | |
| 10 | Goran Konjevod, Soohyun Oh, Andréa W. Richa: Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. LATIN 2002: 435-450 | |
| 2001 | ||
| 9 | Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri: A data tracking scheme for general networks. SPAA 2001: 247-254 | |
| 1999 | ||
| 8 | Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa: Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Combinatorica 19(3): 375-401 (1999) | |
| 7 | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman: Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29(1): 29-64 (1999) | |
| 6 | C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory Comput. Syst. 32(3): 241-280 (1999) | |
| 1998 | ||
| 5 | Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal: On Balls and Bins with Deletions. RANDOM 1998: 145-158 | |
| 4 | Satish Rao, Andréa W. Richa: New Approximation Techniques for Some Ordering Problems. SODA 1998: 211-218 | |
| 3 | Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388 | |
| 1997 | ||
| 2 | C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997: 311-320 | |
| 1995 | ||
| 1 | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman: Tight analyses of two local load balancing algorithms. STOC 1995: 548-558 | |