Search Results - "Vishkin, Uzi"

Using Simple Abstraction to Reinvent Computing for Parallelism.

Authors: Vishkin, Uzi

Source: Communications of the ACM; January 2011, Vol. 54 Issue 1, p75-85, 10p

Can parallel algorithms enhance serial implementation?

Authors: Vishkin, Uzi

Source: Communications of the ACM; September 1996, Vol. 39, p88-91, 4p

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

Authors: Dachman-Soled, Dana Liu, Chang Papamanthou, Charalampos et al.

Source: Journal of Cryptology; Jul2019, Vol. 32 Issue 3, p941-972, 32p

Counterpoint: Parallel Programming Wall and Multicore Software Spiral: Denial Hence Crisis.

Authors: Vishkin, Uzi¹ vishkin@umiacs.umd.edu

Source: Communications of the ACM. Sep2022, Vol. 65 Issue 9, p32-34. 3p.

Subjects: Random access memory, Computer storage devices, Central processing units, Computers, Computer programming, Electronic data processing

Mesh-of-Trees and, Alternative Interconnection Networks for Single-Chip Parallelism.

Authors: Balkan, Aydin O. Qu, Gang Vishkin, Uzi

Source: IEEE Transactions on Very Large Scale Integration (VLSI) Systems; October 2009, Vol. 17 Issue 10, p1419-1432, 14p

A pilot study to compare programming effort for two parallel programming models.

Authors: Hochstein, Lorin Basili, Victor R. Vishkin, Uzi

Source: Journal of Systems & Software; November 2008, Vol. 81 Issue 11, p1920-1930, 11p

Bootstrapping Free-Space Optical Networks.

Authors: Liu, Fang Vishkin, Uzi Milner, Stuart

Source: IEEE Journal on Selected Areas in Communications; Dec2006, Vol. 24 Issue 12, p13-22, 10p

Biconnectivity approximations and graph carvings.

Authors: Khuller, Samir Vishkin, Uzi

Source: Journal of the ACM; March 1994, Vol. 41, p214-235, 22p

Solving NP-hard problems on graphs that are almost trees and an application to facility location problems.

Authors: Gurevich, Yuri Stockmeyer, Larry Vishkin, Uzi

Source: Journal of the ACM; July 1984, Vol. 31, p459-473, 15p

On the detection of robust curves.

Authors: Cole, Richard Vishkin, Uzi

Source: CVGIP: Graphical Models & Image Processing; May 1994, Vol. 56, p189-204, 16p

Recursive star-tree parallel data structure.

Authors: Berkman, Omer Vishkin, Uzi

Source: SIAM Journal on Computing; April 1993, Vol. 22, p221-242, 22p

Deterministic sampling—a new technique for fast pattern matching.

Authors: Vishkin, Uzi

Source: SIAM Journal on Computing; February 1991, Vol. 20, p22-40, 19p

On finding lowest common ancestors: simplification and parallelization.

Authors: Schieber, Baruch Vishkin, Uzi

Source: SIAM Journal on Computing; December 1988, Vol. 17, p1253-1262, 10p

Approximate parallel scheduling. The basic technique with applications to optimal parallel list ranking in logarithmic time.

Authors: Cole, Richard Vishkin, Uzi

Source: SIAM Journal on Computing; February 1988, Vol. 17, p128-142, 15p

Tight comparison bounds on the complexity of parallel sorting.

Authors: Azar, Yossi Vishkin, Uzi

Source: SIAM Journal on Computing; June 1987, Vol. 16, p458-464, 7p

An efficient parallel biconnectivity algorithm.

Authors: Tarjan, Robert E. Vishkin, Uzi

Source: SIAM Journal on Computing; November 1985, Vol. 14, p862-874, 13p

Trade-offs between depth and width in parallel computation.

Authors: Vishkin, Uzi Wigderson, Avi

Source: SIAM Journal on Computing; May 1985, Vol. 14, p303-314, 12p

Simulation of parallel random access machines by circuits.

Authors: Stockmeyer, Larry Vishkin, Uzi

Source: SIAM Journal on Computing; May 1984, Vol. 13, p409-422, 14p

Constant depth reducibility.

Authors: Chandra, Ashok K. Stockmeyer, Larry Vishkin, Uzi

Source: SIAM Journal on Computing; May 1984, Vol. 13, p423-439, 17p

An Area-Efficient High-Throughput Hybrid Interconnection Network for Single-Chip Parallel Processing.

Authors: Balkan, Aydin O. Gang Qu Vishkin, Uzi

Source: DAC: Annual ACM/IEEE Design Automation Conference; 2008, p435-440, 6p, 4 Diagrams, 1 Chart, 3 Graphs