Items where Author is "Radhakrishnan, Jaikumar"

Article

Dutta, Chinmoy ; Radhakrishnan, Jaikumar (2012) More on a problem of Zarankiewicz Arxiv-eprints . pp. 1-14.

Busch, Costas ; Dutta, Chinmoy ; Radhakrishnan, Jaikumar ; Rajaraman, Rajmohan ; Srinivasagopalan, Srivathsan (2011) Split and join: strong partitions and Universal Steiner trees for graphs Arxiv-eprints . pp. 1-23.

Radhakrishnan, Jaikumar ; Shannigrahi, Saswata (2011) Streaming algorithms for 2-coloring uniform hypergraphs Lecture Notes in Computer Science, 6844 . pp. 667-678. ISSN 0302-9743

Babu, Ajesh ; Limaye, Nutan ; Radhakrishnan, Jaikumar ; Varma, Girish (2011) Streaming algorithms for language recognition problems Arxiv-eprints . pp. 1-21.

Ajesh Babu, S. ; Radhakrishnan, Jaikumar (2010) An entropy based proof of the Moore bound for irregular graphs Arxiv-eprints . pp. 1-6.

Radhakrishnan, Jaikumar ; Shah, Smit ; Shannigrahi, Saswata (2010) Data structures for storing small sets in the bitprobe model Lecture Notes in Computer Science, 6347 . pp. 159-170. ISSN 0302-9743

Emek, Yuval ; Halldorsson, Magnus M. ; Mansour, Yishay ; Patt-Shamir, Boaz ; Radhakrishnan, Jaikumar ; Rawitz, Dror (2010) Online set packing and competitive scheduling of multi-part tasks PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing . No pp. given.

Radhakrishnan, Jaikumar ; Rötteler, Martin ; Sen, Pranab (2009) Random measurement bases, quantum state distinction and applications to the hidden subgroup problem Algorithmica, 55 (3). pp. 490-516. ISSN 0178-4617

Halldòrsson, Magnüs M. ; Kortsarz, Guy ; Radhakrishnan, Jaikumar ; Sivasubramanian, Sivaramakrishnan (2007) Complete partitions of graphs Combinatorica, 27 (5). pp. 519-550. ISSN 0209-9683

Miltersen, Peter Bro ; Radhakrishnan, Jaikumar ; Wegener, Ingo (2005) On converting CNF to DNF Theoretical Computer Science, 347 (1-2). pp. 325-335. ISSN 0304-3975

Dubhashi, Devdatt ; Mei, Alessandro ; Panconesi, Alessandro ; Radhakrishnan, Jaikumar ; Srinivasan, Aravind (2005) Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons Journal of Computer and System Sciences, 71 (4). pp. 467-479. ISSN 0022-0000

Deshpande, Amit ; Jain, Rahul ; Kavitha, T. ; Lokam, Satyanarayana V. ; Radhakrishnan, Jaikumar (2005) Lower bounds for adaptive locally decodable codes Random Structures & Algorithms, 27 (3). pp. 358-378. ISSN 1042-9832

Linial, Nathan ; Radhakrishnan, Jaikumar (2005) Essential covers of the cube by hyperplanes Journal of Combinatorial Theory, Series A, 109 (2). pp. 331-338. ISSN 0097-3165

Chakraborty, Sourav ; Radhakrishnan, Jaikumar ; Raghunathan, Nandakumar (2005) Bounds for error reduction with few quantum queries Lecture Notes in Computer Science, 3624 . pp. 245-256. ISSN 0302-9743

Grover, Lov K. ; Radhakrishnan, Jaikumar (2005) Is partial quantum search of a database any easier Arxiv-eprints . pp. 1-15.

Radhakrishnan, Jaikumar ; Rötteler, Martin ; Sen, Pranab (2005) On the power of random bases in Fourier sampling: hidden subgroup problem in the Heisenberg group Lecture Notes in Computer Science, 3580 . pp. 1399-1411. ISSN 0302-9743

Pietro, Roberto Di ; Mancini, Luigi V. ; Mei, Alessandro ; Panconesi, Alessandro ; Radhakrishnan, Jaikumar (2004) Connectivity properties of secure wireless sensor networks SASN '04 Proceedings of the 2nd ACM workshop on Security of Ad hoc and Sensor Networks . pp. 53-58.

Panconesi, Alessandro ; Radhakrishnan, Jaikumar (2004) Expansion properties of (secure) wireless networks SPAA '04 Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures . No pp. given.

Radhakrishnan, Jaikumar (2003) A note on scrambling permutations Random Structures & Algorithms, 22 (4). pp. 435-439. ISSN 1042-9832

Jain, Rahul ; Radhakrishnan, Jaikumar ; Sen, Pranab (2003) A direct sum theorem in communication complexity via message compression Lecture Notes in Computer Science, 2719 . pp. 300-315. ISSN 0302-9743

