dblp.uni-trier.dewww.uni-trier.de

Sairam Subramanian

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2005
13EESairam Subramanian, Ihor Lemischka, Ron Weiss: Engineering a 1: 2 Bio-multiplexer for controlled stem cell differentiation. CSB Workshops 2005: 262
1998
12EEPhilip N. Klein, Sairam Subramanian: A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica 22(3): 235-249 (1998)
1997
11 Philip N. Klein, Sairam Subramanian: A Randomized Parallel Algorithm for Single-Source Shortest Paths. J. Algorithms 25(2): 205-220 (1997)
10 Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian: Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55(1): 3-23 (1997)
1995
9 Sairam Subramanian, Sridhar Ramaswamy: The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. SODA 1995: 378-387
8 Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter: An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. Algorithmica 14(4): 322-339 (1995)
1994
7 Robert H. B. Netzer, Sairam Subramanian, Jian Xu: Critical-Path-Based Message Logging for incremental Replay of Message-Passing Programs. ICDCS 1994: 404-413
6EESridhar Ramaswamy, Sairam Subramanian: Path Caching: A Technique for Optimal External Searching. PODS 1994: 25-35
5EEPhilip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian: Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37
4 Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia: Complexity Models for Incremental Computation. Theor. Comput. Sci. 130(1): 203-236 (1994)
1993
3 Sairam Subramanian: A Fully Dynamic Data Structure for Reachability in Planar Digraphs. ESA 1993: 372-383
2 Philip N. Klein, Sairam Subramanian: A linear-processor polylog-time algorithm for shortest paths in planar graphs FOCS 1993: 259-270
1 Philip N. Klein, Sairam Subramanian: A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. WADS 1993: 442-451

Coauthor Index

1Monika Rauch Henzinger (Monika Rauch) [5] [10]
2Philip N. Klein [1] [2] [5] [10] [11] [12]
3Ihor Lemischka [13]
4Peter Bro Miltersen [4]
5Robert H. B. Netzer [7]
6Sridhar Ramaswamy [6] [9]
7Satish Rao [5] [10]
8Roberto Tamassia [4] [8]
9Jeffrey Scott Vitter [4] [8]
10Ron Weiss [13]
11Jian Xu [7]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)