Sciweavers

4940 search results - page 18 / 988
» On the Complexity of Universal Programs
Sort
View
TCS
2011
13 years 2 months ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard
IPPS
2007
IEEE
14 years 1 months ago
STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
Michel Dubois, Hyunyoung Lee, Lan Lin
ENTCS
2007
108views more  ENTCS 2007»
13 years 7 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
ICALP
2010
Springer
13 years 9 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...

Book
630views
15 years 5 months ago
Introduction to Functional Programming
"These are the lecture notes accompanying the course Introduction to Functional Programming, which I taught at Cambridge University in the academic year 1996/1997."
John Harrison