Publications

Export 566 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is V  [Clear All Filters]
1994
Porter A, Votta LG.  1994.  An experiment to assess different defect detection methods for software requirements inspections. Proceedings of the 16th international conference on Software engineering. :103-112.
Berkman O, Vishkin U.  1994.  Finding level-ancestors in trees. Journal of Computer and System Sciences. 48(2):214-230.
Dorr BJ, Voss CR.  1994.  ILustrate: a MT Developers’ Tool with a Two-Component View of the Interlingua. in Proceedings of the First AMTA Conference. Columbia MD. :40-47.
Doermann D, Varma V, Rosenfeld A.  1994.  Instrument Grasp: AModel and its Effects on Handwritten Strokes. Pattern Recognition. 27(2):233-245.
MacDonald L, Vince J, Shneiderman B.  1994.  Interacting with virtual environments.
Varshney A, Brooks FP, Wright WV.  1994.  Interactive visualization of weighted three-dimensional alpha hulls. Proceedings of the tenth annual symposium on Computational geometry. :395-396.
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.
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.
Khuller S, Vishkin U.  1994.  On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
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.
Landau GM, Vishkin U.  1994.  Pattern matching in a digitized image. Algorithmica. 12(4):375-408.
Khuller S, Vishkin U, Young N.  1994.  A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal Algorithms. 17(2):280-289.
Sahinalp SC, Vishkin U.  1994.  Symmetry breaking for suffix tree construction. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. :300-309.
Berkman O, JaJa JF, Krishnamurthy S, Thurimella R, Vishkin U.  1994.  Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima. SIAM Journal on Computing. 23(3):449-465.
Mansour Y, Nisan N, Vishkin U.  1994.  Trade-offs between communication throughput and parallel time. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. :372-381.
1993
Vishkin U.  1993.  Advanced parallel prefix-sums, list ranking and connectivity. Synthesis of Parallel Algorithms. :215-257.
Goodrich MT, Matias Y, Vishkin U.  1993.  Approximate parallel prefix computation and its applications. Parallel Processing Symposium, 1993., Proceedings of Seventh International. :318-325.
Varshney A, Wright WV, Brooks Jr FP.  1993.  Bounding the number of neighbors in protein molecules. UNC-CS-TR-93-039
Vishkin U.  1993.  A case for the PRAM as a standard programmer's model. Parallel Architectures and their Efficient Use. :11-19.
Dorr BJ, Voss CR.  1993.  Constraints on the Space of MT Divergences. AAAI (1993). 43:53-53.
Manocha D, Varshney A, Weber H.  1993.  Evaluating surface intersections in lower dimensions. Second International Conference on Curves and Surfaces.
Varshney A, Brooks FP.  1993.  Fast analytical computation of Richards's smooth molecular surface. Proceedings of the 4th conference on Visualization '93. :300-307.
Dorr BJ, Voss CR.  1993.  Machine Translation of Spatial Expressions: Defining the Relation betweenan Interlingua and a Knowledge Representation System. IN PROCEEDINGS OF TWELFTH CONFERENCE OF THE AMERICAN ASSOCIATION FOR ARTIFICIAL IN℡LIGENCE. :374-379.
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.

Pages