Sciweavers

STOC
1998
ACM
112views Algorithms» more  STOC 1998»
14 years 3 months ago
Adaptive Packet Routing for Bursty Adversarial Traffic
William Aiello, Eyal Kushilevitz, Rafail Ostrovsky...
STOC
1998
ACM
141views Algorithms» more  STOC 1998»
14 years 3 months ago
Almost Optimal Dispersers
Amnon Ta-Shma
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
14 years 3 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
14 years 3 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 3 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 3 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
14 years 3 months ago
Weak Alternating Automata and Tree Automata Emptiness
Orna Kupferman, Moshe Y. Vardi