Export 566 results:
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is V  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Xia JC, Varshney A.  1996.  Dynamic view-dependent simplification for polygonal models. Visualization '96. Proceedings.. :327-334.
Dickinson BC, Varadan R, Fushman D.  2007.  Effects of cyclization on conformational dynamics and binding properties of Lys48-linked di-ubiquitin. Protein Science. 16(3):369-378.
Wang Q, JaJa JF, Varshney A.  2007.  An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering. Journal of Parallel and Distributed Computing. 67(5):592-603.
Sahinalp SC, Vishkin U.  1996.  Efficient approximate and dynamic matching of patterns using a labeling paradigm. Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on. :320-328.
Ryabov YE, Geraghty C, Varshney A, Fushman D.  2006.  An Efficient Computational Method for Predicting Rotational Diffusion Tensors of Globular Proteins Using an Ellipsoid Representation. Journal of the American Chemical Society. 128(48):15432-15444.
Vishkin U.  1983.  Efficient distributed orientation algorithm.. IEEE TRANS. INFO. THEORY.. 29(4):624-628.
Perl Y, Vishkin U.  1985.  Efficient implementation of a shifting algorithm. Discrete applied mathematics. 12(1):71-80.
Landau GM, Vishkin U.  1986.  Efficient Parallel and Serial String Matching. Computer Science Department Technical Report. 221
Tarjan RE, Vishkin U.  1985.  An efficient parallel biconnectivity algorithm. SIAM Journal on Computing. 14:862-862.
Vishkin U.  1985.  On efficient parallel strong orientation. Information Processing Letters. 20(5):235-240.
Ramachandran V, Vishkin U.  1988.  Efficient parallel triconnectivity in logarithmic time. VLSI Algorithms and Architectures. :33-42.
Canetti R, Dachman-Soled D, Vaikuntanathan V, Wee H.  2012.  Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography – PKC 2012. :449-466.
Amir A, Landau GM, Vishkin U.  1992.  Efficient pattern matching with scaling. Journal of Algorithms. 13(1):2-32.
Dachman-Soled D, Malkin T, Raykova M, Yung M.  2009.  Efficient Robust Private Set Intersection. Applied Cryptography and Network Security. :125-142.
Hao X, Varshney A.  2004.  Efficient solution of poisson-boltzmann equation for electrostatics of large molecules. High-Performance Computing Symposium (April 2004). :71-76.
Landau GM, Vishkin U, Nussinov R.  1986.  An efficient string matching algorithm with k differences for nudeotide and amino acid sequences. Nucleic acids research. 14(1):31-31.
Landau GM, Vishkin U, Nussinov R.  1987.  An efficient string matching algorithm with K substitutions for nucleotide and amino acid sequences*. Journal of theoretical biology. 126(4):483-490.
Landau GM, Vishkin U.  1985.  Efficient string matching in the presence of errors. Foundations of Computer Science, 1985., 26th Annual Symposium on. :126-136.
Landau GM, Vishkin U.  1986.  Efficient string matching with k mismatches. Theoretical Computer Science. 43:239-249.
Lacroix Z, Raschid L, Vidal ME.  2004.  Efficient techniques to explore and rank paths in life science data sources. Data Integration in the Life Sciences. :187-202.
Evans F, Skiena S, Varshney A.  1997.  Efficient triangle strips for fast rendering. ACM Transactions on Graphics.
El-Sana J, Evans F, Kalaiah A, Varshney A, Skiena S, Azanli E.  2000.  Efficiently computing and updating triangle strips for real-time rendering. Computer Aided Design. 32(13):753-772.
Peckerar M, Sander D, Srivastava A, Foli A, Vishkin U.  2007.  Electron beam and optical proximity effect reduction for nanolithography: New results. Journal of Vacuum Science & Technology B. 25(6):2288-2294.
Karr A, Porter A, Votta L.  1996.  An empirical exploration of code evolution. International Workshop on Empirical Studies of Software Maintenance.
Perry DE, Porter A, Votta LG.  2000.  Empirical studies of software engineering: a roadmap. Proceedings of the conference on The future of Software engineering. :345-355.