StackOverflowTheoretical Computer Science expected age by tag list
Calculated by using the expected value for the age each answer comes from
Top 324 Theoretical Computer Science expected age by tag list
This list contains the expected age per tag from the the Theoretical Computer Science site, sorted by expected age.
The list was generated with the Theoretical Computer Science April 2011 data dump on 4/25/2011 10:48:35 PM.
The creator of this list is Brian R. Bondy: Blog, Twitter, StackOverflow.
Please see the following link for other lists.
Top Tags:
- max-flow: 20.00 years old
- tournament: 21.00 years old
- bounded-reverse-math: 21.00 years old
- bibliography: 22.00 years old
- edit-distance: 22.00 years old
- padding: 22.50 years old
- direct-sum: 22.50 years old
- network-modeling: 22.75 years old
- context-free: 23.00 years old
- homomorphic-encryption: 23.00 years old
- cryptographic-attack: 23.00 years old
- compiler: 23.00 years old
- range-searching: 23.00 years old
- boolean-matrix: 23.00 years old
- natural-proofs: 23.00 years old
- relational-machines: 23.00 years old
- polymath: 23.00 years old
- unambiguous: 23.00 years old
- chordal-graphs: 23.00 years old
- isolation: 23.00 years old
- max-flow-min-cut: 23.80 years old
- space-time-tradeoff: 24.00 years old
- cliquewidth: 24.00 years old
- association-schemes: 24.00 years old
- fourier: 24.00 years old
- set-theory: 24.75 years old
- unique-games-conjecture: 25.00 years old
- time-hierarchy: 25.00 years old
- decision-trees: 25.00 years old
- holographic-algorithms: 25.00 years old
- tensor-rank: 25.00 years old
- incompleteness: 25.00 years old
- hash-function: 25.27 years old
- regular-language: 25.40 years old
- relativization: 25.50 years old
- bounds: 25.50 years old
- smoothed-analysis: 25.50 years old
- sample-complexity: 25.67 years old
- descriptive-complexity: 25.88 years old
- transitive-closure: 26.00 years old
- transitive-reduction: 26.00 years old
- parallel-repetition: 26.00 years old
- brzozwoski-derivatives: 26.00 years old
- genetic-algorithms: 26.00 years old
- tag-removed: 26.29 years old
- ramsey-theory: 26.33 years old
- parsing: 26.33 years old
- obfuscation: 26.50 years old
- sparse-matrix: 26.50 years old
- minor-closed: 26.50 years old
- string-matching: 26.57 years old
- alternating-hierarchy: 26.67 years old
- matrices: 26.86 years old
- pseudorandomness: 27.00 years old
- query-complexity: 27.00 years old
- greedy-algorithms: 27.00 years old
- language-design: 27.00 years old
- genetic-programming: 27.00 years old
- measure-theory: 27.00 years old
- tsp: 27.14 years old
- oracle: 27.21 years old
- db.databases: 27.22 years old
- matrix-product: 27.25 years old
- grammars: 27.33 years old
- black-box: 27.33 years old
- formulas: 27.33 years old
- fixed-parameter-tractable: 27.50 years old
- boolean-functions: 27.60 years old
- encoding: 27.75 years old
- communication-complexity: 27.88 years old
- type-theory: 28.00 years old
- p-vs-np: 28.00 years old
- proof-assistants: 28.00 years old
- natural-deduction: 28.00 years old
- dfa: 28.00 years old
- recursion: 28.00 years old
- logic-programming: 28.00 years old
- thesis-topic: 28.00 years old
- machine-learning: 28.18 years old
- implementation: 28.25 years old
- apx: 28.25 years old
- security: 28.29 years old
- complexity-classes: 28.30 years old
- queueing-theory: 28.33 years old
- exp-time-algorithms: 28.38 years old
- automated-theorem-proving: 28.40 years old
- simplex: 28.40 years old
- cr.crypto-security: 28.45 years old
- feedback-vertex-set: 28.50 years old
- kolmogorov-complexity: 28.67 years old
- space-bounded: 28.68 years old
- hard-instances: 28.75 years old
- fl.formal-languages: 28.81 years old
- reference-request: 28.82 years old
- graph-algorithms: 28.94 years old
- graph-theory: 28.96 years old
- lo.logic: 28.98 years old
- software: 29.00 years old
- subexponential-time: 29.00 years old
- stochastic-process: 29.00 years old
- zero-knowledge: 29.00 years old
- embeddings: 29.00 years old
- ds.algorithms: 29.14 years old
- cc.complexity-theory: 29.19 years old
- finite-model-theory: 29.20 years old
- dna-computing: 29.25 years old
- pl.programming-lang: 29.26 years old
- online-learning: 29.29 years old
- ct.category-theory: 29.29 years old
- pcp: 29.30 years old
- total-ordering: 29.33 years old
- sorting: 29.36 years old
- soft-question: 29.39 years old
- random-walk: 29.40 years old
- graph-drawing: 29.40 years old
- sat: 29.41 years old
- number-theory: 29.44 years old
- co.combinatorics: 29.49 years old
- computability: 29.56 years old
- nondeterminism: 29.57 years old
- open-problem: 29.59 years old
- examples: 29.64 years old
- algebra: 29.67 years old
- formal-systems: 29.67 years old
- interactive-computation: 29.67 years old
- reductions: 29.68 years old
- np-hardness: 29.69 years old
- books: 29.70 years old
- ds.data-structures: 29.74 years old
- separation: 29.75 years old
- lg.learning: 29.76 years old
- dynamic: 29.88 years old
- proof-complexity: 29.89 years old
- directed-acyclic-graph: 29.92 years old
- string-search: 30.00 years old
- norms: 30.00 years old
- skip-lists: 30.00 years old
- message-passing: 30.00 years old
- context-free-languages: 30.00 years old
- linear-programming: 30.07 years old
- functional-programming: 30.15 years old
- average-case-complexity: 30.20 years old
- big-list: 30.22 years old
- type-inference: 30.25 years old
- unique-solution: 30.25 years old
- matching: 30.30 years old
- data-mining: 30.33 years old
- polynomial-time: 30.33 years old
- probabilistic-circuits: 30.40 years old
- model-checking: 30.50 years old
- program-verification: 30.56 years old
- turing-machines: 30.57 years old
- dc.distributed-comp: 30.67 years old
- polynomials: 30.67 years old
- phase-transition: 30.67 years old
- partial-order: 30.67 years old
- approximation-algorithms: 30.68 years old
- circuit-complexity: 30.71 years old
- career: 30.71 years old
- quantum-computing: 30.75 years old
- graph-isomorphism: 30.75 years old
- one-way-function: 30.75 years old
- np: 30.86 years old
- csp: 30.89 years old
- automata-theory: 30.91 years old
- pr.probability: 30.93 years old
- petri-nets: 31.00 years old
- reduction-strategies: 31.00 years old
- binary-decision-diagrams: 31.00 years old
- uniformity: 31.00 years old
- electronics: 31.00 years old
- bounded-depth: 31.00 years old
- treewidth: 31.11 years old
- randomness: 31.19 years old
- advice-and-nonuniformity: 31.20 years old
- survey: 31.26 years old
- ai.artificial-intel: 31.29 years old
- packing: 31.33 years old
- employment: 31.33 years old
- automorphism: 31.33 years old
- compressed-sensing: 31.33 years old
- gct: 31.33 years old
- algebraic-complexity: 31.38 years old
- it.information-theory: 31.38 years old
- teaching: 31.48 years old
- proofs: 31.48 years old
- formal-methods: 31.50 years old
- sequent-calculus: 31.50 years old
- big-picture: 31.50 years old
- terminology: 31.52 years old
- formal-modeling: 31.56 years old
- data-streams: 31.57 years old
- set-cover: 31.57 years old
- imperative-programming: 31.58 years old
- puzzles: 31.60 years old
- lower-bounds: 31.66 years old
- regular-expressions: 31.71 years old
- hamiltonian-paths: 31.71 years old
- circuit-families: 31.73 years old
- coq: 31.75 years old
- natural-computing: 31.78 years old
- optimization: 31.88 years old
- concurrency: 31.88 years old
- writing: 31.88 years old
- dc.parallel-comp: 31.96 years old
- coding-theory: 32.00 years old
- halting-problem: 32.00 years old
- integrality-gap: 32.00 years old
- processor-failure: 32.00 years old
- lambda-calculus: 32.14 years old
- cg.comp-geom: 32.17 years old
- recreational: 32.29 years old
- chernoff-bound: 32.33 years old
- online-algorithms: 32.36 years old
- approximation-hardness: 32.38 years old
- denotational-semantics: 32.40 years old
- spectral-graph-theory: 32.40 years old
- derandomization: 32.45 years old
- factoring: 32.50 years old
- intuition: 32.50 years old
- advice-request: 32.51 years old
- vc-dimension: 32.57 years old
- mandelbrot: 32.60 years old
- research-practice: 32.62 years old
- hypergraphs: 32.64 years old
- topological-graph-theory: 32.67 years old
- tree: 32.82 years old
- graph-colouring: 33.00 years old
- semidefinite-programming: 33.00 years old
- qma: 33.00 years old
- ho.history-overview: 33.05 years old
- time-complexity: 33.07 years old
- physics: 33.11 years old
- counting-complexity: 33.14 years old
- planar-graphs: 33.17 years old
- pseudorandom-generators: 33.20 years old
- graph-classes: 33.33 years old
- ne.neural-evol: 33.47 years old
- epsilon-nets: 33.50 years old
- semantics: 33.50 years old
- proof-techniques: 33.50 years old
- polymorphism: 33.50 years old
- property-testing: 33.50 years old
- process-algebra: 33.50 years old
- coinduction: 33.50 years old
- game-semantics: 33.50 years old
- symmetry: 33.50 years old
- time-constructibility: 33.50 years old
- space-constructibility: 33.50 years old
- combinatory-logic: 33.57 years old
- max-cut: 33.73 years old
- randomized-algorithms: 33.79 years old
- interactive-proofs: 33.86 years old
- parameterized-complexity: 33.90 years old
- authorship: 34.00 years old
- card-games: 34.00 years old
- bioinformatics: 34.00 years old
- interpolation-search: 34.00 years old
- application-of-theory: 34.09 years old
- experimental: 34.14 years old
- conditional-results: 34.19 years old
- integer-programming: 34.29 years old
- project-topic: 34.50 years old
- linear-algebra: 34.56 years old
- metrics: 34.57 years old
- permutations: 34.63 years old
- domain-theory: 34.67 years old
- gt.game-theory: 34.81 years old
- integer-lattice: 34.83 years old
- polynomial-hierarchy: 34.88 years old
- proof-theory: 35.00 years old
- markov-chains: 35.00 years old
- crossing-number: 35.00 years old
- normalization: 35.00 years old
- paper-review: 35.13 years old
- primal-dual: 35.25 years old
- relational-structures: 35.25 years old
- garbage-collection: 35.50 years old
- st.statistics: 35.80 years old
- statistical-physics: 36.00 years old
- numerical-analysis: 36.00 years old
- ppad: 36.00 years old
- machine-models: 36.18 years old
- clustering: 36.50 years old
- expanders: 36.60 years old
- clique: 36.75 years old
- computing-over-reals: 37.08 years old
- permanent: 37.17 years old
- topology: 37.30 years old
- streaming: 37.33 years old
- upper-bounds: 37.75 years old
- mu-calculus: 38.50 years old
- data-sets: 38.50 years old
- computable-analysis: 38.71 years old
- percolation: 39.00 years old
- non-classical-logics: 39.00 years old
- linear-logic: 39.00 years old
- logical-relations: 39.00 years old
- bisimulations: 39.00 years old
- knowledge-representation: 39.00 years old
- notation: 39.00 years old
- metric-spaces: 39.00 years old
- step-indexing: 39.00 years old
- full-abstraction: 39.00 years old
- cut-elimination: 39.00 years old
- utm: 39.00 years old
- minkowski-sum: 40.00 years old
- scheduling: 40.75 years old
- social-sciences: 41.00 years old
- social-choice: 41.00 years old
- heuristics: 41.00 years old
- barriers: 41.00 years old
- proof: 41.67 years old
- order-theory: 42.50 years old
- lattice: 42.50 years old
- universal-computation: 43.50 years old
- reliable-computing: 44.00 years old
- fault-tolerant: 44.00 years old
- error-correcting: 44.00 years old
- fields: 44.00 years old
- amortized-analysis: 44.00 years old
- board-games: 47.00 years old
- cellular-automata: 49.00 years old
- ising-model: 51.00 years old