The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Rahul Jain" ( http://dblp.L3S.de/Authors/Rahul_Jain )

  Author page on DBLP  Author page in RDF  Community of Rahul Jain in ASPL-2

Publication years (Num. hits)
1994-2006 (20) 2007-2009 (24) 2010 (19) 2011-2012 (18)
Publication types (Num. hits)
article(50) incollection(1) inproceedings(30)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 14 keywords

Results
Found 81 publication records. Showing 81 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Rahul Jain Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. Search on Bibsonomy J. Cryptology The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Srinivas Yerramalli, Rahul Jain, Urbashi Mitra A Game Theoretic Model for the Gaussian Broadcast Channel Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Rahul Jain, Penghui Yao A parallel approximation algorithm for mixed packing and covering semidefinite programs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang Correlation/Communication complexity of generating bipartite states Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Rahul Jain, Attila Pereszlényi, Penghui Yao A direct product theorem for bounded-round public-coin randomized communication complexity Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Rahul Jain, Ashwin Nayak Short Proofs of the Quantum Substate Theorem. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hemant A. Patil, Maulik C. Madhavi, Rahul Jain, Alok K. Jain Combining Evidence from Temporal and Spectral Features for Person Recognition Using Humming. Search on Bibsonomy PerMIn The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rahul Jain New strong direct product results in communication complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Rahul Jain, Shengyu Zhang The influence lower bound via query elimination. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Rahul Jain, Shengyu Zhang The Influence Lower Bound Via Query Elimination. Search on Bibsonomy Theory of Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous QIP = PSPACE. Search on Bibsonomy J. ACM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Shengyu Zhang The influence lower bound via query elimination Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Harsha Honnappa, Rahul Jain Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Rahul Jain, Penghui Yao A Parallel Approximation Algorithm for Positive Semidefinite Programming Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Rahul Jain, Ashwin Nayak A short proof of the Quantum Substate Theorem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Rahul Jain, Sandeep Juneja, Nahum Shimkin The concert queueing game: to wait or to be late. Search on Bibsonomy Discrete Event Dynamic Systems The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Srinivas Yerramalli, Rahul Jain, Urbashi Mitra Coalition games for transmitter cooperation in wireless networks. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Penghui Yao A Parallel Approximation Algorithm for Positive Semidefinite Programming. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Hartmut Klauck, Miklos Santha Optimal direct sum results for deterministic and randomized decision tree complexity. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ankit Agrawal, Ankush Mittal, Rahul Jain, Raghav Takkar Fuzzy-adaptive-thresholding-based exon prediction. Search on Bibsonomy I. J. Computational Biology and Drug Design The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Ashwin Nayak The space complexity of recognizing well-parenthesized expressions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Rahul Jain, Pravin Varaiya Simulation-based optimization of Markov decision processes: An empirical process theory approach. Search on Bibsonomy Automatica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jean C. Walrand An efficient Nash-implementation mechanism for network resource allocation. Search on Bibsonomy Automatica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Ashwin Nayak, Yi Su A separation between divergence and Holevo information for ensembles. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous QIP = PSPACE. Search on Bibsonomy Commun. ACM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Hartmut Klauck, Miklos Santha Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Rahul Jain, Ashwin Nayak The space complexity of recognizing well-parenthesized expressions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Rahul Jain Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Yi Gai, Bhaskar Krishnamachari, Rahul Jain Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Rahul Jain A strong direct product theorem for two-way public coin communication complexity Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan The communication complexity of correlation. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dileep M. Kalathil, Rahul Jain A contracts-based approach for spectrum sharing among cognitive radios. Search on Bibsonomy WiOpt The full citation details ... 2010 DBLP  BibTeX  RDF
1Vivek S. Borkar, Rahul Jain Risk-constrained Markov decision processes. Search on Bibsonomy CDC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Hartmut Klauck, Shengyu Zhang Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. Search on Bibsonomy COCOON The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang On the Power of a Unique Quantum Witness. Search on Bibsonomy ICS The full citation details ... 2010 DBLP  BibTeX  RDF
1Rahul Jain, Hartmut Klauck The Partition Bound for Classical Communication Complexity and Query Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Partition Bound, Lower Bounds, Linear Programming, Communication Complexity, Query Complexity
1Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous QIP = PSPACE. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF matrix multiplicative weights update method, quantum interactive proof systems, quantum computation, semidefinite programming
1Rahul Jain, Shengyu Zhang New bounds on classical and quantum one-way communication complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A property of quantum relative entropy with an application to privacy in quantum communication. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF quantum communication complexity, Privacy, quantum information theory
1Richard Cleve, Dmitry Gavinsky, Rahul Jain Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2009 DBLP  BibTeX  RDF
1Rahul Jain, Alexandra Kolla, Gatis Midrijanis, Ben W. Reichardt On parallel composition of zero-knowledge proofs with black-box quantum simulators. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2009 DBLP  BibTeX  RDF
1Rahul Jain, Sarvagya Upadhyay, John Watrous Two-message quantum interactive proofs are in PSPACE Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Rahul Jain, Hartmut Klauck, Shengyu Zhang Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Rahul Jain, Hartmut Klauck New Results in the Simultaneous Message Passing Model Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Rahul Jain, Hartmut Klauck The Partition Bound for Classical Communication Complexity and Query Complexity Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Parijat Dube, Rahul Jain Bertrand games between multi-class queues. Search on Bibsonomy CDC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Sarvagya Upadhyay, John Watrous Two-Message Quantum Interactive Proofs Are in PSPACE. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Quantum interactive proof systems, matrix multiplicative weights update method, quantum complexity
1Rahul Jain, Hartmut Klauck New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rahul Jain, John Watrous Parallel Approximation of Non-interactive Zero-sum Quantum Games. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rahul Jain New Binding-Concealing Trade-Offs for Quantum String Commitment. Search on Bibsonomy J. Cryptology The full citation details ... 2008 DBLP  DOI  BibTeX  RDF String commitment, Quantum channels, Observational divergence, Substate theorem, Relative entropy
1Rahul Jain, Shengyu Zhang New bounds on classical and quantum one-way communication complexity Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Rahul Jain Teleportation of Quantum States. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Ashwin Nayak, Yi Su A Separation between Divergence and Holevo Information for Ensembles. Search on Bibsonomy TAMC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ankit Agrawal, Ankush Mittal, Rahul Jain, Raghav Takkar An adaptive fuzzy thresholding algorithm for exon prediction. Search on Bibsonomy EIT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Hartmut Klauck, Ashwin Nayak Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product
1Rahul Jain, Hartmut Klauck, Ashwin Nayak Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Rahul Jain, B. R. Nagaraj C(1, 1/3)-regularity in the Dirichlet problem for Deltainfinity. Search on Bibsonomy Computers & Mathematics with Applications The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Preeti Ranjan Panda Memory Architecture Exploration for Power-Efficient 2D-Discrete Wavelet Transform. Search on Bibsonomy VLSI Design The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Preeti Ranjan Panda An Efficient Pipelined VLSI Architecture for Lifting-Based 2D-Discrete Wavelet Transform. Search on Bibsonomy ISCAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan The Communication Complexity of Correlation. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan The communication complexity of correlation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Rahul Jain, Pravin Varaiya Simulation-based Uniform Value Function Estimates of Markov Decision Processes. Search on Bibsonomy SIAM J. Control and Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rahul Jain Communication complexity of remote state preparation with entanglement. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2006 DBLP  BibTeX  RDF
1Rahul Jain Towards a classical proof of exponential lower bound for 2-probe smooth codes Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1B. R. Nagaraj, Rahul Jain Propagation and cancellation of singularities in a class of Fuchsian operators and their perturbations. Search on Bibsonomy Int. J. Math. Mathematical Sciences The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Anindita Mukherjee, Kolin Paul Defect-Aware Design Paradigm for Reconfigurable Architectures. Search on Bibsonomy ISVLSI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Teunis J. Ott Design and Implementation of Split TCP in the Linux Kernel. Search on Bibsonomy GLOBECOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan Lower bounds for adaptive locally decodable codes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rahul Jain Improved direct sum theorem in classical communication complexity Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen Prior Entanglement, Message Compression and Privacy in Quantum Communication. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Sanjeev Kumar Aggarwal, Pankaj Jalote, Shiladitya Biswas An interactive method for extracting grammar from programs. Search on Bibsonomy Softw., Pract. Exper. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A direct sum theorem in communication complexity via message compression Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A Direct Sum Theorem in Communication Complexity via Message Compression. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam Better Lower Bounds for Locally Decodable Codes. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Second Moment Method, Probabilistically Checkable Proof Systems, Error Correcting Codes, Pseudorandom Generators, Private Information Retrieval
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. Search on Bibsonomy FSTTCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Edward W. Knightly A Framework for Design & Evaluation of Admission Control Algorithms in Multi-Service Mobile Networks. Search on Bibsonomy INFOCOM The full citation details ... 1999 DBLP  BibTeX  RDF
1Rahul Jain, Bahareh Sadeghi, Edward W. Knightly Towards Coarse-Grained Mobile QoS. Search on Bibsonomy WOWMOM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Sudhakar M. Reddy, Irith Pomeranz, Rahul Jain On Codeword Testing of Two-Rail and Parity TSC Checkers. Search on Bibsonomy FTCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #81 of 81 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.