About

Anne Rogers is an Associate Professor of Computer Science at the University of Chicago. She is the co-founder and current Academic Director of the Computational Analysis and Public Policy Masters Program (MSCAPP), a joint effort between the Harris School of Public Policy and the Department of Computer Science. Her research focuses on systems research, including the design and analysis of computing systems such as cloud, edge, Internet, quantum, and beyond. She is involved with the Systems Group, a vibrant and collaborative research community with diverse interests spanning systems, programming languages, and software engineering, as well as hardware. Anne Rogers received the Llewellyn John and Harriet Manchester Quantrell Award for Excellence in Undergraduate Teaching in 2010, along with other honors such as the Arthur L. Kelly faculty prize in 2014 and the AT&T outstanding new mentor award in 2001.

Research topics

• Computer science
• Optics
• Materials science
• Parallel computing
• Programming language

Selected publications

• Association between Perceived Discrimination in Healthcare Settings and HIV Medication Adherence: Mediating Psychosocial Mechanisms

  UNC Libraries · 2023-12-13

  articleOpen access
  PublisherDOI

• Open access to software developed for this research programme

  2017-01-01

  article
  Publisher

• Hancock: A Language for Analyzing Transactional Data Streams

  Data-centric systems and applications · 2016-01-01 · 3 citations

  book-chapter
  PublisherDOI

• Database search strategy

  2014-12-01

  article
  Publisher

• Limiting Radiation Exposure During Percutaneous Nephrolithotomy

  Journal of Endourology · 2014-11-25 · 15 citations

  article

  BACKGROUND AND PURPOSE: An increase in the prevalence of urologic stone disease and the refinement of endourologic techniques has seen a concomitant rise in the use of fluoroscopy during surgery. As such, there has been increasing concern in regard to the intraoperative radiation exposure to both clinicians and patients. The objective of the study was to audit contemporary data on radiation exposure during percutaneous nephrolithotomy (PCNL), in comparison with published series, and demonstrate that relatively low levels are achievable with clinical vigilance and attention to technique Methods: A retrospective analysis was performed of all PCNLs undertaken between July 2005 and December 2011. The primary outcome measure was fluoroscopy times and associated radiation exposure, measured as dose area product (DAP). No statistical analysis was undertaken. RESULTS: Between July 2005 and October 2011, 376 PCNLs were performed. Data were available on 348 patients including 16 pediatric patients. Mean DAP and screening time (ST) over the whole study period were 45 cGy/cm(2) and 96s, respectively. On a year by year basis, the ST and DAP reduced from 917 to 375 and from 180 to 65, respectively. We acknowledge the limitation of this being a retrospective case series. CONCLUSIONS: This study represents the largest series to date on radiation exposure during PCNL and compares favorably with other published series, including those purporting novel techniques. Subtle changes in surgical technique and experience over time can lead to low screening times and can be potentially achieved by all operators performing PCNL within a high throughput center. It is now recognized that surgical outcome in stone surgery is related to caseload. The radiation dose the patient receives during PCNL is increasingly recognized to be an important factor and can be reduced by careful technique and experience.

  PublisherDOI

• In search of simplicity: a self‐organizing group communication overlay

  Concurrency and Computation Practice and Experience · 2009-11-17 · 2 citations

  articleSenior author

  Abstract Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end‐nodes and variable network characteristics. Most solutions proposed to date rely on complex algorithms or on global information, thus limiting the scale of deployments and acceptance outside the academic realm. This article introduces a low‐complexity, self‐organizing solution for building and maintaining data dissemination trees, which we refer to as Unstructured Multi‐source Overlay (UMO). UMO uses traditional distributed systems techniques: layering, soft‐state, and passive data collection to adapt to the dynamics of the physical network and maintain data dissemination trees. The result is a simple, adaptive system with lower overheads than more complex alternatives. We implemented UMO and evaluated it on a 100‐node PlanetLab testbed and on up to 1024‐node emulated ModelNet networks. Extensive experimental evaluations demonstrate UMOs low overhead, efficient network usage compared with alternative solutions, and the ability to quickly adapt to network changes and to recover from failures. Copyright © 2009 John Wiley & Sons, Ltd.

  PublisherDOI

• Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems

  SIAM Journal on Computing · 2008-01-01 · 77 citations

  article

  We present linear-time algorithms for the classic problem of finding dominators in a flowgraph, and for several other problems whose solutions require evaluating a function defined on paths in a tree. Although all these problems had linear-time solutions previously, our algorithms are simpler, in some cases substantially. Our improvements come from three new ideas: a refined analysis of path compression that gives a linear bound if the compressions favor certain nodes; replacement of random-access table look-up by a radix sort; and a more careful partitioning of a tree into easily managed parts. In addition to finding dominators, our algorithms find nearest common ancestors off-line, verify and construct minimum spanning trees, do interval analysis of a flowgraph, and build the component tree of a weighted tree. Our algorithms do not require the power of a random-access machine; they run in linear time on a pointer machine. The genesis of our work was the discovery of a subtle error in the analysis of a previous allegedly linear-time algorithm for finding dominators. That algorithm was an attempt to simplify a more complicated algorithm, which itself was intended to correct errors in a yet earlier algorithm. Our work provides a systematic study of the subtleties in the dominators problem, the techniques needed to solve it in linear time, and the range of application of the resulting methods. We have tried to make our techniques as simple and as general as possible and to understand exactly how earlier approaches to the dominators problem were either incorrect or overly complicated.

  PublisherDOI

• Lazy Contract Checking for Immutable Data Structures

  Lecture notes in computer science · 2008-01-01 · 37 citations

  book-chapterSenior author
  PublisherDOI

• In Search of Simplicity: A Self-Organizing Multi-Source Multicast Overlay

  ArXiv.org · 2007-02-27 · 5 citations

  preprintOpen accessSenior author

  Multicast communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end nodes and variable network characteristics. Most solutions proposed to date rely on complex algorithms or global information, thus limiting the scale of deployments and acceptance outside the academic realm. This article introduces a low-complexity, self organizing solution for maintaining multicast trees, that we refer to as UMM (Unstructured Multi-source Multicast). UMM uses traditional distributed systems techniques: layering, soft-state, and passive data collection to adapt to the dynamics of the physical network and maintain data dissemination trees. The result is a simple, adaptive system with lower overheads than more complex alternatives. We have implemented UMM and evaluated it on a 100-node PlanetLab testbed and on up to 1024-node emulated ModelNet networks Extensive experimental evaluations demonstrate UMM's low overhead, efficient network usage compared to alternative solutions, and ability to quickly adapt to network changes and to recover from failures.

  PublisherOA PDFDOI

• In Search of Simplicity: A Self-Organizing Group Communication Overlay

  2007-07-01 · 12 citations

  articleSenior author

  Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end-nodes and variable network characteristics. Most solutions proposed to date rely on complex algorithms or global information, thus limiting the scale of deployments and acceptance outside the academic realm. This article introduces a low-complexity, self-organizing solution for maintaining multicast trees, that we refer to as UMM (unstructured multi-source multicast). UMM uses traditional distributed systems techniques: layering, soft-state, and passive data collection to adapt to the dynamics of the physical network and maintain data dissemination trees. The result is a simple, adaptive system with lower overheads than more complex alternatives. We have implemented UMM and evaluated it on up to 1024-node emulated ModelNet networks and on the PlanetLab testbed.. Extensive experimental evaluations and quantitative comparisons with alternative solutions demonstrate VMM's low overhead, efficient network usage, and ability to quickly adapt to network changes and to recover from failures.

  PublisherDOI

Frequent coauthors

• V.A. Handerek

  17 shared

• M. Farhadiroushan

  12 shared

• F. Parvaneh

  10 shared

• Jin Xu

  Yantai University

  10 shared

• Jinmei Yao

  National University of Defense Technology

  10 shared

• R. Thomas

  Freie Universität Berlin

  9 shared

• R. Reced

  University of London

  9 shared

• Frederick Smith

  MathWorks (United States)

  7 shared

Labs

• Research Labs & GroupsPI

Awards & honors

• Llewellyn John and Harriet Manchester Quantrell Award for Ex…
• Arthur L. Kelly faculty prize (2014)
• AT&T outstanding new mentor award (2001)
• Best paper award, KDD (2000)