Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STOC
1996
ACM
78views Algorithms» more  STOC 1996»
10 years 8 months ago
Non-Expansive Hashing
Nathan Linial, Ori Sasson
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
10 years 8 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
10 years 8 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
10 years 8 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
10 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
10 years 8 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
10 years 8 months ago
Efficient Algorithms for Inverting Evolution
Martin Farach, Sampath Kannan
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
10 years 8 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
books