S. Rao Kosaraju, David S. Johnson, Alok Aggarwal (Eds.):
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA.
ACM 1993, ISBN 0-89791-591-7
25. STOC 1993: San Diego, California, USA
Arthur W. Chou
, Ker-I Ko
: Some complexity issues on the simply connected regions of the two-dimensional plane.
Brenda S. Baker
: A theory of parameterized pattern matching: algorithms and applications.
Leslie Ann Goldberg
: Polynomial space polynomial delay algorithms for listing families of graphs.
Hans L. Bodlaender
: A linear time algorithm for finding tree-decompositions of small treewidth.
Richard M. Karp
: Mapping the genome: some combinatorial problems arising in molecular biology.
: Bounds for the computational power and learning complexity of analog neural nets.
Michael J. Kearns
: Efficient noise-tolerant learning from statistical queries.
: Time-space trade-offs for undirected st-connectivity on a JAG.
: On the generation of multivariate polynomials which are hard to factor.