![]() | ![]() |
| 2012 | ||
|---|---|---|
| 82 | Michael Wahler, Ettore Ferranti, Robin Steiger, Rahul Jain, Kristian Nagy: CAST: Automating Software Tests for Embedded Systems. ICST 2012: 457-466 | |
| 81 | Hemant A. Patil, Maulik C. Madhavi, Rahul Jain, Alok K. Jain: Combining Evidence from Temporal and Spectral Features for Person Recognition Using Humming. PerMIn 2012: 321-328 | |
| 80 | Rahul Jain, Attila Pereszlényi, Penghui Yao: A direct product theorem for bounded-round public-coin randomized communication complexity CoRR abs/1201.1666: (2012) | |
| 79 | Rahul Jain, Penghui Yao: A parallel approximation algorithm for mixed packing and covering semidefinite programs CoRR abs/1201.6090: (2012) | |
| 78 | Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang: Correlation/Communication complexity of generating bipartite states CoRR abs/1203.1153: (2012) | |
| 77 | Srinivas Yerramalli, Rahul Jain, Urbashi Mitra: A Game Theoretic Model for the Gaussian Broadcast Channel CoRR abs/1203.3210: (2012) | |
| 76 | Rahul Jain, Ashwin Nayak: Short Proofs of the Quantum Substate Theorem. IEEE Transactions on Information Theory 58(6): 3664-3669 (2012) | |
| 75 | Rahul Jain: Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. J. Cryptology 25(1): 1-13 (2012) | |
| 2011 | ||
| 74 | Rahul Jain, Penghui Yao: A Parallel Approximation Algorithm for Positive Semidefinite Programming. FOCS 2011: 463-471 | |
| 73 | Srinivas Yerramalli, Rahul Jain, Urbashi Mitra: Coalition games for transmitter cooperation in wireless networks. ISIT 2011: 2706-2710 | |
| 72 | Rahul Jain, Shengyu Zhang: The influence lower bound via query elimination CoRR abs/1102.4699: (2011) | |
| 71 | Rahul Jain, Ashwin Nayak: A short proof of the Quantum Substate Theorem CoRR abs/1103.6067: (2011) | |
| 70 | Rahul Jain, Penghui Yao: A Parallel Approximation Algorithm for Positive Semidefinite Programming CoRR abs/1104.2502: (2011) | |
| 69 | Harsha Honnappa, Rahul Jain: Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game CoRR abs/1112.3052: (2011) | |
| 68 | Rahul Jain, Sandeep Juneja, Nahum Shimkin: The concert queueing game: to wait or to be late. Discrete Event Dynamic Systems 21(1): 103-138 (2011) | |
| 67 | Rahul Jain: New strong direct product results in communication complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 24 (2011) | |
| 66 | Rahul Jain, Shengyu Zhang: The influence lower bound via query elimination. Electronic Colloquium on Computational Complexity (ECCC) 18: 33 (2011) | |
| 65 | Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous: QIP = PSPACE. J. ACM 58(6): 30 (2011) | |
| 64 | Rahul Jain, Shengyu Zhang: The Influence Lower Bound Via Query Elimination. Theory of Computing 7(1): 147-153 (2011) | |
| 2010 | ||
| 63 | Vivek S. Borkar, Rahul Jain: Risk-constrained Markov decision processes. CDC 2010: 2664-2669 | |
| 62 | Rahul Jain, Hartmut Klauck, Shengyu Zhang: Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59 | |
| 61 | Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang: On the Power of a Unique Quantum Witness. ICS 2010: 470-481 | |
| 60 | Rahul Jain, Hartmut Klauck: The Partition Bound for Classical Communication Complexity and Query Complexity. IEEE Conference on Computational Complexity 2010: 247-258 | |
| 59 | Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous: QIP = PSPACE. STOC 2010: 573-582 | |
| 58 | Dileep M. Kalathil, Rahul Jain: A contracts-based approach for spectrum sharing among cognitive radios. WiOpt 2010: 91-97 | |
| 57 | Rahul Jain, Jean C. Walrand: An efficient Nash-implementation mechanism for network resource allocation. Automatica 46(8): 1276-1283 (2010) | |
| 56 | Rahul Jain, Pravin Varaiya: Simulation-based optimization of Markov decision processes: An empirical process theory approach. Automatica 46(8): 1297-1304 (2010) | |
| 55 | Rahul Jain, Hartmut Klauck, Miklos Santha: Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity CoRR abs/1004.0105: (2010) | |
| 54 | Rahul Jain, Ashwin Nayak: The space complexity of recognizing well-parenthesized expressions CoRR abs/1004.3165: (2010) | |
| 53 | Rahul Jain: Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity CoRR abs/1010.0522: (2010) | |
| 52 | Rahul Jain: A strong direct product theorem for two-way public coin communication complexity CoRR abs/1010.0846: (2010) | |
| 51 | Yi Gai, Bhaskar Krishnamachari, Rahul Jain: Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards CoRR abs/1011.4748: (2010) | |
| 50 | Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous: QIP = PSPACE. Commun. ACM 53(12): 102-109 (2010) | |
| 49 | Rahul Jain, Ashwin Nayak: The space complexity of recognizing well-parenthesized expressions. Electronic Colloquium on Computational Complexity (ECCC) 17: 71 (2010) | |
| 48 | Ankit Agrawal, Ankush Mittal, Rahul Jain, Raghav Takkar: Fuzzy-adaptive-thresholding-based exon prediction. I. J. Computational Biology and Drug Design 3(4): 311-333 (2010) | |
| 47 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. IEEE Transactions on Information Theory 56(1): 438-449 (2010) | |
| 46 | Rahul Jain, Hartmut Klauck, Miklos Santha: Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110(20): 893-897 (2010) | |
| 45 | Rahul Jain, Ashwin Nayak, Yi Su: A separation between divergence and Holevo information for ensembles. Mathematical Structures in Computer Science 20(5): 977-993 (2010) | |
| 2009 | ||
| 44 | Parijat Dube, Rahul Jain: Bertrand games between multi-class queues. CDC 2009: 8588-8593 | |
| 43 | Rahul Jain, Sarvagya Upadhyay, John Watrous: Two-Message Quantum Interactive Proofs Are in PSPACE. FOCS 2009: 534-543 | |
| 42 | Rahul Jain, John Watrous: Parallel Approximation of Non-interactive Zero-sum Quantum Games. IEEE Conference on Computational Complexity 2009: 243-253 | |
| 41 | Rahul Jain, Hartmut Klauck: New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. IEEE Conference on Computational Complexity 2009: 369-378 | |
| 40 | Rahul Jain, Hartmut Klauck: New Results in the Simultaneous Message Passing Model CoRR abs/0902.3056: (2009) | |
| 39 | Rahul Jain, Sarvagya Upadhyay, John Watrous: Two-message quantum interactive proofs are in PSPACE CoRR abs/0905.1300: (2009) | |
| 38 | Rahul Jain, Hartmut Klauck, Shengyu Zhang: Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas CoRR abs/0908.4453: (2009) | |
| 37 | Rahul Jain, Hartmut Klauck: The Partition Bound for Classical Communication Complexity and Query Complexity CoRR abs/0910.4266: (2009) | |
| 36 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6): (2009) | |
| 35 | Rahul Jain, Alexandra Kolla, Gatis Midrijanis, Ben W. Reichardt: On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Information & Computation 9(5): 513-532 (2009) | |
| 34 | Richard Cleve, Dmitry Gavinsky, Rahul Jain: Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Information & Computation 9(7): 648-656 (2009) | |
| 33 | Rahul Jain, Shengyu Zhang: New bounds on classical and quantum one-way communication complexity. Theor. Comput. Sci. 410(26): 2463-2477 (2009) | |
| 2008 | ||
| 32 | Ankit Agrawal, Ankush Mittal, Rahul Jain, Raghav Takkar: An adaptive fuzzy thresholding algorithm for exon prediction. EIT 2008: 211-214 | |
| 31 | Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608 | |
| 30 | Rahul Jain, Ashwin Nayak, Yi Su: A Separation between Divergence and Holevo Information for Ensembles. TAMC 2008: 526-541 | |
| 29 | Rahul Jain: Teleportation of Quantum States. Encyclopedia of Algorithms 2008 | |
| 28 | Rahul Jain, Shengyu Zhang: New bounds on classical and quantum one-way communication complexity CoRR abs/0802.4101: (2008) | |
| 27 | Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan: Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity CoRR abs/0807.1267: (2008) | |
| 26 | Rahul Jain: New Binding-Concealing Trade-Offs for Quantum String Commitment. J. Cryptology 21(4): 579-592 (2008) | |
| 2007 | ||
| 25 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The Communication Complexity of Correlation. IEEE Conference on Computational Complexity 2007: 10-23 | |
| 24 | Rahul Jain, Preeti Ranjan Panda: An Efficient Pipelined VLSI Architecture for Lifting-Based 2D-Discrete Wavelet Transform. ISCAS 2007: 1377-1380 | |
| 23 | Rahul Jain, Preeti Ranjan Panda: Memory Architecture Exploration for Power-Efficient 2D-Discrete Wavelet Transform. VLSI Design 2007: 813-818 | |
| 22 | Rahul Jain, B. R. Nagaraj: C(1, 1/3)-regularity in the Dirichlet problem for Deltainfinity. Computers & Mathematics with Applications 53(3-4): 377-394 (2007) | |
| 21 | Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electronic Colloquium on Computational Complexity (ECCC) 14(064): (2007) | |
| 2006 | ||
| 20 | Rahul Jain, Teunis J. Ott: Design and Implementation of Split TCP in the Linux Kernel. GLOBECOM 2006 | |
| 19 | Rahul Jain, Anindita Mukherjee, Kolin Paul: Defect-Aware Design Paradigm for Reconfigurable Architectures. ISVLSI 2006: 91-96 | |
| 18 | Rahul Jain: Towards a classical proof of exponential lower bound for 2-probe smooth codes CoRR abs/cs/0607042: (2006) | |
| 17 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. Electronic Colloquium on Computational Complexity (ECCC) 13(151): (2006) | |
| 16 | B. R. Nagaraj, Rahul Jain: Propagation and cancellation of singularities in a class of Fuchsian operators and their perturbations. Int. J. Math. Mathematical Sciences 2006: (2006) | |
| 15 | Rahul Jain: Communication complexity of remote state preparation with entanglement. Quantum Information & Computation 6(4): 461-464 (2006) | |
| 14 | Rahul Jain, Pravin Varaiya: Simulation-based Uniform Value Function Estimates of Markov Decision Processes. SIAM J. Control and Optimization 45(5): 1633-1656 (2006) | |
| 2005 | ||
| 13 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: Prior Entanglement, Message Compression and Privacy in Quantum Communication. IEEE Conference on Computational Complexity 2005: 285-296 | |
| 12 | Rahul Jain: Improved direct sum theorem in classical communication complexity CoRR abs/cs/0504087: (2005) | |
| 11 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan: Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005) | |
| 2004 | ||
| 10 | Rahul Jain, Sanjeev Kumar Aggarwal, Pankaj Jalote, Shiladitya Biswas: An interactive method for extracting grammar from programs. Softw., Pract. Exper. 34(5): 433-447 (2004) | |
| 2003 | ||
| 9 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229 | |
| 8 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315 | |
| 7 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A direct sum theorem in communication complexity via message compression CoRR cs.CC/0304020: (2003) | |
| 2002 | ||
| 6 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. FOCS 2002: 429-438 | |
| 5 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229 | |
| 4 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam: Better Lower Bounds for Locally Decodable Codes. IEEE Conference on Computational Complexity 2002: 184-193 | |
| 1999 | ||
| 3 | Rahul Jain, Edward W. Knightly: A Framework for Design & Evaluation of Admission Control Algorithms in Multi-Service Mobile Networks. INFOCOM 1999: 1027-1035 | |
| 2 | Rahul Jain, Bahareh Sadeghi, Edward W. Knightly: Towards Coarse-Grained Mobile QoS. WOWMOM 1999: 109-116 | |
| 1994 | ||
| 1 | Sudhakar M. Reddy, Irith Pomeranz, Rahul Jain: On Codeword Testing of Two-Rail and Parity TSC Checkers. FTCS 1994: 116-125 | |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page