Share to FacebookShare to TwitterShare by Email

The Department of Computer Science has a distinguished track record of academic excellence and major achievement in an increasingly vital field that is expanding at a rapid pace. Faculty research is published in the most prominent venues and recognized by significant citations and awards, both national and international. BA, MS, and PhD students are recruited for internships and positions by such industry-leading firms as Motorola Labs, Google, and Microsoft, and are also recruited as PhD students, postdoctoral researchers, and tenure-track professors by some of the best computer science departments in the country.


Department chair: Mark Crovella
Campus address: 111 Cummington Mall, Room 138
Phone: 617-353-8919
Fax: 617-353-6457

Collections in this community

Recently Added

  • Reinforcement learning for UAV attitude control 

    Koch, William; Mancuso, Renato; West, Richard; Bestavros, Azer (2018)
    Autopilot systems are typically composed of an "inner loop" providing stability and control, while an "outer loop" is responsible for mission-level objectives, e.g. way-point navigation. Autopilot systems for UAVs are ...
  • Active network alignment: A matching-based approach 

    Malmi, Eric; Gionis, Aristides; Terzi, Evimaria (2017)
    Network alignment is the problem of matching the nodes of two graphs, maximizing the similarity of the matched nodes and the edges between them. This problem is encountered in a wide array of applications---from biological ...
  • Finding low-tension communities 

    Galbrun, Esther; Gionis, Aristides; Golshan, Behzad; Terzi, Evimaria (2017-11-06)
    Motivated by applications that arise in online social media and collaboration networks, there has been a lot of work on community-search and team-formation problems. In the former class of problems, the goal is to find a ...
  • Community-aware network sparsification 

    Gionis, Aristides; Tatti, Nikolaj; Rozenshtein, Polina; Terzi, Evimaria (2017-06-11)
    Network sparsification aims to reduce the number of edges of a network while maintaining its structural properties; such properties include shortest paths, cuts, spectral measures, or network modularity. Sparsification has ...
  • Opinion dynamics with varying susceptibility to persuasion 

    Tsourakakis, Charalampos; Kleinberg, Jon; Parkes, David; Abebe, Rediet
    A long line of work in social psychology has studied variations in people's susceptibility to persuasion -- the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an ...
  • Workload characterization of the shared/buy-in computing cluster at Boston University 

    Klausner, Yonatan; Liao, Christopher; Simhon, Eran; Bestavros, Azer; Starobinski, D. (2016)
    Computing clusters provide a complete environment for computational research, including bio-informatics, machine learning, and image processing. The Shared Computing Cluster (SCC) at Boston University is based on a ...
  • Algorithmic tests and randomness with respect to a class of measures 

    Bienvenu, Laurent; Gacs, Peter; Hoyrup, Mathieu; Rojas, Cristobal; Shen, Alexander (MAIK NAUKA/INTERPERIODICA/SPRINGER, 2011-10-01)
    This paper offers some new results on randomness with respect to classes of measures, along with a didactic exposition of their context based on results that appeared elsewhere. We start with the reformulation of the ...
  • Uniform test of algorithmic randomness over a general space 

    Gacs, Peter (Elsevier Science BV, 2005-09-05)
    The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. ...
  • Clairvoyant embedding in one dimension 

    Gacs, Peter (Wiley-Blackwell, 2015-10-01)
    Let v, w be infinite 0‐1 sequences, and urn:x-wiley:10429832:media:rsa20551:rsa20551-math-0001 a positive integer. We say that urn:x-wiley:10429832:media:rsa20551:rsa20551-math-0002 is urn:x-wiley:10429832:media:rsa20551 ...
  • Compatible sequences and a slow Winkler percolation 

    Gacs, Peter (Cambridge University Press, 2004-11-01)
    Two infinite 0–1 sequences are called compatible when it is possible to cast out $0\,$s from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two ...

View more