The influence of variables on Boolean functions
Kahn, J., Kalai, G., Linial, N.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
On the complexity of omega -automata
Safra, S.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
The complexity of tree automata and logics of programs
Emerson, E.A., Jutla, C.S.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Achieving oblivious transfer using weakened security assumptions
Crepeau, C., Kilian, J.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Notes on searching in multidimensional monotone arrays
Aggarwal, A., Park, J.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Universal packet routing algorithms
Leighton, T., Maggs, B., Rao, S.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
A fast planar partition algorithm. I
Mulmuley, K.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Lattices, mobius functions and communications complexity
Lovasz, L., Saks, M.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
The complexity of the pigeonhole principle
Ajtai, M.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Polynomial algorithm for the k-cut problem
Goldschmidt, O., Hochbaum, D.S.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
On the complexity of kinodynamic planning
Canny, J., Donald, B., Reif, J., Xavier, P.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Removing randomness in parallel computation without a processor penalty
Luby, M.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Hardness vs. randomness
Nisan, N., Wigderson, A.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
An optimal algorithm for intersecting line segments in the plane
Chazelle, B., Edelsbrunner, H.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
A faster PSPACE algorithm for deciding the existential theory of the reals
Renegar, J.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Covering polygons is hard
Culberson, J.C., Reckhow, R.A.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding
Speeding up dynamic programming
Eppstein, D., Galil, Z., Giancarlo, R.
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Published in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
Get full text
Conference Proceeding