default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrakash Ramanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c7]Prakash Ramanan:
Six Pass MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication. BeyondMR@SIGMOD 2018: 7:1-7:6- 2017
- [c6]Minhao Deng, Prakash Ramanan:
MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication. BeyondMR@SIGMOD 2017: 7:1-7:10 - 2016
- [c5]Prakash Ramanan, Ashita Nagar:
Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication. BeyondMR@SIGMOD 2016: 9 - 2012
- [j9]Prakash Ramanan:
Rewriting XPath queries using materialized XPath views. J. Comput. Syst. Sci. 78(4): 1006-1025 (2012) - 2011
- [j8]Prakash Ramanan:
Memory lower bounds for XPath evaluation over XML streams. J. Comput. Syst. Sci. 77(6): 1120-1140 (2011)
2000 – 2009
- 2009
- [j7]Prakash Ramanan:
Worst-case optimal algorithm for XPath evaluation over XML streams. J. Comput. Syst. Sci. 75(8): 465-485 (2009) - 2008
- [c4]Adriane Chapman, H. V. Jagadish, Prakash Ramanan:
Efficient provenance storage. SIGMOD Conference 2008: 993-1006 - 2007
- [j6]Prakash Ramanan:
Holistic Join for Generalized Tree Patterns. Inf. Syst. 32(7): 1018-1036 (2007) - 2005
- [c3]Prakash Ramanan:
Evaluating an XPath Query on a Streaming XML Document. COMAD (b) 2005 - 2003
- [c2]Prakash Ramanan:
Covering Indexes for XML Queries: Bisimulation - Simulation = Negation. VLDB 2003: 165-176 - 2002
- [c1]Prakash Ramanan:
Efficient algorithms for minimizing tree pattern queries. SIGMOD Conference 2002: 299-309 - 2001
- [j5]Prakash Ramanan:
Conditions for lossless join. Int. J. Comput. Math. 78(4): 489-498 (2001)
1990 – 1999
- 1997
- [j4]Prakash Ramanan:
Tight Ω(n lg n) lower bound for finding a longest increasing subsequence. Int. J. Comput. Math. 65(3-4): 161-164 (1997) - 1995
- [j3]Prakash Ramanan, Tsz Pang Ngan:
On lower bounds for constructing heaps. Int. J. Comput. Math. 56(3-4): 145-150 (1995) - 1991
- [j2]Yong-Mao Chen, Prakash Ramanan:
Euclidean shortest path in the presence of obstacles. Networks 21(3): 257-265 (1991) - 1990
- [j1]Alan Jackson, Prakash Ramanan:
An efficient algorithm for a special case of the set partition problem. Int. J. Comput. Math. 34(1-2): 1-8 (1990)
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 2024-04-25 05:51 CEST 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:
