The SCEAS System
| |||||||

## Search the dblp DataBase
Srinivasan Parthasarathy 0002:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:146-157 [Conf] - Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Dependent Rounding in Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:323-332 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Approximation Algorithms for Scheduling on Multiple Machines.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:254-263 [Conf] - Srinivasan Parthasarathy 0002, Rajiv Gandhi
**Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:447-459 [Conf] - V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
**Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.**[Citation Graph (0, 0)][DBLP] IPDPS, 2005, pp:- [Conf] - Rajiv Gandhi, Srinivasan Parthasarathy 0002, Arunesh Mishra
**Minimizing broadcast latency and redundancy in ad hoc networks.**[Citation Graph (0, 0)][DBLP] MobiHoc, 2003, pp:222-232 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Algorithmic aspects of capacity in wireless networks.**[Citation Graph (0, 0)][DBLP] SIGMETRICS, 2005, pp:133-144 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**End-to-end packet-scheduling in wireless ad-hoc networks.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1021-1030 [Conf] - Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Dependent rounding and its applications to approximation algorithms.**[Citation Graph (0, 0)][DBLP] J. ACM, 2006, v:53, n:3, pp:324-360 [Journal] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan, Sibylle Zust
**Provable algorithms for parallel generalized sweep scheduling.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2006, v:66, n:6, pp:807-821 [Journal] - Zhen Liu, Srinivasan Parthasarthy, Anand Ranganathan, Hao Yang
**Scalable event matching for overlapping subscriptions in pub/sub systems.**[Citation Graph (0, 0)][DBLP] DEBS, 2007, pp:250-261 [Conf] - Rajiv Gandhi, Srinivasan Parthasarathy 0002
**Distributed algorithms for connected domination in wireless networks.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2007, v:67, n:7, pp:848-862 [Journal] **Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.**[Citation Graph (, )][DBLP]**Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.**[Citation Graph (, )][DBLP]**Association Control in Mobile Wireless Networks.**[Citation Graph (, )][DBLP]**Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks.**[Citation Graph (, )][DBLP]**Cross-layer latency minimization in wireless networks with SINR constraints.**[Citation Graph (, )][DBLP]**A generic flow algorithm for shared filter ordering problems.**[Citation Graph (, )][DBLP]**Near-optimal algorithms for shared filter evaluation in data stream systems.**[Citation Graph (, )][DBLP]**Power Efficient Throughput Maximization in Multi-Hop Wireless Networks.**[Citation Graph (, )][DBLP]**Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs | |||||||

| |||||||

| |||||||

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