Sciweavers

STOC
1989
ACM
99views Algorithms» more  STOC 1989»
14 years 3 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
STOC
1989
ACM
72views Algorithms» more  STOC 1989»
14 years 3 months ago
Trading Space for Time in Undirected s-t Connectivity
Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghav...
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
14 years 3 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
SIGAL
1990
221views Algorithms» more  SIGAL 1990»
14 years 3 months ago
Complexity Cores and Hard Problem Instances
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
Uwe Schöning
SIGAL
1990
216views Algorithms» more  SIGAL 1990»
14 years 3 months ago
Planar Separators and the Euclidean Norm
In this paper we show that every 2-connected embedded planar graph with faces of sizes
Hillel Gazit, Gary L. Miller
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
14 years 3 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
SIGAL
1990
253views Algorithms» more  SIGAL 1990»
14 years 3 months ago
Searching in Higher Dimension
Bernard Chazelle
SIGAL
1990
233views Algorithms» more  SIGAL 1990»
14 years 3 months ago
Optimal Linear Broadcast
Sara Bitan, Shmuel Zaks
SIGAL
1990
248views Algorithms» more  SIGAL 1990»
14 years 3 months ago
Topological Sweeping in Three Dimensions
Efthymios Anagnostou, Vassilios G. Polimenis, Leon...
SIGGRAPH
1989
ACM
14 years 3 months ago
Algorithms for solid noise synthesis
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...
J. P. Lewis