CompSci Research

Computational Social Science

Research Questions:

  1. How and why does information flow through the internet?
  2. How do internet users signal information relevance, timeliness, and quality?
  3. How can algorithms discover and predict popularity of internet content?
  4. How are communities structured on the web, and how do they evolve over time?
  • Fred S Annexstein and Svetlana Strunjaˇs. “Collaborative partitioning with maximum user satisfaction.” In Proceedings of the 17th ACM conference on Information and knowledge management, pages 1445–1446. ACM, 2008.
  • Fred Annexstein and Kenneth A. Berman  “Synthesis ranking with critic resonance”,  ACM WebSci, 2012

Structure and Evolution of Graphs and Networks

Social Choice, Ranking, Recommendation:

  • Fred S Annexstein and Kenneth A Berman. Directional routing via generalized st-numberings. SIAM Journal on DiscreteMathematics,  13(2):268–279, 2000.

  • Fred S Annexstein, Kenneth A Berman, and Mijhalo A
    Jovanovic. Broadcasting in unstructured peer-to-peer overlay networks. Theoretical computer science, 355(1):25–36, 2006.

  • Mihajlo Jovanovic, Fred Annexstein, and Kenneth Berman. Modeling peer-to-peer network topologies through small-world models and power laws. In IX Telecommunications Forum, TELFOR, pages 1–4, 2001.

  • Michael T Helmick and Fred S Annexstein. Depth-latency tradeoffs in multicast tree algorithms. In Advanced Information Networking and Applications, 2007. AINA’07. 21st International Conference on, pages 555–564. IEEE, 2007.

  • Fred Annexstein, Kenneth A Berman, S Strunjas, and  Chad Yoshikawa. Maximizing throughput in minimum rounds in an application-level relay service. Workshop on algorithm engineering & experiments (ALENEX), 2007.


Combinatorial Computation in the Natural Sciences

  Computational Biology

  • Fred Annexstein and Ram Swaminathan. On testing consecutive ones property in parallel. Discrete Applied Mathematics, 88(1):7–28, 1998.

      Darwin’s Metaphors: 

Howard Gruber lists five main metaphors in the Origin: artificial selection, wedges, war, a tree, and a tangled bank. Each of these provide combinatorial computational pathways. For example, artificial selection is the idea most often associated with genetic algorithms, wedges and wars lead us to Conway’s game-of-life models, and trees and tangled banks provide models for dynamic network generation.

Computational phylogenetics and Molecular Sequencing

String and tree-based modeling and algorithms. DNA sequencing by hybridizationSequence assemblingGenome mapping; Sequence alignment

      Geo-Graphic Models

Population Growth Modeling
Modeling growth of biological objects
Computational models for cellular interactions

Parallel Computation

  • Lee Carraher, Philip Wilsey, and Fred Annexstein. A gpgpu algorithm for c-approximate r-nearest neighbor search in high dimensions. In IEEE International Symposium on Parallel and Distributed Processing, 2013.
  • Fred Annexstein, Marc Baumslag, and Arnold L Rosenberg. Group action graphs and parallel architectures. SIAM Journal on Computing, 19(3):544–569, 1990.
  • Fred S Annexstein. Book Chapter: Parallel implementations of graph embeddings. In Parallel Architectures and Their Efficient Use, pages 207–217. Springer, 1993.


K-12 Computer Science Education

  • Fred Annexstein. Everybody’s coding: A critique of math education and new tools for computer-oriented learning. HCESC Tech Academy Conference, 2013.


No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: