Items where Author is "Muralidhara, V. N."Group by: Item Type | No Grouping Number of items: 5. Sen, Sandeep ; Muralidhara, V. N. (2010) The covert set cover problem with application to network discovery Workshop on Algorithms and Computation - 2011 . pp. 228-239. Muralidhara, V. N. ; Sen, Sandeep (2009) Improvements on the Johnson bound for Reed-Solomon codes Discrete Applied Mathematics, 157 (4). pp. 812-818. ISSN 0166-218X Chadha, Jivitej S. ; Garg, Naveen ; Kumar, Amit ; Muralidhara, V. N. (2009) A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation In: STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing, 31 May 2009- 2 June 2009, Bethesda MD USA. Garg, Naveen ; Kumar, Amit ; Muralidhara, V. N. (2008) Minimizing Total Flow-Time: The Unrelated Case Lecture Notes in Computer Science, 5369 . pp. 424-435. ISSN 0302-9743 Muralidhara, V. N. ; Sen, Sandeep (2007) A result on the distribution of quadratic residues with applications to elliptic curve cryptography INDOCRYPT 2007, 8th International Conference on Cryptology in India . |

Up a level