Sciweavers

STOC
1992
ACM
104views Algorithms» more  STOC 1992»
14 years 3 months ago
Biconnectivity Approximations and Graph Carvings
Samir Khuller, Uzi Vishkin
STOC
1992
ACM
127views Algorithms» more  STOC 1992»
14 years 3 months ago
Entropy and Sorting
Jeff Kahn, Jeong Han Kim
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
14 years 3 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
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 ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
14 years 3 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
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...
Anders Björner, László Lov&aacu...
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
14 years 3 months ago
Randomized versus Nondeterministic Communication Complexity
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...
Paul Beame, Joan Lawry
STOC
1992
ACM
89views Algorithms» more  STOC 1992»
14 years 3 months ago
Exponential Lower Bounds for the Pigeonhole Principle
Paul Beame, Russell Impagliazzo, Jan Krajíc...
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
14 years 3 months ago
Biased Random Walks
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...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...