a research topic bursts in terms of NSF
grants first, it is likely to burst in publications within a few years. The opposite
pattern is at least twice less frequent.
Hence, we conclude while funding is
not necessary in the initial growth in
a CS research topic, it is essential for
maintaining research momentum and
Most authors manage to publish at
most once a year in a particular research
field. Moreover, authors tend to publish
in the same major research category
for at most only a few years. Only a fraction of them continues to publish in the
same field year after year for a long time.
This agrees well with the model of an
academic research team in which permanent faculty represent only a small
fraction of the overall team of faculty,
students, and postdocs, with the latter
routinely changing topics after leaving
a team. Moreover, a faculty member is
often active in more than one area. Finally, since novelty is prized, authors
tend to pursue new directions in their
research, as reflected in an article’s abstract and keywords, further contributing to the observed pattern.
The authors thank Francine Berman
and James A. Hendler of Rensselaer
Polytechnic Institute, George Cybenko
of Dartmouth, and Jack Dongarra of the
University of Tennessee, Knoxville, for
discussions on the evolution of their
research interests. The authors also
thank Katie Bahran for help editing the
article. The research was sponsored by
the Army Research Laboratory and accomplished under Cooperative Agreement Number W911NF-09-2-0053. The
views and conclusions in this article
are those of the authors and should
not be interpreted as representing the
official policies, either expressed or
implied, of the Army Research Laboratory or the U.S. government. The U.S.
government is authorized to reproduce
and distribute reprints for government
purposes notwithstanding any copyright notation here on.
1. aCm Digital library; http://dl.acm.org
2. agrawal, r., ailamaki, a., bernstein, P.a. et al. the
Claremont report on database research. Commun.
ACM 52, 6 (June 2009), 56–65.
3. Cohoon, J.m., nigai, s., and kaye, J. gender and
computing in conference papers. Commun. ACM 54, 8
(aug. 2011), 72–80.
4. edler, D. and m. rosvall, m. map generator software
package. mapequation, umeå, sweden, 2010; http://
5. Fama, e. F. the behavior of stock-market prices.
Journal of Business 38, 1 (Jan. 1965), 34–105.
6. goldberg, m., magdon-Ismail, m., nambirajan, s.,
and thompson, J. tracking and predicting evolution
of social communities. In Proceedings of the Third
IEEE International Conference on Social Computing
(boston, oct. 9–11). Ieee, 2011, 780–783.
7. hall, m., Padua, D., and Pingali, k. Compiler research: the
next 50 years. Commun. ACM 52, 2 (Feb. 2009), 60–67.
8. hendler, J. and berners-lee, t. From the semantic
Web to social machines: a research challenge for aI
on the World Wide Web. Artificial Intelligence 174, 2
(Feb. 2010), 156–161.
9. hoonlor, a., szymanski, b.k., Zaki, m.J., and thompson,
J. An Evolution of Computer Science Research. rPI
technical report 12-01, rensselaer Polytechnic
Institute, troy, ny, 2012; http://www.cs.rpi.edu/
10. hoonlor, a., szymanski, b.k., Zaki, m., and Chaoji, V.
Document clustering with bursty information. Computing
and Informatics 31, 6 (Dec. 2012), 1533–1555.
11. Ieee Xplore; http://ieeexplore.ieee.org/Xplore/
12. lappas, t., arai, b., Platakis, m., kotsakos, D., and
gunopulos, D. on burstiness-aware search for
document sequences. In Proceedings of the 15th ACM
SIGKDD International Conference on Knowledge
Discovery and Data Mining (Paris, France, June 28–
July 1). aCm Press, new york, 2009, 477-486.
13. moody, J. the structure of a social science
collaboration network: Disciplinary cohesion from
1963 to 1999. American Sociological Review 69, 2
(apr. 2004), 213–238.
14. national science Foundation award search; http://
15. neilson, r.P. high-resolution climatic analysis and
southwest biogeography. Science 232, 4746 (apr.
16. Porter, a.l. and rafols, I. Is science becoming more
interdisciplinary? measuring and mapping six research
fields over time. Scientometrics 81, 3 (Dec. 2009),
17. reacher, m.h., shah, a., livermore, D.m. et al.
bacteraemia and antibiotic resistance of its pathogens
reported in england and Wales between 1990 and
1998: trend analysis. British Medical Journal 320,
7229 (Jan. 2000), 213–216.
18. rosvall, m and bergstrom, C. mapping change in large
networks. PLoS One 5, 1 (Jan. 2010).
19. rosvall, m. and bergstrom, C. maps of information
flow reveal community structure in complex
networks. Proceedings of the National Academy of
Sciences of the United States of America 105, 4 (Jan.
20. ruzzo, W.l. and tompa, m. a linear time algorithm
for finding all maximal scoring subsequences. In
Proceedings of the Seventh International Conference
on Intelligent Systems for Molecular Biology
(heidelberg, germany, aug. 6–10). aaaI Press,
boston, 1999, 234–241.
21. salehie, m. and tahvildari, l. self-adaptive software:
landscape and research challenges. ACM Transactions
on Autonomous and Adaptive Systems 4, 2 (may 2009).
22. thomson reuters Web of science; http://
23. Wikipedia, Computer science; http://en.wikipedia.org/
24. Zaki, m. J. sequences mining in categorical domains:
Incorporating constraints. In Proceedings of the Ninth
ACM International Conference on Information and
Knowledge Management (Washington D. C., nov. 6–11).
aCm Press, new york, 2000, 422–429.
Apirak hoonlor ( firstname.lastname@example.org) is
an instructor in the Faculty of Information and
Communication technology at mahidol university,
Boleslaw K. Szymanski ( email@example.com) is the Claire
and roland schmitt Distinguished Professor of Computer
science and the Director of the Center for network
science and technology at rensselaer Polytechnic
Institute, troy, ny.
Mohammed J. Zaki ( firstname.lastname@example.org) is a professor in the
Computer science Department at rensselaer Polytechnic
Institute, troy, ny.
Copyright held by owner/author(s). Publication rights
licenced to aCm. $15.00
During an nsf
were more likely
is essential for
in a given topic.