23 citations · 47 across the 5 of their papers we have counts for
Showing 2000Show all
2 papers · 1 filter
quant-ph2000
The Quantum Complexity of Set Membership
Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh
We study the quantum complexity of the static set membership problem: given a subset S (|S| \leq n) of a universe of size m (m \gg n), store it as a table of bits so that queries o…
cond-mat.stat-mech2000
Analytical Studies of Strategies for Utilization of Cache Memory in Computers
Satya N. Majumdar, Jaikumar Radhakrishnan
We analyze quantitatively several strategies for better utilization of the {\em cache} or the {\em {fast access}} memory in computers. We define a performance factor that denot…