Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
Filters: Filter is   [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 
V
Vishkin U.  1983.  Efficient distributed orientation algorithm.. IEEE TRANS. INFO. THEORY.. 29(4):624-628.
Vishkin U.  1991.  Structural parallel algorithmics. Automata, Languages and Programming. :363-380.
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.  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.  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.  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.  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.  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, 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.  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.  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.  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.  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 U.  2007.  Towards Realizing a PRAM-On-Chip Vision. Workshop on Highly Parallel Processing on a Chip (HPPC). 28
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.

Pages