The table below lists the 30 term bursts of highest weight in paper titles from the theory conferences STOC and FOCS, 1969-2001. Bursts were computed using a 2-state model in which the high state had twice the rate of the low state.

See the paper

for further details on the model and analysis, or return to the top-level page for additional sample results from the algorithm.

Word Interval of burst
grammars 1969 STOC - 1973 FOCS
automata 1969 STOC - 1974 STOC
languages 1969 STOC - 1977 STOC
machines 1969 STOC - 1978 STOC
recursive 1969 STOC - 1979 FOCS
classes 1969 STOC - 1981 FOCS
some 1969 STOC - 1980 FOCS
sequential 1969 FOCS - 1972 FOCS
equivalence 1969 FOCS - 1981 FOCS
programs 1969 FOCS - 1986 FOCS
program 1970 FOCS - 1978 STOC
on 1973 FOCS - 1976 STOC
complexity 1974 STOC - 1975 FOCS
problems 1975 FOCS - 1976 FOCS
relational 1975 FOCS - 1982 FOCS
logic 1976 FOCS - 1984 STOC
vlsi 1980 FOCS - 1986 STOC
probabilistic 1981 FOCS - 1986 FOCS
how 1982 STOC - 1988 STOC
parallel 1984 STOC - 1987 FOCS
algorithm 1984 FOCS - 1987 FOCS
graphs 1987 STOC - 1989 STOC
learning 1987 FOCS - 1997 FOCS
competitive 1990 FOCS - 1994 FOCS
randomized 1992 STOC - 1995 STOC
approximation 1993 STOC -
improved 1994 STOC - 2000 STOC
codes 1994 FOCS -
approximating 1995 FOCS -
quantum 1996 FOCS -