2009 | ||
---|---|---|
38 | Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ramesh K. Sitaraman: Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks. IAT 2009: 363-370 | |
37 | Devesh Agrawal, Deepak Ganesan, Ramesh K. Sitaraman, Yanlei Diao, Shashi Singh: Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices. PVLDB 2(1): 361-372 (2009) | |
2008 | ||
36 | Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman: Corrections to "on the performance benefits of multihoming route control". IEEE/ACM Trans. Netw. 16(2): 496 (2008) | |
2006 | ||
35 | Ben Carterette, James Allan, Ramesh K. Sitaraman: Minimal test collections for retrieval evaluation. SIGIR 2006: 268-275 | |
2003 | ||
34 | Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman: A measurement-based analysis of multihoming. SIGCOMM 2003: 353-364 | |
33 | Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman: Designing overlay multicast networks for streaming. SPAA 2003: 149-158 | |
2002 | ||
32 | John Dilley, Bruce M. Maggs, Jay Parikh, Harald Prokop, Ramesh K. Sitaraman, William E. Weihl: Globally Distributed Content Delivery. IEEE Internet Computing 6(5): 50-58 (2002) | |
31 | Vijaya Ramachandran, Ramesh K. Sitaraman: SPAA 1999 - Guest Editors' Foreword. Theory Comput. Syst. 35(2): 97 (2002) | |
30 | Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002) | |
2001 | ||
29 | Micah Adler, Tian Bu, Ramesh K. Sitaraman, Donald F. Towsley: Tree Layout for Internal Network Characterizations in Multicast Networks. Networked Group Communication 2001: 189-204 | |
28 | William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. IEEE Trans. Parallel Distrib. Syst. 12(6): 598-609 (2001) | |
27 | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: On the Benefit of Supporting Virtual Channels in Wormhole Routers. J. Comput. Syst. Sci. 62(1): 152-177 (2001) | |
1999 | ||
26 | William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. SIROCCO 1999: 1-16 | |
25 | Suprakash Datta, Ramesh K. Sitaraman: Convergence and Concentration Results for packets Routing Networks. SIROCCO 1999: 78-92 | |
24 | Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. IEEE Trans. Parallel Distrib. Syst. 10(8): 813-824 (1999) | |
23 | Bruce M. Maggs, Ramesh K. Sitaraman: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues. SIAM J. Comput. 28(3): 984-1003 (1999) | |
1998 | ||
22 | Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar: On the Bisection Width and Expansion of Butterfly Networks. IPPS/SPDP 1998: 144-150 | |
21 | 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 | |
20 | Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278 | |
19 | 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 | |
18 | Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman: On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM J. Comput. 27(5): 1303-1333 (1998) | |
1997 | ||
17 | Suprakash Datta, Ramesh K. Sitaraman: The Performance of Simple Routing Algorithms That Drop Packets. SPAA 1997: 159-169 | |
16 | Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman: The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. IEEE Trans. Computers 46(10): 1119-1131 (1997) | |
15 | Richard J. Cole, Bruce M. Maggs, Ramesh K. Sitaraman: Reconfiguring Arrays with Faults Part I: Worst-Case Faults. SIAM J. Comput. 26(6): 1581-1611 (1997) | |
1996 | ||
14 | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: On the Benefit of Supporting Virtual Channels in Wormhole Routers. SPAA 1996: 131-141 | |
13 | Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996: 309-317 | |
12 | Christopher Rose, Ramesh K. Sitaraman: Editorial: Mobility Management. MONET 1(1): 1-2 (1996) | |
1995 | ||
11 | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: Routing on Butterfly Networks with Random Faults. FOCS 1995: 558-570 | |
10 | Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman: The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. Parallel Processing Letters 5: 37-48 (1995) | |
1993 | ||
9 | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: Multi-scale self-simulation: a technique for reconfiguring arrays with faults. STOC 1993: 561-572 | |
8 | Ramesh K. Sitaraman, Niraj K. Jha: Optimal Design of Checks for Error Detection and Location in Fault-Tolerant Multiprocessor Systems. IEEE Trans. Computers 42(7): 780-793 (1993) | |
1992 | ||
7 | Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman: On the Fault Tolerance of Some Popular Bounded-Degree Networks FOCS 1992: 542-552 | |
6 | Bruce M. Maggs, Ramesh K. Sitaraman: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract) STOC 1992: 150-161 | |
5 | William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning programs with an easy to calculate set of errors. Fundam. Inform. 16(3-4): 355-370 (1992) | |
1991 | ||
4 | Ramesh K. Sitaraman, Niraj K. Jha: Optimal Design of Checks for Error Detection and Location in Fault Tolerant Multiprocessors Systems. Fault-Tolerant Computing Systems 1991: 396-406 | |
1989 | ||
3 | William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning Programs With an Easy to Calculate Set of Errors. AII 1989: 124-137 | |
2 | Ramesh K. Sitaraman, Azriel Rosenfeld: Probabilistic analysis of two stage matching. Pattern Recognition 22(3): 331-343 (1989) | |
1988 | ||
1 | William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning Programs with an Easy to Calculate Set of Errors. COLT 1988: 242-250 |