|
Search the dblp DataBase
Rahul Jain:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
Better Lower Bounds for Locally Decodable Codes. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:184-193 [Conf]
- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Prior Entanglement, Message Compression and Privacy in Quantum Communication. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:285-296 [Conf]
- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:429-438 [Conf]
- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:220-229 [Conf]
- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. [Citation Graph (0, 0)][DBLP] FSTTCS, 2002, pp:218-229 [Conf]
- Sudhakar M. Reddy, Irith Pomeranz, Rahul Jain
On Codeword Testing of Two-Rail and Parity TSC Checkers. [Citation Graph (0, 0)][DBLP] FTCS, 1994, pp:116-125 [Conf]
- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A Direct Sum Theorem in Communication Complexity via Message Compression. [Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:300-315 [Conf]
- Rahul Jain, Edward W. Knightly
A Framework for Design & Evaluation of Admission Control Algorithms in Multi-Service Mobile Networks. [Citation Graph (0, 0)][DBLP] INFOCOM, 1999, pp:1027-1035 [Conf]
- Rahul Jain, Anindita Mukherjee, Kolin Paul
Defect-Aware Design Paradigm for Reconfigurable Architectures. [Citation Graph (0, 0)][DBLP] ISVLSI, 2006, pp:91-96 [Conf]
- Rahul Jain, Preeti Ranjan Panda
Memory Architecture Exploration for Power-Efficient 2D-Discrete Wavelet Transform. [Citation Graph (0, 0)][DBLP] VLSI Design, 2007, pp:813-818 [Conf]
- Rahul Jain, Bahareh Sadeghi, Edward W. Knightly
Towards Coarse-Grained Mobile QoS. [Citation Graph (0, 0)][DBLP] WOWMOM, 1999, pp:109-116 [Conf]
- Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A direct sum theorem in communication complexity via message compression [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
Lower bounds for adaptive locally decodable codes. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:27, n:3, pp:358-378 [Journal]
- Rahul Jain, Sanjeev Kumar Aggarwal, Pankaj Jalote, Shiladitya Biswas
An interactive method for extracting grammar from programs. [Citation Graph (0, 0)][DBLP] Softw., Pract. Exper., 2004, v:34, n:5, pp:433-447 [Journal]
- Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
The Communication Complexity of Correlation. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:10-23 [Conf]
- Rahul Jain, Preeti Ranjan Panda
An Efficient Pipelined VLSI Architecture for Lifting-Based 2D-Discrete Wavelet Transform. [Citation Graph (0, 0)][DBLP] ISCAS, 2007, pp:1377-1380 [Conf]
- Rahul Jain, Teunis J. Ott
Design and Implementation of Split TCP in the Linux Kernel. [Citation Graph (0, 0)][DBLP] GLOBECOM, 2006, pp:- [Conf]
- Rahul Jain
Improved direct sum theorem in classical communication complexity [Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal]
- Rahul Jain
Towards a classical proof of exponential lower bound for 2-probe smooth codes [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Parallel Approximation of Non-interactive Zero-sum Quantum Games. [Citation Graph (, )][DBLP]
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. [Citation Graph (, )][DBLP]
The Partition Bound for Classical Communication Complexity and Query Complexity. [Citation Graph (, )][DBLP]
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. [Citation Graph (, )][DBLP]
Two-Message Quantum Interactive Proofs Are in PSPACE. [Citation Graph (, )][DBLP]
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. [Citation Graph (, )][DBLP]
QIP = PSPACE. [Citation Graph (, )][DBLP]
A Separation between Divergence and Holevo Information for Ensembles. [Citation Graph (, )][DBLP]
A contracts-based approach for spectrum sharing among cognitive radios. [Citation Graph (, )][DBLP]
Bertrand games between multi-class queues. [Citation Graph (, )][DBLP]
An adaptive fuzzy thresholding algorithm for exon prediction. [Citation Graph (, )][DBLP]
On the Power of a Unique Quantum Witness. [Citation Graph (, )][DBLP]
New bounds on classical and quantum one-way communication complexity [Citation Graph (, )][DBLP]
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity [Citation Graph (, )][DBLP]
New Results in the Simultaneous Message Passing Model [Citation Graph (, )][DBLP]
Two-message quantum interactive proofs are in PSPACE [Citation Graph (, )][DBLP]
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas [Citation Graph (, )][DBLP]
The Partition Bound for Classical Communication Complexity and Query Complexity [Citation Graph (, )][DBLP]
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity [Citation Graph (, )][DBLP]
The space complexity of recognizing well-parenthesized expressions [Citation Graph (, )][DBLP]
Direct Product Theorems for Communication Complexity via Subdistribution Bounds. [Citation Graph (, )][DBLP]
The communication complexity of correlation. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.306secs
|