XRDS

Crossroads The ACM Magazine for Students

Sign In

Association for Computing Machinery

Articles Tagged: Design and analysis of algorithms

Articles & Features

Ultra-efficiency via sublinearity

DEPARTMENT: Blogs

Ultra-efficiency via sublinearity

The XRDS blog highlights a range of topics from security and privacy to neuroscience. Selected blog posts, edited for print, will be featured in every issue. Please visit xrds.acm.org/blog to read each post in its entirety.

By Samira Daruki, March 2014

PDF | HTML | In the Digital Library

Algorithms Fit for Compilation?

Algorithms Fit for Compilation?

Should there be a standard in the way of algorithms languages to improve productivity and remove ambiguity?

By Olivia Simpson, September 2013

PDF | HTML | In the Digital Library

Zero-knowledge Proofs

DEPARTMENT: Hello world

Zero-knowledge Proofs

By Marinka Zitnik, September 2013

PDF | HTML | In the Digital Library

Scientific computing

COLUMN: INIT

Scientific computing

By Nick Knight, Jack Poulson, March 2013

PDF | HTML | In the Digital Library

Expanders, tropical semi-rings, and nuclear norms

SECTION: Features

Expanders, tropical semi-rings, and nuclear norms

Scientific computing for social and modern information networks.

By David Gleich, March 2013

PDF | HTML | In the Digital Library

Invitation to complexity theory

Invitation to complexity theory

Complexity theory provides new viewpoints on various phenomena that were considered by past thinkers.

By Oded Goldreich, March 2012

PDF | HTML | In the Digital Library

The tale of the PCP theorem

The tale of the PCP theorem

How the search for the limits of computing led to the discovery of the unexpected power of proofs.

By Dana Moshkovitz, March 2012

PDF | HTML | In the Digital Library

Pseudorandomness and derandomization

The computational theory of pseudorandomness and cryptography.

By Luca Trevisan, March 2012

PDF | HTML | In the Digital Library

Why now is the right time to study quantum computing

Why now is the right time to study quantum computing

Quantum computing is not merely a recipe for new computing devices, but a new way of looking at the world.

By Aram Harrow, March 2012

PDF | HTML | In the Digital Library

Fighting censorship with algorithms

Fighting censorship with algorithms

By Mohammad Mahdian, December 2011

PDF | HTML | In the Digital Library

Data encryption

By Ed DeHart, September 2008

PDF | HTML | In the Digital Library

Introduction

By Justin Solomon, December 2007

PDF | HTML | In the Digital Library

On the complexity of Katamari Damacy

By Gregory M. Zaverucha, December 2007

PDF | HTML | In the Digital Library

Computational recreations

By Jonathan Doyle, September 2007

PDF | HTML | In the Digital Library

Interesting complexity

By Caio Camargo, December 2006

PDF | HTML | In the Digital Library

Challenges in systems biology

By David Sigfredo Angulo, September 2006

PDF | HTML | In the Digital Library

Levels of detail & polygonal simplification

This paper covers the techniques of Polygonal Simplification in order to produce Levels of Detail (LODs). The problem of creating LODs is a complex one: how can simpler versions of a model be created? How can the approximation error be measured? How can the visual degradation be estimated? Can all this be done automatically? After exposing the basic aims and principles of polygonal simplification, we compare recent algorithms and state their various qualities and weaknesses.

By Mike Krus, Patrick Bourdot, Françoise Guisnel, Gullaume Thibault, May 1997

PDF | HTML | In the Digital Library