Publications

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 
S
Varadan R, Walker O, Pickart C, Fushman D.  2002.  Structural Properties of Polyubiquitin Chains in Solution. Journal of Molecular Biology. 324(4):637-647.
Voytas DF, Konieczny A, Cummings MP, Ausubel FM.  1990.  The structure, distribution and evolution of the ıt Ta1 retrotransposable element family of ıt Arabidopsis thaliana. Genetics. 126(3):713-721.
Konieczny A, Voytas DF, Cummings MP, Ausubel FM.  1991.  A superfamily of ıt Arabidopsis thaliana retrotransposons. Genetics. 127(4):801-809.
Sahinalp SC, Vishkin U.  1994.  Symmetry breaking for suffix tree construction. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. :300-309.
Swaminathan A, Mao Y, Su G-M, Gou H, Varna AL, He S, M. Wu, Oard D.  2010.  System and Method for Confidentiality-Preserving Rank-Ordered Search. 12/608,724
Evans F, Skiena S, Varshney A.  2002.  System and method for entering text in a virtual environment. : 09/364,433(6407679)
Agrawala AK, Varshney A, Almazan CB.  2009.  System and Method for Spatio-Temporal-Context Aware Interaction of Users .... 12/267,921
Wen X, Vishkin U.  2009.  SYSTEM AND METHOD FOR THREAD HANDLING IN MULTITHREADED PARALLEL COMPUTING OF NESTED THREADS. 12/158,004
Van Horn D, Might M.  2011.  Systematic Abstraction of Abstract Machines. arXiv:1107.3539 [cs].
T
Torbert S, Vishkin U, Tzur R, Ellison DJ.  2010.  Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience Proceedings of the 41st ACM technical symposium on Computer science education. :290-294.
Vishkin U.  1995.  On a technique for parsing a string. Combinatorial Pattern Matching. :386-386.
Vishkin U.  1995.  On a Technique for Parsing a String (Invited Lecture). Lecture Notes in Computer Science. 937:386-386.
Olsen M, Traum D, Van Ess-Dykema C, Weinberg A, Dolan R.  2000.  Telicity as a cue to temporal and discourse structure in Chinese-English machine translation. :34-41.
Lathan C, Vice J M, Tracey M, Plaisant C, Druin A, Edward K, Montemayor J.  2001.  Therapeutic play with a storytelling robot. CHI '01 extended abstracts on Human factors in computing systems. :27-28.
Vishkin U.  2007.  Thinking in parallel: Some basic data-parallel algorithms and techniques. UMIACS, University of Maryland, College Park. 1993
Azar Y, Vishkin U.  1987.  Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
Alon N, Azar Y, Vishkin U.  1986.  Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.
Keceli F, Tzannes A, Caragea GC, Barua R, Vishkin U.  2011.  Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture. Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on. :1282-1291.
Berkman O, JaJa JF, Krishnamurthy S, Thurimella R, Vishkin U.  1994.  Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima. SIAM Journal on Computing. 23(3):449-465.
El-Sana J, Varshney A.  1998.  Topology simplification for polygonal virtual environments. Visualization and Computer Graphics, IEEE Transactions on. 4(2):133-144.
Voss C, Dorr BJ.  1995.  Toward a lexicalized grammar for interlinguas. Machine Translation. 10(1):143-184.
Vishkin U.  2008.  Toward Realizing a PRAM-on-a-Chip Vision. Lecture Notes in Computer Science. 4854:5-6.
Naishlos D, Nuzman J, Tseng CW, Vishkin U.  2003.  Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. Theory of Computing Systems. 36(5):521-552.
Gil J, Matias Y, Vishkin U.  1991.  Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.
Feamster N, Hassan U, Sundaresan S, Valancius V, Johari R, Vazirani V.  2009.  Towards an Internet Connectivity Market. GT-CS-09-01

Pages