FODO
1989
Springer
14 years 10 months ago
1989
Springer
FODO
1989
Springer
14 years 10 months ago
1989
Springer
STOC
1992
ACM
14 years 10 months ago
1992
ACM
STOC
1992
ACM
14 years 10 months ago
1992
ACM
STOC
1992
ACM
14 years 10 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
STOC
1992
ACM
14 years 10 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
STOC
1992
ACM
14 years 10 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
STOC
1992
ACM
14 years 10 months ago
1992
ACM
STOC
1992
ACM
14 years 10 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
DAC
1989
ACM
14 years 10 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...