Publications

Export 566 results:
Author [ Title(Asc)] 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 
O
J. Johnson I, Labich N, Might M, Van Horn D.  2013.  Optimizing Abstract Abstract Machines. arXiv:1211.3722 [cs].
Bright L, Raschid L, Vidal ME.  1998.  Optimization of wrappers and mediators for web accessible data sources (websources). Workshop Web Inf. Data Management (WIDM), Washington DC.
Raman R, Vishkin U.  1994.  Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix. Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms. :613-621.
Vishkin U.  1985.  Optimal parallel pattern matching in strings. Information and Control. 67(1-3):91-113.
Bar-On I, Vishkin U.  1985.  Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems (TOPLAS). 7(2):348-357.
Vishkin U.  1984.  An optimal parallel connectivity algorithm* 1. Discrete applied mathematics. 9(2):197-207.
Goodrich MT, Matias Y, Vishkin U.  1994.  Optimal parallel approximation for prefix sums and integer sorting. Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms. :241-250.
Cole R, Vishkin U.  1988.  Optimal parallel algorithms for expression tree evaluation and list ranking. VLSI Algorithms and Architectures. :91-100.
Vishkin U.  1987.  An optimal parallel algorithm for selection. Parallel and Distributed Computing. 4:79-86.
Berkman O, Schieber B, Vishkin U.  1993.  Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms. 14(3):344-370.
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.  2004.  OPTICAL INTERCONNECT STRUCTURE IN A COMPUTER SYSTEM. (WO/2004/083904)
Khuller S, Mitchell SG, Vazirani VV.  1990.  On-line algorithms for weighted matching and stable marriages. TR90-1143
Vezzulli L, Colwell RR, Pruzzo C.  2013.  Ocean Warming and Spread of Pathogenic Vibrios in the Aquatic Environment. Microbial Ecology. :817-825.
Sankaranarayanan AC, Veeraraghavan A, Chellappa R.  2008.  Object Detection, Tracking and Recognition for Multiple Smart Cameras. Proceedings of the IEEE. 96(10):1606-1624.
Shiloach Y, Vishkin U.  1982.  An O (n2log n) parallel max-flow algorithm. Journal of Algorithms. 3(2):128-146.
Shiloach Y, Vishkin U.  1982.  An O (logn) parallel connectivity algorithm. Journal of Algorithms. 3(1):57-67.
N
Matias E, Vishkin U.  1995.  A note on reducing parallel model simulations to integer sorting. Parallel Processing Symposium, 1995. Proceedings., 9th International. :208-212.
Vaswani N, Chellappa R.  2005.  Non-Stationary "Shape Activities". Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on. :1521-1528.
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.
Berthier R, Cukier M, Hiltunen M, Kormann D, Vesonder G, Sheleheda D.  2010.  Nfsight: netflow-based network awareness tool.
Narayanan I, Sarangan V, Vasan A, Srinivasan A, Sivasubramaniam A.  2012.  Networking lessons: From computers to water. 2012 Fourth International Conference on Communication Systems and Networks (COMSNETS). :1-6.
Darsa L, Costa Silva B, Varshney A.  1997.  Navigating static environments using image-space simplification and morphing. Proceedings of the 1997 symposium on Interactive 3D graphics.
M
Haririnia A, Verma R, Purohit N, Twarog MZ, Deshaies RJ, Bolon D, Fushman D.  2008.  Mutations in the Hydrophobic Core of Ubiquitin Differentially Affect Its Recognition by Receptor Proteins. Journal of Molecular Biology. 375(4):979-996.
Danovaro E, De Floriani L, Vitali M, Magillo P.  2007.  Multi-scale dual morse complexes for representing terrain morphology. Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems. :29:1–29:8-29:1–29:8.

Pages