| 2012 | ||
|---|---|---|
| c20 | Abhishek Gupta, Pulkit Grover, Cédric Langbort, Tamer Basar: On myopic strategies in dynamic adversarial team decision problems. CISS 2012: 1-6 | |
| c19 | Karthik Ganesan, Yang Wen, Pulkit Grover, Andrea Goldsmith, Jan M. Rabaey: Choosing "green" codes by simulation-based modeling of implementations. GLOBECOM 2012: 3286-3292 | |
| c18 | Pulkit Grover, Andrea Goldsmith, Anant Sahai: Fundamental limits on the power consumption of encoding and decoding. ISIT 2012: 2716-2720 | |
| c17 | Lav R. Varshney, Pulkit Grover, Anant Sahai: Securing inductively-coupled communication. ITA 2012: 47-53 | |
| 2011 | ||
| j2 | Pulkit Grover, Kristen Ann Woyach, Anant Sahai: Towards a Communication-Theoretic Understanding of System-Level Power Consumption. IEEE Journal on Selected Areas in Communications 29(8): 1744-1755 (2011) | |
| c16 | ||
| c15 | Pulkit Grover, Anant Sahai: Fundamental bounds on the interconnect complexity of decoder implementations. CISS 2011: 1-6 | |
| c14 | Kristen Ann Woyach, Pulkit Grover, Anant Sahai: Near vs. Far Field: Interference Aggregation in TV Whitespaces. GLOBECOM 2011: 1-5 | |
| c13 | ||
| c12 | Pulkit Grover, Anant Sahai, Karthik Ganesan, Jan M. Rabaey: "Green codes with short wires at the decoder: Fundamental limits and constructions". ITA 2011: 112-115 | |
| c11 | Karthik Ganesan, Pulkit Grover, Jan M. Rabaey: The power cost of over-designing codes. SiPS 2011: 128-133 | |
| 2010 | ||
| c10 | ||
| c9 | Pulkit Grover, Anant Sahai: Distributed signal cancelation inspired by Witsenhausen's counterexample. ISIT 2010: 151-155 | |
| c8 | Pulkit Grover, Anant Sahai: Shannon meets Tesla: Wireless information and power transfer. ISIT 2010: 2363-2367 | |
| c7 | Pulkit Grover, Hari Palaiyanur, Anant Sahai: Information-theoretic tradeoffs of throughput and chip power consumption for decoding error-correcting codes. ISIT 2010: 2373-2377 | |
| i9 | Pulkit Grover, Se Yong Park, Anant Sahai: The finite-dimensional Witsenhausen counterexample. CoRR abs/1003.0514 (2010) | |
| i8 | Pulkit Grover, Aaron B. Wagner, Anant Sahai: Information embedding meets distributed control. CoRR abs/1003.0520 (2010) | |
| i7 | Pulkit Grover, Anant Sahai: Is Witsenhausen's counterexample a relevant toy? CoRR abs/1009.2528 (2010) | |
| i6 | Pulkit Grover, Anant Sahai: Implicit and explicit communication in decentralized control. CoRR abs/1010.4854 (2010) | |
| i5 | Pulkit Grover, Kristen Ann Woyach, Anant Sahai: Towards a communication-theoretic understanding of system-level power consumption. CoRR abs/1010.4855 (2010) | |
| 2009 | ||
| c6 | Se Yong Park, Pulkit Grover, Anant Sahai: A constant-factor approximately optimal solution to the Witsenhausen counterexample. CDC 2009: 2881-2886 | |
| c5 | ||
| c4 | Pulkit Grover, Anant Sahai, Se Yong Park: The finite-dimensional Witsenhausen counterexample. WiOpt 2009: 1-10 | |
| 2008 | ||
| c3 | Pulkit Grover, Anant Sahai: A vector version of witsenhausen's counterexample: A convergence of control, communication and computation. CDC 2008: 1636-1641 | |
| c2 | Pulkit Grover, Anant Sahai: Green codes: Energy-efficient short-range communication. ISIT 2008: 1178-1182 | |
| i4 | Anant Sahai, Pulkit Grover: The price of certainty: "waterslide curves" and the gap to capacity. CoRR abs/0801.0352 (2008) | |
| i3 | Pulkit Grover, Anant Sahai: Green Codes: Energy-Efficient Short-Range Communication. CoRR abs/0805.2423 (2008) | |
| 2007 | ||
| j1 | Pulkit Grover, Ajit Kumar Chaturvedi: Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels. IEEE Transactions on Information Theory 53(2): 794-804 (2007) | |
| i2 | Pulkit Grover, Anant Sahai: What is needed to exploit knowledge of primary transmissions? CoRR abs/cs/0702071 (2007) | |
| i1 | Pulkit Grover: Tradeoff between decoding complexity and rate for codes on graphs. CoRR abs/cs/0702073 (2007) | |
| 2004 | ||
| c1 | Pulkit Grover, Rajiv Agarwal, Ajit Kumar Chaturvedi: Geolocation using transmit and receive diversity. GLOBECOM 2004: 3681-3684 | |
Colors in the list of coauthors
Last update Sat May 25 19:53:54 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page