Issue Downloads
Advancing in the technical hierarchy
The Communications website, http://cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish selected posts or excerpts.
Follow us on Twitter at http://twitter.com/blogCACM
http:/...
Formalizing fairness
Algorithmic fairness aims to remedy issues stemming from algorithmic bias.
Crossing the uncanny valley
The "uncanny valley effect" may be holding back the field of robotics.
Neurotechnology and the law
How closely should implants be regulated?
Why universities must resist GPA-based enrollment caps in the face of surging enrollments
Considering the challenges for universities to adapt their business models to changing student demands.
When should a black box be transparent?
When is a replacement not a replacement?
An interview with Dana Scott
ACM Fellow and A.M. Turing Award recipient Dana Scott reflects on his career.
Transforming science through cyberinfrastructure
NSF's vision for the U.S. cyberinfrastructure ecosystem for science and engineering in the 21st century.
Computational thinking in the era of data science
Incorporating data thinking into computer science education.
FPGAs in client compute hardware
Despite certain challenges, FPGAs provide security and performance benefits over ASICs.
Advances in the quantum internet
A deep dive into the quantum Internet's potential to transform and disrupt.
The dawn of crowdfarms
- Yihong Wang,
- Konstantinos Papangelis,
- Ioanna Lykourentzou,
- Vassilis-Javed Khan,
- Michael Saker,
- Yong Yue,
- Jonathan Grudin
Some small companies are making crowdwork part of their formal business via teams that can complete multifaceted, complex tasks requiring specialized expertise.
The Seattle report on database research
- Daniel Abadi,
- Anastasia Ailamaki,
- David Andersen,
- Peter Bailis,
- Magdalena Balazinska,
- Philip A. Bernstein,
- Peter Boncz,
- Surajit Chaudhuri,
- Alvin Cheung,
- Anhai Doan,
- Luna Dong,
- Michael J. Franklin,
- Juliana Freire,
- Alon Halevy,
- Joseph M. Hellerstein,
- Stratos Idreos,
- Donald Kossmann,
- Tim Kraska,
- Sailesh Krishnamurthy,
- Volker Markl,
- Sergey Melnik,
- Tova Milo,
- C. Mohan,
- Thomas Neumann,
- Beng Chin Ooi,
- Fatma Ozcan,
- Jignesh Patel,
- Andrew Pavlo,
- Raluca Popa,
- Raghu Ramakrishnan,
- Christopher Re,
- Michael Stonebraker,
- Dan Suciu
Every five years, a group of the leading database researchers meet to reflect on their community's impact on the computing industry as well as examine current research challenges.
Sampling near neighbors in search for fairness
Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points S and a radius parameter r > 0, the r-near neighbor (r-NN) problem asks for a data structure that, given any query point q, ...
hXDP: Efficient software packet processing on FPGA NICs
- Marco Spaziani Brunella,
- Giacomo Belocchi,
- Marco Bonola,
- Salvatore Pontarelli,
- Giuseppe Siracusano,
- Giuseppe Bianchi,
- Aniello Cammarano,
- Alessandro Palumbo,
- Luca Petrucci,
- Roberto Bifulco
The network interface cards (NICs) of modern computers are changing to adapt to faster data rates and to help with the scaling issues of general-purpose CPU technologies. Among the ongoing innovations, the inclusion of programmable accelerators on the ...
The Luce Goose: a space-traveling bail-bond agent and the ship's resourceful AI chase fugitives across the galaxy
From the intersection of computational science and technological speculation, with boundaries limited only by our ability to imagine what could be.
