default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamesh Subramonian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c12]Ramesh Subramonian:
Graph Processing on an "almost" Relational Database. GRADES 2014: 1:1-1:8- 2013
- [c11]Ramesh Subramonian, Kishore Gopalakrishna, Kapil Surlaker, Bob Schulman, Mihir Gandhi, Sajid Topiwala, David Zhang, Zhen Zhang:
In data veritas: data driven testing for distributed systems. DBTest 2013: 4:1-4:6 - 2012
- [c10]Kishore Gopalakrishna, Shi Lu, Zhen Zhang, Adam Silberstein, Kapil Surlaker, Ramesh Subramonian, Bob Schulman:
Untangling cluster management with Helix. SoCC 2012: 19
1990 – 1999
- 1998
- [c9]Ramesh Subramonian:
Defining diff as a Data Mining Primitive. KDD 1998: 334-338 - 1997
- [c8]Ramesh Subramonian, Ramana Venkata, Joyce Chen:
A Visual Interactive Framework for Attribute Discretization. KDD 1997: 82-88 - 1996
- [j4]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
- [j3]Charles U. Martel, Ramesh Subramonian:
On the Complexity of Certified Write-All Algorithms. J. Algorithms 16(3): 361-387 (1994) - 1993
- [j2]Ramesh Subramonian, Narayan Venkatasubramanyan:
Efficient Multiple-Item Broadcase in the LogP Model. Parallel Process. Lett. 3: 407-417 (1993) - [c7]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 - 1992
- [j1]Charles U. Martel, Arvin Park, Ramesh Subramonian:
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM J. Comput. 21(6): 1070-1099 (1992) - [c6]Charles U. Martel, Ramesh Subramonian:
On the Complexity of Certified Write All Algorithms. FSTTCS 1992: 368-379 - [c5]Ramesh Subramonian:
Writing Sequential Programs for Parallel Processors: Implementation Experience. ICCI 1992: 159-163 - [c4]Ramesh Subramonian:
Designing Synchronous Algorithms for Asynchronous Processors. SPAA 1992: 189-198 - 1991
- [c3]Martin Lee Brady, Kenneth K. Jung, H. T. Nguyen, Raghu Raghavan, Ramesh Subramonian:
The Assignment Problem on Parallel Architectures. Network Flows And Matching 1991: 469-517 - 1990
- [c2]Charles U. Martel, Ramesh Subramonian, Arvin Park:
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs. FOCS 1990: 590-599 - [c1]Charles U. Martel, Ramesh Subramonian:
Asynchronous PRAM Algorithms for List Ranking and Transitive Closure. ICPP (3) 1990: 60-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
