Publications

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. 1984. An optimal parallel connectivity algorithm* 1. Discrete applied mathematics. 9(2):197-207.

Vishkin U, Caragea GC, Lee B. 2007. Models for advancing PRAM and other algorithms into parallel programs for a PRAM-On-Chip platform. IN HANDBOOK OF PARALLEL COMPUTING: MODELS, ALGORITHMS AND APPLICATIONS, EDITORS.

Vishkin U. 1987. Randomized parallel speedups for list ranking* 1. Journal of Parallel and Distributed Computing. 4(3):319-333.

Vishkin U. 1983. Efficient distributed orientation algorithm.. IEEE TRANS. INFO. THEORY.. 29(4):624-628.

Vishkin U, Caragea GC, Lee B. 2006. Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform. Technical Reports from UMIACS, UMIACS-UMIACS-TR-2006-21.

Vishkin U, Smolyaninov I. 2004. Bending light for multi-chip virtual PRAMs? Proc. 3rd Workshop on Non-Slicon Computation, held in conjunction with the 31st International Symposium on Computer Architecture (ISCA 2004). :19-23.

Vishkin U. 1997. From algorithm parallelism to instruction-level parallelism: An encode-decode chain using prefix-sum. Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures. :260-271.

Vishkin U. 1991. Structural parallel algorithmics. Automata, Languages and Programming. :363-380.

Vishkin U. 1992. Methods in parallel algorithmics and who may need to know them? Algorithms and Computation. :1-4.

Vishkin U. 2004. OPTICAL INTERCONNECT STRUCTURE IN A COMPUTER SYSTEM. (WO/2004/083904)

Vishkin U. 2002. Two techniques for reconciling algorithm parallelism with memory constraints. Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. :95-98.

Vishkin U. 1995. On a technique for parsing a string. Combinatorial Pattern Matching. :386-386.

Vishkin U. 1990. Deterministic sampling—a new technique for fast pattern matching. Proceedings of the twenty-second annual ACM symposium on Theory of computing. :170-180.

Vishkin U. 1984. A parallel-design distributed-implementation (PDDI) general-purpose computer. Theoretical Computer Science. 32(1-2):157-172.

Vishkin U. 1987. An optimal parallel algorithm for selection. Parallel and Distributed Computing. 4:79-86.

Vishkin U. 1983. Implementation of simultaneous memory address access in models that forbid it. Journal of algorithms. 4(1):45-50.

Vishkin U, Dascal S, Berkovich E, Nuzman J. 1998. Explicit Multi-Threading (XMT) bridging models for instruction parallelism (extended abstract). Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures. :140-151.

Vishkin U. 1991. Can parallel algorithms enhance serial implementation? Parallel Processing Symposium, 1994. Proceedings., Eighth International. :376-385.

Vishkin U. 2004. PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness. Mathematical Foundations of Computer Science 2004Mathematical Foundations of Computer Science 2004. 3153:104-105.

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.

Pages

Publications