The College of Computing has built a reputation for providing challenging courses and an overall rewarding academic experience at all levels. In the undergraduate program, the College awards bachelor's degrees in computer science, and in the graduate program, the College offers master's and doctoral degrees in computer science. The College offers an undergraduate certificate in Information Systems jointly with the DuPree College of Management and an undergraduate minor and undergraduate and graduate certificates in Cognitive Science jointly with the Schools of Psychology and Industrial and Systems Engineering.

Sub-communities within this community

Collections in this community

Recent Submissions


    Ma, Benson Jer-Tsung (Georgia Institute of Technology, 2018-12-04)
    Earlier studies by Chow and Skolnick suggest that the internal motions of bacterial DNA may be governed by strong forces arising from being crowded into the small space of the nucleoid, and that these internal motions ...
  • Incremental Design Revision in Biologically Inspired Design 

    Wiltgen, Bryan Joseph (Georgia Institute of Technology, 2018-11-09)
    Design is the process by which solutions get developed to solve social challenges, and its products can be seen across our world from toothbrushes to computers to spaceships. Conceptual design is an early phase of design ...
  • Interpretation, Grounding and Imagination for Machine Intelligence 

    Vedantam, Shanmukha Ramak (Georgia Institute of Technology, 2018-11-08)
    Understanding how to model computer vision and natural language jointly is a long-standing challenge in artificial intelligence. In this thesis, I study how modeling vision and language using semantic and pragmatic ...
  • The hourglass effect in source-target dependency networks 

    Sabrin, Kaeser M (Georgia Institute of Technology, 2018-11-13)
    Many hierarchically modular systems are structured in a way that resembles the shape of an hourglass: the system generates many outputs from many inputs through a relatively small number of intermediate modules that are ...
  • Optimization-Driven Emergence of Deep Hierarchies with Applications in Data Mining and Evolution 

    Siyari, Payam (Georgia Institute of Technology, 2018-11-09)
    It is well known that many complex systems, in both nature and technology, exhibit hierarchical modularity: smaller modules, each of them providing a certain function, are used within larger modules that perform more complex ...

    Zeagler, Charles Clinton (Georgia Institute of Technology, 2018-11-01)
    With the advent of commercially available heads-up-displays and other mobile information systems, there arises a need for on-body interfaces that can be used accurately and quickly without visual attention. In this ...
  • Constructing and Evaluating Executable Models of Collective Behavior 

    Hrolenok, Brian Paul (Georgia Institute of Technology, 2018-10-19)
    Multiagent simulation (MAS) can be a valuable tool for biologists and ethologists studying collective animal behavior. However, constructing models for simulation is often a time-consuming manual task. Current state-of-the-art ...
  • Extending 3D Reconstruction to Temporal and Multi-model Sensor Data for Precision Agriculture 

    Dong, Jing (Georgia Institute of Technology, 2018-09-12)
    Crop monitoring is one of the most important tasks in precision agriculture, and to reduce cost, such task is often performed autonomously by unmanned aerial and ground vehicles. To capture 3D geometric information about ...
  • EvalAI: Evaluating AI Systems at Scale 

    ., Deshraj (Georgia Institute of Technology, 2018-12-06)
    Artificial Intelligence research has progressed tremendously in the last few years. There has been the introduction of several new multi-modal datasets and tasks due to which it is becoming much harder to compare new ...
  • Hardness and Tractability for Structured Numerical Problems 

    Zhang, Peng (Georgia Institute of Technology, 2018-08-24)
    We study structured linear systems and structured linear programs (LPs) from both algorithm and complexity perspectives. These structured problems commonly arise in combinatorial optimization, machine learning, and operation ...
  • High Performance Computing algorithms for Discrete Optimization 

    Munguia Conejero, Lluis-Miquel M (Georgia Institute of Technology, 2017-11-03)
    This thesis concerns the application of High Performance Computing to Discrete Optimization, and the development of massively parallel algorithms designed to accelerate the solving process of Mixed-Integer Programs (MIPs). ...
  • Reducing Cognitive Load Through Reminders 

    Bartlett, Samuel Andrew (Georgia Institute of Technology, 2016)
    Describes an experiment using email to reduce students' cognitive load.
  • Discovering Metacognitive Approaches to Personal Finance with Intelligent Tutoring Systems 

    Tan, John (Georgia Institute of Technology, 2018-12-02)
    One of the most difficult challenges that young people are currently facing in today’s world is to make the right financial decisions in their daily life properly due to the lack in personal finance or has developed a poor ...
  • The polymorphic gateway between structure and algorithms: Beyond CSPs 

    Guruswami, Venkat (2018-12-03)
    What underlying mathematical structure (or lack thereof) in a computational problem governs its efficient solvability (or dictates its hardness)? In the realm of constraint satisfaction problems (CSPs), the algebraic ...
  • Bloom Filters, Cuckoo Hashing, Cuckoo Filters, Adaptive Cuckoo Filters, and Learned Bloom Filters 

    Mitzenmacher, Michael (2018-11-26)
    I will go over some of my past and present work on hashing-based data structures. After presenting some background on Bloom filters and cuckoo hashing, we will describe cuckoo filters, an efficient data structure for ...
  • From Immigrant to Entrepreneur and NBA Owner 

    Ranadivé, Vivek (2018-11-01)
    Vivek Ranadivé describes himself as a boy from Bombay – a boy who made his fortune digitizing Wall Street and providing real-time computing to the world’s largest companies. Now, the chairman of venture fund Bow Capital ...
  • Algorithmic Pirogov-Sinai theory 

    Perkins, Will (2018-11-05)
    We develop efficient algorithms to approximate the partition function and sample from the hard-core and Potts models on lattices at sufficiently low temperatures in the phase coexistence regime. In contrast, the Glauber ...
  • Fairness in Algorithmic Decision Making 

    Kannan, Sampath (2018-10-29)
    In this talk we survey some formulations of fairness requirements for decision making under uncertainty. We then discuss results from 3 recent papers: 1) Treating individuals fairly is not in conflict with long-term ...
  • The Paulsen problem, continuous operator scaling, and smoothed analysis 

    Lau, Lap Chi (2018-10-15)
    The Paulsen problem is a basic open problem in operator theory. We define a continuous version of the operator scaling algorithm to solve this problem. A key step is to show that the continuous operator scaling algorithm ...
  • Improved Decoding of Folded Reed-Solomon and Multiplicity Codes 

    Wootters, Mary (2018-10-01)
    List-decoding is an important primitive in the theory of error correcting codes, and it has long been a goal to obtain explicit constructions of capacity-achieving, efficiently list-decodable codes. Folded Reed-Solomon ...

View more