Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
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 
V
Vishnoi A, Sethupathy P, Simola D, Plotkin JB, Hannenhalli S.  2011.  Genome-Wide Survey of Natural Selection on Functional, Structural, and Network Properties of Polymorphic Sites in Saccharomyces Paradoxus. Molecular Biology and EvolutionMol Biol Evol. 28(9):2615-2627.
Vishnoi A, Kryazhimskiy S, Bazykin GA, Hannenhalli S, Plotkin JB.  2010.  Young Proteins Experience More Variable Selection Pressures Than Old Proteins. Genome ResearchGenome Res.. 20(11):1574-1581.
Vishkin U.  2008.  An Immediate Concurrent Execution (ICE) Abstraction Proposal for Many-Cores. Computer Science Research Works.
Vishkin U.  2007.  Thinking in parallel: Some basic data-parallel algorithms and techniques. UMIACS, University of Maryland, College Park. 1993
Vishkin U.  2000.  PRAM-On-Chip Vision. String Processing and Information Retrieval, 2000. SPIRE 2000. Proceedings. Seventh International Symposium on. :260-260.
Vishkin U.  2011.  Using simple abstraction to reinvent computing for parallelism. Commun. ACM. 54(1):75-85.
Vishkin U.  1992.  Biconnectivity Approximations and Graph Carvings. Proceedings of the Twenty-fourth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, May 4-6, 1992. :759-759.
Vishkin U.  1998.  Project for Developing Computer Science Agenda(s) for High-Performance Computing: An Organizer's Summary. UMIACS-TR-94-129
Vishkin U, Wigderson A.  1983.  Dynamic parallel memories. Information and control. 56(3):174-182.
Vishkin U.  1985.  Optimal parallel pattern matching in strings. Information and Control. 67(1-3):91-113.
Vishkin RETU.  1984.  Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
Vishkin U.  2007.  Towards Realizing a PRAM-On-Chip Vision. Workshop on Highly Parallel Processing on a Chip (HPPC). 28
Vishkin U.  2000.  A no-busy-wait balanced tree parallel algorithmic paradigm. Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures. :147-155.
Vishkin U.  1992.  A parallel blocking flow algorithm for acyclic networks. Journal of Algorithms. 13(3):489-501.
Vishkin U.  1996.  Can parallel algorithms enhance serial implementation? Communications of the ACM. 39(9):88-91.
Vishkin U.  2009.  Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on? Computer Design, 2009. ICCD 2009. IEEE International Conference on. :60-63.
Vishkin U, Wigderson A.  1983.  Trade-offs between depth and width in parallel computation. Foundations of Computer Science, 1983., 24th Annual Symposium on. :146-153.
Vishkin U.  1993.  A case for the PRAM as a standard programmer's model. Parallel Architectures and their Efficient Use. :11-19.
Vishkin D, Vishkin U.  2000.  Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism. J. Exp. Algorithmics. 5
Vishkin U.  1985.  On efficient parallel strong orientation. Information Processing Letters. 20(5):235-240.
Vishkin U.  2009.  Optical interconnect structure in a computer system and method of transporting data between processing elements and memory through the optical interconnect structure. 10/529,310(7505822)
Vishkin U.  1984.  Randomized speed-ups in parallel computation. Proceedings of the sixteenth annual ACM symposium on Theory of computing. :230-239.
Vishkin U, Smolyaninov I, Davis C.  2007.  Plasmonics and the parallel programming problem. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 6477:19-19.
Vishkin U.  2003.  Prefix sums and an application thereof. : 09/224,104(6542918)
[Anonymous].  1994.  Developing a computer science agenda for high-performance computing.

Pages