The SCEAS System
| |||||||

## Search the dblp DataBase
Andréa W. Richa:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa
**A Tight Lower Bound for the Steiner Point Removal Problem on Trees.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:70-81 [Conf] - Hai Huang, Andréa W. Richa, Michael Segal
**Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks.**[Citation Graph (0, 0)][DBLP] DIAL-M, 2002, pp:52-61 [Conf] - Goran Konjevod, Soohyun Oh, Andréa W. Richa
**Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.**[Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:435-450 [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia
**On Sampling in Higher-Dimensional Peer-to-Peer Systems.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:641-652 [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia
**Optimal-stretch name-independent compact routing in doubling metrics.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:198-207 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] RANDOM, 1998, pp:145-158 [Conf] - Satish Rao, Andréa W. Richa
**New Approximation Techniques for Some Ordering Problems.**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:211-218 [Conf] - Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa
**Constant density spanners for wireless ad-hoc networks.**[Citation Graph (0, 0)][DBLP] SPAA, 2005, pp:116-125 [Conf] - Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri
**A data tracking scheme for general networks.**[Citation Graph (0, 0)][DBLP] SPAA, 2001, pp:247-254 [Conf] - C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
**Accessing Nearby Copies of Replicated Objects in a Distributed Environment.**[Citation Graph (0, 0)][DBLP] SPAA, 1997, pp:311-320 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:378-388 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:548-558 [Conf] - Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen, Andréa W. Richa
**Resource mapping and scheduling for heterogeneous network processor systems.**[Citation Graph (0, 0)][DBLP] ANCS, 2005, pp:19-28 [Conf] - Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa
**Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1999, v:19, n:3, pp:375-401 [Journal] - Hai Huang, Andréa W. Richa, Michael Segal
**Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks.**[Citation Graph (0, 0)][DBLP] MONET, 2004, v:9, n:2, pp:151-161 [Journal] - Hai Huang, Andréa W. Richa, Michael Segal
**Dynamic Coverage in Ad-Hoc Sensor Networks.**[Citation Graph (0, 0)][DBLP] MONET, 2005, v:10, n:1-2, pp:9-17 [Journal] - Andréa W. Richa, Jennifer L. Welch
**MONET Special Issue on Foundations of Mobile Computing.**[Citation Graph (0, 0)][DBLP] MONET, 2006, v:11, n:2, pp:119-120 [Journal] - C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
**Accessing Nearby Copies of Replicated Objects in a Distributed Environment.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1999, v:32, n:3, pp:241-280 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal] - Satish Rao, Andréa W. Richa
**New Approximation Techniques for Some Linear Ordering Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:34, n:2, pp:388-404 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Telecommunication Systems, 2003, v:24, n:2-4, pp:123-138 [Journal] - Luke Ritchie, Hyo-Sik Yang, Andréa W. Richa, Martin Reisslein
**Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Mob. Comput., 2006, v:5, n:6, pp:653-667 [Journal] - Melih Onus, Andréa Richa, Christian Scheideler
**Linearization: Locally Self-Stabilizing Sorting in Graphs.**[Citation Graph (0, 0)][DBLP] ALENEX, 2007, pp:- [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu
**Compact routing with slack in low doubling dimension.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:71-80 [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia
**Optimal scale-free compact routing schemes in networks of low doubling dimension.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:939-948 [Conf] **Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design.**[Citation Graph (, )][DBLP]**Minimum Maximum Degree Publish-Subscribe Overlay Network Design.**[Citation Graph (, )][DBLP]**Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.**[Citation Graph (, )][DBLP]**Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.**[Citation Graph (, )][DBLP]**An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model.**[Citation Graph (, )][DBLP]**A jamming-resistant MAC protocol for single-hop wireless networks.**[Citation Graph (, )][DBLP]**Dynamic routing and location services in metrics of low doubling dimension.**[Citation Graph (, )][DBLP]**A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.**[Citation Graph (, )][DBLP]**Brief announcement: towards robust medium access in multi-hop networks.**[Citation Graph (, )][DBLP]**Broadcasting in unreliable radio networks.**[Citation Graph (, )][DBLP]**Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design.**[Citation Graph (, )][DBLP]**Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.**[Citation Graph (, )][DBLP]**Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.**[Citation Graph (, )][DBLP]**A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.**[Citation Graph (, )][DBLP]**Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks.**[Citation Graph (, )][DBLP]**A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks**[Citation Graph (, )][DBLP]**AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |