FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...