Sciweavers

SIGAL
1990
221views Algorithms» more  SIGAL 1990»
13 years 7 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»
13 years 7 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»
13 years 7 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»
13 years 7 months ago
Searching in Higher Dimension
Bernard Chazelle
SIGAL
1990
233views Algorithms» more  SIGAL 1990»
13 years 7 months ago
Optimal Linear Broadcast
Sara Bitan, Shmuel Zaks
SIGAL
1990
248views Algorithms» more  SIGAL 1990»
13 years 7 months ago
Topological Sweeping in Three Dimensions
Efthymios Anagnostou, Vassilios G. Polimenis, Leon...