Nisan, N.; Wigderson, A.
Page(s): 2-11
Digital Object Identifier 10.1109/SFCS.1988.21916 Abstract
| Full Text: PDF (584 KB)
Rights and Permissions
On the existence of pseudorandom generators
Goldreich, O.; Krawczyk, H.; Luby, M.
Page(s): 12-24
Digital Object Identifier 10.1109/SFCS.1988.21917 Abstract
| Full Text: PDF (808 KB)
Rights and Permissions
Achieving oblivious transfer using weakened security assumptions
Crepeau, C.; Kilian, J.
Page(s): 42-52
Digital Object Identifier 10.1109/SFCS.1988.21920 Abstract
| Full Text: PDF (816 KB)
Rights and Permissions
Lower bounds for integer greatest common divisor computations
Mansour, Y.; Schieber, B.; Tiwari, P.
Page(s): 54-63
Digital Object Identifier 10.1109/SFCS.1988.21921 Abstract
| Full Text: PDF (656 KB)
Rights and Permissions
A lower bound for matrix multiplication
Bshouty, N.H.
Page(s): 64-67
Digital Object Identifier 10.1109/SFCS.1988.21922 Abstract
| Full Text: PDF (188 KB)
Rights and Permissions
The influence of variables on Boolean functions
Kahn, J.; Kalai, G.; Linial, N.
Page(s): 68-80
Digital Object Identifier 10.1109/SFCS.1988.21923 Abstract
| Full Text: PDF (736 KB)
Rights and Permissions
Lattices, mobius functions and communications complexity
Lovasz, L.; Saks, M.
Page(s): 81-90
Digital Object Identifier 10.1109/SFCS.1988.21924 Abstract
| Full Text: PDF (788 KB)
Rights and Permissions
Near-optimal time-space tradeoff for element distinctness
Predicting {0, 1}-functions on randomly drawn points
Haussler, D.; Littlestone, N.; Warmuth, M.K.
Page(s): 100-109
Digital Object Identifier 10.1109/SFCS.1988.21928 Abstract
| Full Text: PDF (852 KB)
Rights and Permissions
Learning probabilistic prediction functions
DeSantis, A.; Markowsky, G.; Wegman, M.N.
Page(s): 110-119
Digital Object Identifier 10.1109/SFCS.1988.21929 Abstract
| Full Text: PDF (980 KB)
Rights and Permissions
Results on learnability and the Vapnik-Chervonenkis dimension
Linial, N.; Mansour, Y.; Rivest, R.L.
Page(s): 120-129
Digital Object Identifier 10.1109/SFCS.1988.21930 Abstract
| Full Text: PDF (732 KB)
Rights and Permissions
Learning via queries
Gasarch, W.I.
Page(s): 130-137
Digital Object Identifier 10.1109/SFCS.1988.21931 Abstract
| Full Text: PDF (636 KB)
Rights and Permissions
Effect of connectivity in associative memory models
Komlos, J.; Paturi, R.
Page(s): 138-147
Digital Object Identifier 10.1109/SFCS.1988.21932 Abstract
| Full Text: PDF (672 KB)
Rights and Permissions
Efficient parallel algorithms for chordal graphs
Klein, P.N.
Page(s): 150-161
Digital Object Identifier 10.1109/SFCS.1988.21933 Abstract
| Full Text: PDF (1012 KB)
Rights and Permissions
Removing randomness in parallel computation without a processor
penalty
Sublinear-time parallel algorithms for matching and related
problems
Goldberg, A.V.; Plotkin, S.A.; Vaidya, P.M.
Page(s): 174-185
Digital Object Identifier 10.1109/SFCS.1988.21935 Abstract
| Full Text: PDF (956 KB)
Rights and Permissions
Optimal parallel algorithm for the Hamiltonian cycle problem on
dense graphs
Dahlhaus, E.; Hajnal, P.; Karpinski, M.
Page(s): 186-193
Digital Object Identifier 10.1109/SFCS.1988.21936 Abstract
| Full Text: PDF (520 KB)
Rights and Permissions
Parallel comparison algorithms for approximation problems
Alon, N.; Azar, Y.
Page(s): 194-203
Digital Object Identifier 10.1109/SFCS.1988.21937 Abstract
| Full Text: PDF (748 KB)
Rights and Permissions
Dynamic networks are as fast as static networks
Awerbuch, B.; Sipser, M.
Page(s): 206-219
Digital Object Identifier 10.1109/SFCS.1988.21938 Abstract
| Full Text: PDF (916 KB)
Rights and Permissions
Increasing the size of a network by a constant factor can increase
performance by more than a constant factor
Cart
