Prakash Ramanan

18 papers A* 1Journal 10Unranked 7
YearRankTypeTitle / Venue / Authors
2025 — conf
LAVA: Lifetime-Aware VM Allocation with Learned Distributions and Adaptation to Mispredictions.
MLSys
Jianheng Ling, Pratik Worah, Yawen Wang, Yunchuan Kong, Chunlei Wang, Clifford Stein, Diwakar Gupta, Jason Behmer, Logan A. Bush, Prakash Ramanan, Rajesh Kumar, Thomas Chestna, Yajing Liu, Ying Liu, Ye Zhao, Kathryn S. McKinley, Meeyoung Park, Martin Maas
2024 J jnl
LAVA: Lifetime-Aware VM Allocation with Learned Distributions and Adaptation to Mispredictions.
CoRR
Jianheng Ling, Pratik Worah, Yawen Wang, Yunchuan Kong, Chunlei Wang, Clifford Stein, Diwakar Gupta, Jason Behmer, Logan A. Bush, Prakash Ramanan, Rajesh Kumar, Thomas Chestna, Yajing Liu, Ying Liu, Ye Zhao, Kathryn S. McKinley, Meeyoung Park, Martin Maas
2018 — conf
Six Pass MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication.
BeyondMR@SIGMOD
Prakash Ramanan
2017 — conf
MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication.
BeyondMR@SIGMOD
Minhao Deng, Prakash Ramanan
2016 — conf
Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication.
BeyondMR@SIGMOD
Prakash Ramanan, Ashita Nagar
2012 J jnl
Rewriting XPath queries using materialized XPath views.
J. Comput. Syst. Sci.
Prakash Ramanan
2011 J jnl
Memory lower bounds for XPath evaluation over XML streams.
J. Comput. Syst. Sci.
Prakash Ramanan
2009 J jnl
Worst-case optimal algorithm for XPath evaluation over XML streams.
J. Comput. Syst. Sci.
Prakash Ramanan
2008 — conf
Efficient provenance storage.
SIGMOD Conference
Adriane Chapman, H. V. Jagadish, Prakash Ramanan
2007 J jnl
Holistic Join for Generalized Tree Patterns.
Inf. Syst.
Prakash Ramanan
2005 — conf
Evaluating an XPath Query on a Streaming XML Document.
COMAD (b)
Prakash Ramanan
2003 A* conf
Covering Indexes for XML Queries: Bisimulation - Simulation = Negation.
VLDB
Prakash Ramanan
2002 — conf
Efficient algorithms for minimizing tree pattern queries.
SIGMOD Conference
Prakash Ramanan
2001 J jnl
Conditions for lossless join.
Int. J. Comput. Math.
Prakash Ramanan
1997 J jnl
Tight Ω(
Int. J. Comput. Math.
Prakash Ramanan
1995 J jnl
On lower bounds for constructing heaps.
Int. J. Comput. Math.
Prakash Ramanan, Tsz Pang Ngan
1991 J jnl
Euclidean shortest path in the presence of obstacles.
Networks
Yong-Mao Chen, Prakash Ramanan
1990 J jnl
An efficient algorithm for a special case of the set partition problem.
Int. J. Comput. Math.
Alan Jackson, Prakash Ramanan