- Uniform Complexity (Turing machine-based complexity classes, excluding Randomized Complexity and Relativized Complexity)
- Relativized Complexity
- Randomized Complexity Classes (BPP, AM, Interactive proofs excluding Zero Knowledge)
- Algebraic Complexity
- Nonuniform Complexity (communication complexity, circuit complexity, branching programs, decision trees, formula size, sensitivity, etc.) excluding Proof Complexity
- Proof Complexity
- Logic, Descriptive Complexity, Formal Languages, Rewriting
- Random Structures (properties of random objects, percolation, phase transition)
- Pseudorandomness (derandomization, extractors, expanders, "hardness vs randomness")
- Computational Coding Theory
- Inapproximability, PCPs
- Property Testing
- Zero Knowledge
- Cryptography other than Zero Knowledge
- Lower Bounds but none of the above
- Complexity but none of the above

- Fundamental Algorithms (sorting, searching, string matching, etc.)
- Scheduling, Load Balancing, Bin Packing
- Graph Algorithms: network flows, cuts, bisection, connectivity
- Graph Algorithms: shortest paths, min spanning tree, Steiner trees, facility location
- Graph Algorithms but none of the above (including matchings, coloring, cliques, crossing number, etc.)
- Network Design
- Data Structures, Dynamic Algorithms, Hierarchical Memory Models
- Random processes (Markov chains, rapid mixing, generation of random objects)
- Combinatorial Optimization (exclduding graph algorithms)
- Linear and Convex Programming, Semidefinite Programming
- Lattice Algorithms
- Approximation Algorithms
- Metric Spaces, Embeddings
- Discrete Geometry
- Computational Geometry
- Classical Algorithmic Models except the mathematical algorithms listed below but none of the above

- Computational Group Theory
- Computational Commutative Algebra, Grobner Bases
- Computational Number Theory
- Matrix Multiplication and related questions
- Computational Topology
- Numerical Computation
- Mathematical Algorithms but none of the above

- Distributed algorithms and protocols, Byzantine agreement
- Online algorithms, competitive analysis
- Quantum Computing
- Learning Theory
- Game theory (Nash equilibrium, etc.)
- Data mining, clustering, recommendation systems
- Stream model
- Network algorithms, routing, gossiping
- Computational Biology
- Alternative models but none of the above.

- Number Theory
- Group Theory
- Commutative Algebra, Algebraic Geometry
- Galois Theory, Algebraic Geometry over Finite Fields, Algebraic Coding Theory
- Algebraic Topology
- Logic, Model theory
- Fourier Analysis (discrete and continuous)
- Mathematical Analysis (other than Fourier Analysis)
- Stochastic processes
- Advanced Mathematics other than Discrete Mathematics but none of the above

Return to the
**Call for Papers**.

Return to the
**Submission Instructions**.

Back to
**STOC'04 HOME**.