| 1998 |
12 | | Ramesh Subramonian:
Defining diff as a Data Mining Primitive.
KDD 1998: 334-338 |
| 1997 |
11 | | Ramesh Subramonian,
Ramana Venkata,
Joyce Chen:
A Visual Interactive Framework for Attribute Discretization.
KDD 1997: 82-88 |
| 1996 |
10 | | David E. Culler,
Richard M. Karp,
David A. Patterson,
Abhijit Sahay,
Eunice E. Santos,
Klaus E. Schauser,
Ramesh Subramonian,
Thorsten von Eicken:
LogP: A Practical Model of Parallel Computation.
Commun. ACM 39(11): 78-85 (1996) |
| 1994 |
9 | | Charles U. Martel,
Ramesh Subramonian:
On the Complexity of Certified Write-All Algorithms.
J. Algorithms 16(3): 361-387 (1994) |
| 1993 |
8 | | David E. Culler,
Richard M. Karp,
David A. Patterson,
Abhijit Sahay,
Klaus E. Schauser,
Eunice E. Santos,
Ramesh Subramonian,
Thorsten von Eicken:
LogP: Towards a Realistic Model of Parallel Computation.
PPOPP 1993: 1-12 |
7 | | Ramesh Subramonian,
Narayan Venkatasubramanyan:
Efficient Multiple-Item Broadcase in the LogP Model.
Parallel Processing Letters 3: 407-417 (1993) |
| 1992 |
6 | | Charles U. Martel,
Ramesh Subramonian:
On the Complexity of Certified Write All Algorithms.
FSTTCS 1992: 368-379 |
5 | | Ramesh Subramonian:
Writing Sequential Programs for Parallel Processors: Implementation Experience.
ICCI 1992: 159-163 |
4 | | Ramesh Subramonian:
Designing Synchronous Algorithms for Asynchronous Processors.
SPAA 1992: 189-198 |
3 | | Charles U. Martel,
Arvin Park,
Ramesh Subramonian:
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers.
SIAM J. Comput. 21(6): 1070-1099 (1992) |
| 1990 |
2 | | Charles U. Martel,
Ramesh Subramonian,
Arvin Park:
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs
FOCS 1990: 590-599 |
1 | | Charles U. Martel,
Ramesh Subramonian:
Asynchronous PRAM Algorithms for List Ranking and Transitive Closure.
ICPP (3) 1990: 60-63 |