Publications
Found 271 results
Author Title Type [ Year] Filters: First Letter Of Last Name is V [Clear All Filters]
The Complexity of Testing Whether a Graph is a Superconcentrator.
13(4-5), 164-167.
(1981). Global Wire Routing in Two-Dimensional Arrays.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 453-459.
(1983). Global Wire Routing in Two-Dimensional Arrays.
Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 453-459.
(1983). Global wire routing in two-dimensional arrays.
2(1), 113-129.
(1987). Global wire routing in two-dimensional arrays.
2(1), 113-129.
(1987).
(1989).
(1989).
(1989).
(1989).
(1990).
An optimal algorithm for on-line bipartite matching.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
(1990). An optimal algorithm for on-line bipartite matching.
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
(1990).
(1990).
(1990).
(1991).
(1991).
(1991).
(1992).
(1992).
(1992).
(1992).
(1992).
(1992).
(1992).