URI: http://hdl.handle.net/2144/1239

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.

News

Department chair: Mark Crovella
Campus address: 111 Cummington Mall, Room 138
Phone: 617-353-8919
Fax: 617-353-6457
Website: www.bu.edu/cs

Collections in this community

Recently Added

  • Linear arrangement of Halin graphs 

    Kfoury, Assaf; Mirzaei, Saber (Computer Science Department, Boston University, 2015-09-01)
    We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin graphs. We prove a lower bound on the cost ...
  • Programming support for an integrated multi-party computation and MapReduce infrastructure 

    Volgushev, Nikolaj; Lapets, Andrei; Bestavros, Azer (Computer Science Department, Boston University, 2015-09-01)
    We describe and present a prototype of a distributed computational infrastructure and associated high-level programming language that allow multiple parties to leverage their own computational resources capable of supporting ...
  • Minimum average delay of routing trees 

    Mirzaei, Saber (Computer Science Department, Boston University, 2016-01-11)
    The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case ...
  • The effect of competition among brokers on the quality and price of differentiated internet services 

    Ghasemi, Maryam; Matta, Ibrahim; Esposito, Flavio (Computer Science Department, Boston University, 2016-10-04)
    Price war, as an important factor in undercutting competitors and attracting customers, has spurred considerable work that analyzes such conflict situation. However, in most of these studies, quality of service (QoS), as ...
  • What’s in it for me? Incentive-compatible route coordination of crowdsourced resources 

    Bassem, Christine; Bestavros, Azer (Computer Science Department, Boston University, 2016-03-30)
    With the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresence-capable systems has expanded to include already roaming devices, such ...
  • Secure multi-party computation for analytics deployed as a lightweight web application 

    Lapets, Andrei; Volgushev, Nikolaj; Bestavros, Azer; Jansen, Frederick; Varia, Mayank (Computer Science Department, Boston University, 2016-07-25)
    We describe the definition, design, implementation, and deployment of a secure multi-party computation protocol and web application. The protocol and application allow groups of cooperating parties with minimal expertise ...
  • A recursive approach to network management 

    Wang, Yuefeng; Matta, Ibrahim (Computer Science Department, Boston University, 2015-12-14)
    Nowadays there is an increasing need for a general management paradigm which can simplify network management and further enable network innovations. In this paper, in response to limitations of current Software Defined ...
  • PROVIDE: hiding from automated network scans with proofs of identity 

    Koch, William; Bestavros, Azer (Computer Science Department, Boston University, 2016-07-01)
    Network scanners are a valuable tool for researchers and administrators, however they are also used by malicious actors to identify vulnerable hosts on a network. Upon the disclosure of a security vulnerability, scans are ...
  • Shortest path and maximum flow problems in planar flow networks with additive gains and losses 

    Mirzaei, Saber; Kfoury, Assaf (Computer Science Department, Boston University, 2016-03-29)
    In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e. Hence, if a flow f(e) enters the edge e ...
  • Rational coordination of crowdsourced resources for geo-temporal request satisfaction 

    Bassem, Christine; Bestavros, Azer (Computer Science Department, Boston University, 2015-03-23)
    Existing mobile devices roaming around the mobility field should be considered as useful resources in geo-temporal request satisfaction. We refer to the capability of an application to access a physical device at particular ...
  • Managing NFV using SDN and control theory 

    Akhtar, Nabeel; Matta, Ibrahim; Wang, Yuefeng (Computer Science Department, Boston University, 2015-12-14)
    Control theory and SDN (Software Defined Networking) are key components for NFV (Network Function Virtualization) deployment. However little has been done to use a control-theoretic approach for SDN and NFV management. In ...
  • Application-driven network management with ProtoRINA 

    Wang, Yuefeng; Matta, Ibrahim; Akhtar, Nabeel (Computer Science Department, Boston University, 2015-03-31)
    Traditional network management is tied to the TCP/IP architecture, thus it inherits its many limitations, e.g., static management and one-size-fits-all structure. Additionally there is no unified framework for application ...
  • Hyp3rArmor: reducing web application exposure to automated attacks 

    Koch, William; Bestavros, Azer (Computer Science Department, Boston University, 2016-11-11)
    Web applications (webapps) are subjected constantly to automated, opportunistic attacks from autonomous robots (bots) engaged in reconnaissance to discover victims that may be vulnerable to specific exploits. This is a ...
  • Incentive compatible route coordination of crowdsourced resources and its application to GeoPresence-as-a-Service 

    Bassem, Christine; Bestavros, Azer (Computer Science Department, Boston University, 2015-04-14)
    With the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresen- ce-capable systems has expanded to include already roaming devices, such ...
  • Web-based multi-party computation with application to anonymous aggregate compensation analytics 

    Lapets, Andrei; Dunton, Eric; Holzinger, Kyle; Jansen, Frederick; Bestavros, Azer (Computer Science Department, Boston University, 2015-08-15)
    We describe the definition, design, implementation, and deployment of a multi-party computation protocol and supporting web-based infrastructure. The protocol and infrastructure constitute a software application that allows ...
  • Efficient reassembling of graphs, part 1: The linear case 

    Kfoury, Assaf; Mirzaei, Saber (Computer Science Department, Boston University, 2015-08-10)
    The reassembling of a simple connected graph G = (V, E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: (1) We cut every edge of G into two halves, ...
  • Linux XIA: an interoperable meta network architecture to crowdsource the future Internet 

    Machado, Michel; Doucette, Cody; Byers, John (Computer Science Department, Boston University, 2015-01-30)
    With the growing number of proposed clean-slate redesigns of the Internet, the need for a medium that enables all stakeholders to participate in the realization, evaluation, and selection of these designs is increasing. ...
  • Scather: programming with multi-party computation and MapReduce 

    Volgushev, Nikolaj; Lapets, Andrei; Bestavros, Azer (Computer Science Department, Boston University, 2015-08-29)
    We present a prototype of a distributed computational infrastructure, an associated high level programming language, and an underlying formal framework that allow multiple parties to leverage their own cloud-based computational ...
  • EbbRT: a framework for building per-application library operating systems 

    Schatzberg, Dan; Cadden, James; Dong, Han; Krieger, Orran; Appavoo, Jonathan (Computer Science Department, Boston University, 2016-02-23)
    Efficient use of high speed hardware requires operating system components be customized to the application work- load. Our general purpose operating systems are ill-suited for this task. We present EbbRT, a framework for ...
  • EbbRT: a customizable operating system for cloud applications 

    Schatzberg, Dan; Cadden, James; Dong, Han; Krieger, Orran; Appavoo, Jonathan (Computer Science Department, Boston University, 2015-06-28)
    Efficient use of hardware requires operating system components be customized to the application workload. Our general purpose operating systems are ill-suited for this task. We present Genesis, a new operating system that ...

View more