Source

Symposium on the Theory of Computing

Source type: conference

Fully OA: No

DOAJ: No

OpenAlex ID: S4306421003

Induction of decision trees. Machine Learning

1986 · J. R. Quinlan · Symposium on the Theory of Computing · 780

Receipt-Free Secret-Ballot Elections

1994 · Josh Cohen Benaloh · Symposium on the Theory of Computing · 281

The Round Complexity of Secure Protocols (Extended Abstract)

1990 · Donald Beaver, Silvio Micali, et al. · Symposium on the Theory of Computing · 197

Two-prover one-round proof systems: Their power and their problems

1992 · Uriel Feige, László Lovász · Symposium on the Theory of Computing · 182

878-approximation Algorithms for MAX CUT and MAX 2SAT

1994 · M. X. Goemans · Symposium on the Theory of Computing · 173

Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.

1994 · Hans L. Bodlaender, Michael R. Fellows, et al. · Symposium on the Theory of Computing · 65

Statistical Mechanics, Three-Dimensionality and NP-Completeness: I. Universality of Intractability of the Partition Functions of the Ising Model Across Non-Planar Lattices

2000 · Sorin Istrail · Symposium on the Theory of Computing · 46

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)

1988 · Stavros S. Cosmadakis, Haim Gaifman, et al. · Symposium on the Theory of Computing · 46

On-line algorithms for Steiner tree problems

1997 · Piotr Berman, Chris Coulston · Symposium on the Theory of Computing · 44

Efficient recovery from power outage

1999 · Sudipto Guha, Anna Moss, et al. · Symposium on the Theory of Computing · 42

Lines in space - combinatorics, algorithms and applications

1989 · Bernard Chazelle, Herbert Edelsbrunner, et al. · Symposium on the Theory of Computing · 39

Improved upper bounds on information-theoretic private information retrieval

1999 · Yuval Ishai · Symposium on the Theory of Computing · 38

Complexity Classes of Recursive Functions and the Existence of Complexity Gaps

1969 · Allan Borodin · Symposium on the Theory of Computing · 31

Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report

1985 · Moshe Y. Vardi, Larry J. Stockmeyer · Symposium on the Theory of Computing · 26

Proceedings of the twenty-third annual ACM symposium on Theory of computing

1991 · Cris Koutsougeras, Jeff Vitter · Symposium on the Theory of Computing · 24

Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract)

1988 · Mihalis Yannakakis · Symposium on the Theory of Computing · 24

A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms

1982 · Jan Pachl, Ephraim Korach, et al. · Symposium on the Theory of Computing · 24

Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract)

1985 · Umesh Vazirani · Symposium on the Theory of Computing · 21

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)

1988 · Michael Ben-Or, Prasoon Tiwari · Symposium on the Theory of Computing · 20

Building triangulations using epsilon-nets.

2006 · Kenneth L. Clarkson · Symposium on the Theory of Computing · 19

A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems

2000 · Artur Czumaj, Christian Scheideler · Symposium on the Theory of Computing · 18

Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)

1983 · Danny Dolev, Cynthia Dwork, et al. · Symposium on the Theory of Computing · 18

Probabilistic, Nondeterministic, and Alternating Decision Trees

1982 · Udi Manber, Martin Tompa · Symposium on the Theory of Computing · 18

Lower Bounds for Algebraic Computation Trees (Preliminary Report)

1983 · Michael Ben-Or · Symposium on the Theory of Computing · 17

The Complexity of Perfect Zero-Knowledge (Extended Abstract)

1987 · Lance Fortnow · Symposium on the Theory of Computing · 16

Works count: 216

Citation count: 2,670

H-index: 19

I10-index: 36

2yr mean citedness: