There's plenty of room at the Top: What will drive computer performance after Moore's law?

CE Leiserson, NC Thompson, JS Emer, BC Kuszmaul… - Science, 2020 - science.org
BACKGROUND Improvements in computing power can claim a large share of the credit for
many of the things that we take for granted in our modern lives: cellphones that are more …

[HTML][HTML] Social media data: Challenges, opportunities and limitations in urban studies

P Martí, L Serrano-Estrada… - … , Environment and Urban …, 2019 - Elsevier
Analysing the city through data retrieved from Location Based Social Networks (LBSNs) has
received considerable attention as a promising method for applied research. However, the …

Faster matrix multiplication via asymmetric hashing

R Duan, H Wu, R Zhou - 2023 IEEE 64th annual symposium on …, 2023 - ieeexplore.ieee.org
Fast matrix multiplication is one of the most fundamental problems in algorithm research.
The exponent of the optimal time complexity of matrix multiplication is usually denoted by ω …

A generalist neural algorithmic learner

B Ibarz, V Kurin, G Papamakarios… - Learning on graphs …, 2022 - proceedings.mlr.press
The cornerstone of neural algorithmic reasoning is the ability to solve algorithmic tasks,
especially in a way that generalises out of distribution. While recent years have seen a surge …

CS unplugged—how is it used, and does it work?

T Bell, J Vahrenhold - Adventures between lower bounds and higher …, 2018 - Springer
Abstract Computer Science Unplugged has been used for many years as a way to
communicate concepts from computer science to audiences in a variety of settings. Despite …

The clrs algorithmic reasoning benchmark

P Veličković, AP Badia, D Budden… - International …, 2022 - proceedings.mlr.press
Learning representations of algorithms is an emerging area of machine learning, seeking to
bridge concepts from neural networks with classical algorithms. Several important works …

Accountable algorithms

JA Kroll - 2015 - search.proquest.com
Important decisions about people are increasingly made by algorithms: Votes are counted;
voter rolls are purged; financial aid decisions are made; taxpayers are chosen for audits; air …

Pinocchio: Nearly practical verifiable computation

B Parno, J Howell, C Gentry, M Raykova - Communications of the ACM, 2016 - dl.acm.org
To instill greater confidence in computations outsourced to the cloud, clients should be able
to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built …

[HTML][HTML] Practical graph isomorphism, II

BD McKay, A Piperno - Journal of symbolic computation, 2014 - Elsevier
We report the current state of the graph isomorphism problem from the practical point of
view. After describing the general principles of the refinement-individualization paradigm …

[PDF][PDF] Discovre: Efficient cross-architecture identification of bugs in binary code.

S Eschweiler, K Yakdan, E Gerhards-Padilla - Ndss, 2016 - ndss-symposium.org
The identification of security-critical vulnerabilities is a key for protecting computer systems.
Being able to perform this process at the binary level is very important given that many …