CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Kalyanaraman-S"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2009 | 2008 | 2007 | 2006
Number of items: 7.

2009

Kalyanaraman, Shankar and Umans, Christopher (2009) The Complexity of Rationalizing Network Formation. Electronic Colloquium on Computational Complexity, 2009 . Art. No. 145. ISSN 1433-8092. https://resolver.caltech.edu/CaltechAUTHORS:20191127-082201341

Kalyanaraman, Shankar and Umans, Christopher (2009) The Complexity of Rationalizing Network Formation. In: 50th Annual IEEE Symposium on Foundations of Computer Science, 2009. Annual IEEE Symposium on Foundations of Computer Science. IEEE , pp. 485-494. ISBN 978-1-4244-5116-6. https://resolver.caltech.edu/CaltechAUTHORS:20100707-095613286

2008

Kalyanaraman, Shankar and Umans, Christopher (2008) The Complexity of Rationalizing Matchings. In: Algorithms and Computation. Lecture Notes in Computer Science. No.5369. Springer , Berlin, pp. 171-182. ISBN 978-3-540-92181-3. https://resolver.caltech.edu/CaltechAUTHORS:20191126-155702845

Kalyanaraman, Shankar and Umans, Christopher (2008) The Complexity of Rationalizing Matchings. Electronic Colloquium on Computational Complexity . Art. No. 21. ISSN 1433-8092. https://resolver.caltech.edu/CaltechAUTHORS:20191127-084809601

2007

Kalyanaraman, Shankar and Umans, Christopher (2007) Algorithms for Playing Games with Limited Randomness. In: Algorithms – ESA 2007. Lecture Notes in Computer Science. No.4698. Springer Berlin Heidelberg , Berlin, Heidelberg, pp. 323-334. ISBN 9783540755197. https://resolver.caltech.edu/CaltechAUTHORS:20190828-102317126

2006

Kalyanaraman, Shankar and Umans, Christopher (2006) On Obtaining Pseudorandomness from Error-Correcting Codes. In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. No.4337. Springer , Berlin, Heidelberg, pp. 105-116. ISBN 9783540499947. https://resolver.caltech.edu/CaltechAUTHORS:20190828-102318013

Kalyanaraman, Shankar and Umans, Christopher (2006) On obtaining pseudorandomness from error-correcting codes. Electronic Colloquium on Computational Complexity, 2006 . TR06-128. ISSN 1433-8092. https://resolver.caltech.edu/CaltechAUTHORS:20190829-152850467

This list was generated on Fri Aug 14 04:50:52 2020 PDT.