Searching for authors named Arvind – sorted by Relevance.
-
Reductions to Sets of Low Information Content
- in Complexity Theory Conference, pages 220-229. IEEE Computer Society Press, June/July 1991. V. Arvind, J
- Cited by 23 (5 self) – Add To MetaCart
-
ACKNOWLEDGEMENTS
- CODE AND RECEIVER DESIGN FOR THE NON-COHERENT FAST FADING CHANNEL by Arvind Krishnamoorthy A
- Add To MetaCart
-
1 Introduction Broadcast Channels
- 1 Introduction Broadcast Channels Arvind Sridharan The broadcast situation as the name suggests
- Add To MetaCart
-
1.1. Code Size vs Performance Problem................... 11
- Microarchitecture and Compiler Techniques for Dual Width ISA processors by Arvind Krishnaswamy A
- Add To MetaCart
-
Virtual Networks:Architecture and Design Issues
- Institute of Technology, Kanpur By: Arvind Sarraf, 97070 2 TABLE OF CONTENTS PAGE NUMBER 3 8 17 20 28 31
- Add To MetaCart
-
Obfuscated databases and group privacy
- Obfuscated Databases and Group Privacy Arvind Narayanan and Vitaly ShmatikovThe University
- Cited by 8 (2 self) – Add To MetaCart
-
Compiler Analyses and System Support for Optimizationing Shared Address Space Programs
- Compiler Analyses and System Support for Optimizing Shared Address Space Programs by Arvind
- Cited by 4 (1 self) – Add To MetaCart
-
Optimizing explicitly parallel programs
- Optimizing Explicitly Parallel Programs Arvind Krishnamurthy Report No. UCB/CSD-94-835 September
- Cited by 2 (1 self) – Add To MetaCart
-
Range of Validity of the D-Brane - Black Hole Correspondence
- Correspondence Arvind Rajaraman , Stanford Linear Accelerator Center, Stanford University, Stanford
- Cited by 1 (0 self) – Add To MetaCart
-
Graph Isomorphism is Low for ZPP(NP) and other Lowness results
- Graph Isomorphism is Low for ZPP(NP) and other Lowness results V. Arvind 1 and J. Kobler 2 1
- Cited by 6 (0 self) – Add To MetaCart