Mishra, S. ; Radhakrishnan, Jaikumar ; Sivasubramanian, S. (2002) On the hardness of approximating minimum monopoly problems Lecture Notes in Computer Science, 2556 . pp. 277-288. ISSN 0302-9743

Jain, Rahul ; Radhakrishnan, Jaikumar ; Sen, Pranab (2002) The quantum communication complexity of the pointer chasing problem: the bit version Lecture Notes in Computer Science, 2556 . pp. 218-229. ISSN 0302-9743

Radhakrishnan, Jaikumar ; Raman, Venkatesh (2001) A tradeoff between search and update in dictionaries Information Processing Letters, 80 (5). pp. 243-247. ISSN 0020-0190

Ponzio, Stephen J. ; Radhakrishnan, Jaikumar ; Venkatesh, S. (2001) The communication complexity of pointer chasing Journal of Computer and System Sciences, 62 (2). pp. 323-355. ISSN 0022-0000

Radhakrishnan, Jaikumar ; Raman, Venkatesh ; Srinivasa Rao, S. (2001) Explicit deterministic constructions for membership in the bitprobe model Lecture Notes in Computer Science, 2161 . pp. 290-299. ISSN 0302-9743

Radhakrishnan, Jaikumar ; Srinivasan, Aravind (2000) Improved bounds and algorithms for hypergraph 2-coloring Random Structures & Algorithms, 16 (1). pp. 4-32. ISSN 1042-9832

Radhakrishnan, Jaikumar ; Ta-Shma, Amnon (2000) Bounds for dispersers, extractors, and depth-two superconcentrators SIAM Journal on Discrete Mathematics, 13 (1). pp. 2-4. ISSN 0895-4801

Radhakrishnan, Jaikumar ; Sen, Pranab ; Vishwanathan, Sundar (2000) Depth-3 arithmetic circuits for S_n²(X) and extensions of the Graham-Pollack theorem Lecture Notes in Computer Science, 1974 . pp. 176-187. ISSN 0302-9743

Mukund, Madhavan ; Narayan Kumar, K. ; Radhakrishnan, Jaikumar ; Sohoni, Milind (1998) Robust asynchronous protocols are finite-state Lecture Notes in Computer Science, 1443 . pp. 188-199. ISSN 0302-9743

Mukund, Madhavan ; Narayan Kumar, K. ; Radhakrishnan, Jaikumar ; Sohoni, Milind (1998) Towards a characterisation of finite-state message-passing systems Lecture Notes in Computer Science, 1538 . pp. 282-299. ISSN 0302-9743

Chaudhuri, Shiva P. ; Radhakrishnan, Jaikumar (1997) The complexity of parallel prefix problems on small domains Information and Computation, 138 (1). pp. 1-22. ISSN 0890-5401

Radhakrishnan, Jaikumar (1997) Better lower bounds for monotone threshold formulas Journal of Computer and System Sciences, 54 (2). pp. 221-226. ISSN 0022-0000

Radhakrishnan, Jaikumar (1997) An entropy proof of Bregman's theorem Journal of Combinatorial Theory, Series A, 77 (1). pp. 161-164. ISSN 0097-3165

Chaudhuri, Shiva ; Radhakrishnan, Jaikumar (1996) Deterministic restrictions in circuit complexity STOC '96 Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing . No pp. given.

Brodal, Gerth Stølting ; Chaudhuri, Shiva ; Radhakrishnan, Jaikumar (1996) The randomized complexity of maintaining the minimum Lecture Notes in Computer Science, 1097 . pp. 4-15. ISSN 0302-9743

Nishino, Tetsuro ; Radhakrishnan, Jaikumar (1995) On the number of negations needed to compute parity functions IEICE - Transactions on Info and Systems, E78-D (1). pp. 90-91. ISSN 0916-8532

Radhakrishnan, Jaikumar ; Subrahmanyam, K. V. (1994) Directed monotone contact networks for threshold functions Information Processing Letters, 50 (4). pp. 199-203. ISSN 0020-0190

Halldórsson, Magnús M. ; Radhakrishnan, Jaikumar (1994) Improved approximations of independent sets in bounded-degree graphs Lecture Notes in Computer Science, 824 . pp. 195-206. ISSN 0302-9743

Halldórsson, Magnús M. ; Radhakrishnan, Jaikumar ; Subrahmanyam, K. V. (1993) On some communication complexity problems related to threshold functions Lecture Notes in Computer Science, 761 . pp. 248-259. ISSN 0302-9743

Radhakrishnan, Jaikumar (1992) Improved bounds for covering complete uniform hypergraphs Information Processing Letters, 41 (4). pp. 203-207. ISSN 0020-0190