"Supporting People with Autism Spectrum Disorders in the Exploration of PoIs" is an example of work that takes seriously the task of supporting a small group that...Robin Burke From Communications of the ACM | February 2022
We propose a novel Top-N recommendation model that combines information about an autistic user's idiosyncratic aversions with her/his preferences in a personalized...Noemi Mauro, Liliana Ardissono, Federica Cena From Communications of the ACM | February 2022
In this work, we study a fourth modification to the notion of efficient verification that originates in the study of quantum entanglement.
Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen From Communications of the ACM | November 2021
"Multi-Itinerary Optimization as Cloud Service," by Alexandru Cristian et al., makes accessible an end-to-end cloud service that produces traffic-aware, real-time...Pascal Van Hentenryck From Communications of the ACM | November 2021
We describe multi-itinerary optimization, a novel Bing Maps service that automates the process of building itineraries for multiple agents while optimizing their...Alexandru Cristian, Luke Marshall, Mihai Negrea, Flavius Stoichescu, Peiwei Cao, Ishai Menache From Communications of the ACM | November 2021
We present the first approach for checking the internal validity of online experiments statically, that is, from code alone.
Emma Tosch, Eytan Bakshy, Emery D. Berger, David D. Jensen, J. Eliot B. Moss From Communications of the ACM | September 2021
"WINOGRANDE" explores new methods of dataset development and adversarial filtering, expressly designed to prevent AI systems from making claims of smashing through...Leora Morgenstern From Communications of the ACM | September 2021
We introduce WinoGrande, a large-scale dataset of 44k problems, inspired by the original Winograd Schema Challenge, but adjusted to improve both the scale and the...Keisuke Sakaguchi, Ronan Le Bras, Chandra Bhagavatula, Yejin Choi From Communications of the ACM | September 2021
The authors of "Succinct Range Filters" make a critical and insightful observation: For a given set of queries, the upper levels of the trie incur many more accesses...Stratos Idreos From Communications of the ACM | April 2021
We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests.
Huanchen Zhang, Hyeontaek Lim, Viktor Leis, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo From Communications of the ACM | April 2021
The approach taken in "BioScript," by Jason Ott, et al., is an example of how programming languages can help develop executable protocols that are conforming, understandable...Nada Amin From Communications of the ACM | February 2021
This paper introduces BioScript, a domain-specific language for programmable biochemistry that executes on emerging microfluidic platforms.
Jason Ott, Tyson Loveless, Chris Curtis, Mohsen Lesani, Philip Brisk From Communications of the ACM | February 2021
What is the right leak oracle that can precisely capture the behavior of leaks in Web applications? "BLeak: Automatically Debugging Memory Leaks in Web Applications...Harry Xu From Communications of the ACM | November 2020
This paper introduces BLeak (Browser Leak debugger), the first system for automatically debugging memory leaks in web applications.
John Vilk, Emery D. Berger From Communications of the ACM | November 2020
"MadMax: Analyzing the Out-of-Gas World of Smart Contracts," by Neville Grech et al., effectively discovers a new smart contract vulnerability, and proposes a detection...Benjamin Livshits From Communications of the ACM | October 2020
We identify gas-focused vulnerabilities and present MadMax: a static program analysis technique that automatically detects gas-focused vulnerabilities with very...Neville Grech, Michael Kong, Anton Jurisevic, Lexi Brent, Bernhard Scholz, Yannis Smaragdakis From Communications of the ACM | October 2020
There are few algorithms for multi-flow graphs beyond flow accumulation. The authors of "Flood-Risk Analysis on Terrains" take a big step to fill this knowledge...Shashi Shekhar From Communications of the ACM | September 2020
In this paper, we study a number of flood-risk related problems, give an overview of efficient algorithms for them, as well as explore the efficacy and efficiency...Aaron Lowe, Pankaj K. Agarwal, Mathias Rav From Communications of the ACM | September 2020