Publications
Export 566 results:
Author Title Type [ Year![(Desc)](https://www.umiacs.umd.edu/sites/all/modules/biblio/misc/arrow-desc.png)
Filters: First Letter Of Last Name is V [Clear All Filters]
1988. On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
1988. On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
1988. Locating alignments with k differences for nucleotide and amino acid sequences. Computer applications in the biosciences: CABIOS. 4(1):19-19.
1988. Matching patterns in strings subject to multi-linear transformations. Theoretical Computer Science. 60(3):231-254.
1988. Optimal parallel algorithms for expression tree evaluation and list ranking. VLSI Algorithms and Architectures. :91-100.
1988. PRAM algorithms: teach and preach. collection of position papers, IBM-NSF Workshop on$\textbackslashbackslash$ Opportunities and Constraints of Parallel Computing", IBM Almaden.
1989. Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
1989. Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
1990. Deterministic sampling—a new technique for fast pattern matching. Proceedings of the twenty-second annual ACM symposium on Theory of computing. :170-180.
1990. Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
1990. The structure, distribution and evolution of the ıt Ta1 retrotransposable element family of ıt Arabidopsis thaliana. Genetics. 126(3):713-721.
1991. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms. Information and Computation. 92(1):1-47.
1991. Can parallel algorithms enhance serial implementation? Parallel Processing Symposium, 1994. Proceedings., Eighth International. :376-385.
1991. Converting high probability into nearly-constant time—with applications to parallel hashing. Proceedings of the twenty-third annual ACM symposium on Theory of computing. :307-316.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
1991. Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.
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.