Publications
Export 566 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is V [Clear All Filters]
1979. Estimating the Largest Eigenvalue of a Positive Definite Matrix. Mathematics of Computation. 33:1289-1292.
1981. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
1982. Complexity of finding k-path-free dominating sets in graphs. INFO. PROC. LETT.. 14(5):228-232.
1982. A complexity theory for unbounded fan-in parallelism. 23rd Annual Symposium on Foundations of Computer Science. :1-13.
1983. Implementation of simultaneous memory address access in models that forbid it. Journal of algorithms. 4(1):45-50.
1983. Trade-offs between depth and width in parallel computation. Foundations of Computer Science, 1983., 24th Annual Symposium on. :146-153.
1984. Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
1984. A parallel-design distributed-implementation (PDDI) general-purpose computer. Theoretical Computer Science. 32(1-2):157-172.
1984. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica. 21(4):339-374.
1984. Randomized speed-ups in parallel computation. Proceedings of the sixteenth annual ACM symposium on Theory of computing. :230-239.
1984. Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. Journal of the ACM (JACM). 31(3):459-473.
1985. Efficient string matching in the presence of errors. Foundations of Computer Science, 1985., 26th Annual Symposium on. :126-136.
1985. Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems (TOPLAS). 7(2):348-357.