Publications

Export 566 results:
Author [ Title(Desc)] 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 
P
Landau G, Schieber B, Vishkin U.  1987.  Parallel construction of a suffix tree. Automata, Languages and Programming. :314-325.
Apostolico A, Iliopoulos C, Landau GM, Schieber B, Vishkin U.  1988.  Parallel construction of a suffix tree with applications. Algorithmica. 3(1):347-365.
Paul W, Vishkin U, Wagener H.  1983.  Parallel dictionaries on 2–3 trees. Automata, Languages and Programming. :597-609.
Maon Y, Schieber B, Vishkin U.  1986.  Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoretical Computer Science. 47:277-298.
Juba D, Cardone A, Ip C Y, Simon Jr CG, K Tison C, Kumar G, Brady M, Varshney A.  2013.  Parallel geometric classification of stem cells by their three-dimensional morphology. Computational Science & Discovery. 6(1):015007.
Matias Y, Vishkin U.  1991.  On parallel hashing and integer sorting. Journal of Algorithms. 12(4):573-606.
Berkman O, Vishkin U.  1993.  On parallel integer merging. Information and Computation. 106(2):266-285.
Shiloach Y, Vishkin U, An O.  1982.  parallel MAX-FLOW algorithm. Journal of Algorithms. 3:128-146.
Varshney A.  1991.  Parallel radiosity techniques for mesh-connected SIMD computers.
Juba D, Varshney A.  2008.  Parallel, stochastic measurement of molecular surface area. Journal of Molecular Graphics and Modelling. 27(1):82-87.
Sahinalp SC, Vishkin U.  1994.  On a parallel-algorithms method for string matching problems. Lecture Notes in Computer Science. 778:22-32.
Sahinalp S, Vishkin U.  1994.  On a parallel-algorithms method for string matching problems (overview). Algorithms and ComplexityAlgorithms and Complexity. 778:22-32.
Vishkin U.  1984.  A parallel-design distributed-implementation (PDDI) general-purpose computer. Theoretical Computer Science. 32(1-2):157-172.
Vaswani N, Chellappa R.  2003.  A particle filtering approach to abnormality detection in nonlinear systems and its application to abnormal activity detection. 3rd Int’l Workshop on Statistical and Computational Theories of Vision, Nice, France.
Motiwala M, Elmore M, Feamster N, Vempala S.  2008.  Path splicing. SIGCOMM Comput. Commun. Rev.. 38(4):27-38.
Motiwala M, Feamster N, Vempala S.  2007.  Path splicing: Reliable connectivity with rapid recovery. ACM SIGCOMM HotNets VI.
Feamster N, Motiwala M, Vempala S.  2007.  Path splicing with network slicing. Proc. ACM SIGCOMM Hot-Nets.
Landau GM, Vishkin U.  1994.  Pattern matching in a digitized image. Algorithmica. 12(4):375-408.
Chellappa R, Veeraraghavan A, Aggarwal G.  2005.  Pattern Recognition in Video. Pattern Recognition and Machine IntelligencePattern Recognition and Machine Intelligence. 3776:11-20.
Hadley D, Murphy T, Valladares O, Hannenhalli S, Ungar L, Kim J, Bućan M.  2006.  Patterns of sequence conservation in presynaptic neural genes. Genome Biology. 7(11):R105-R105.
Chuang WH, Varna AL, Wu M.  2010.  Performance impact of ordinal ranking on content fingerprinting. IEEE Int. Conf. on Image Processing.
Kim Y, Varshney A.  2008.  Persuading Visual Attention through Geometry. Visualization and Computer Graphics, IEEE Transactions on. 14(4):772-782.
Azarian T, Ali A, Johnson JA, Mohr D, Prosperi M, Veras NM, Jubair M, Strickland SL, Rashid MH, Alam MT et al..  2014.  Phylodynamic Analysis of Clinical and Environmental Vibrio cholerae Isolates from Haiti Reveals Diversification Driven by Positive Selection. mBio. (6)
Hochstein L, Basili VR, Vishkin U, Gilbert J.  2008.  A pilot study to compare programming effort for two parallel programming models. Journal of Systems and Software. 81(11):1920-1930.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.

Pages