Turing universality of the game of life
P Rendell - Collision-based computing, 2002 - Springer
This chapter describes a Turing machine built from patterns in the Conway's Game of Life
cellular automaton. It outlines the architecture of the construction, the structure of its parts …
cellular automaton. It outlines the architecture of the construction, the structure of its parts …
Integer sorting in O (n/spl radic/(log log n)) expected time and linear space
Y Han, M Thorup - The 43rd Annual IEEE Symposium on …, 2002 - ieeexplore.ieee.org
We present a randomized algorithm sorting n integers in O (n/spl radic/(log log n)) expected
time and linear space. This improves the previous O (n log log n) bound by Anderson et …
time and linear space. This improves the previous O (n log log n) bound by Anderson et …
Virtual programming lab for online distance learning
In this paper, we describe the design of the WebVPL system, a Webbased Virtual
Programming Lab for on-line distance learning. The underlying setting is a collection of Lab …
Programming Lab for on-line distance learning. The underlying setting is a collection of Lab …
Optimal organizations for pipelined hierarchical memories
G Bilardi, K Ekanadham, P Pattnaik - Proceedings of the fourteenth …, 2002 - dl.acm.org
In a recent paper (SPAA'01), we have established that the Pipelined Hierarchical Random
Access Machine (PH-RAM) is a powerful model of computation, where most of the memory …
Access Machine (PH-RAM) is a powerful model of computation, where most of the memory …
On the efficiency of association-rule mining algorithms
V Pudi, JR Haritsa - Pacific-Asia Conference on Knowledge Discovery and …, 2002 - Springer
In this paper, we first focus our attention on the question of how much space remains for
performance improvement over current association rule mining algorithms. Our strategy is to …
performance improvement over current association rule mining algorithms. Our strategy is to …
Lower bounds for dynamic data structures on algebraic RAMs
Galil - Algorithmica, 2002 - Springer
In a seminal paper of 1989, Fredman and Saks proved lower bounds for some important
data-structure problems in the cell probe model. This model assumes that data structures …
data-structure problems in the cell probe model. This model assumes that data structures …
The Vega Grid and grid-based education
The Vega Grid and Grid-Based Education Page 1 J. Fong et al. (Eds.): ICWL 2002, LNCS
2436, pp. 228-238, 2002. Springer-Verlag Berlin Heidelberg 2002 The Vega Grid and …
2436, pp. 228-238, 2002. Springer-Verlag Berlin Heidelberg 2002 The Vega Grid and …
A Máquina geométrica: modelo computacional para concorrência e não-determinismo usando como estrutura espaços coerentes
RHS Reiser - 2002 - lume.ufrgs.br
O trabalho constitui-se numa investigação teórica da estrutura ordenada e intuitiva dos
espaços coerentes, introduzidos por Girard [GIR 86], na definição do modelo de máquina …
espaços coerentes, introduzidos por Girard [GIR 86], na definição do modelo de máquina …
[PDF][PDF] The formal method known as B and a sketch for its implementation
AJ Kaijanaho - 2002 - jyx.jyu.fi
ACM Categories and Subject Descriptors: F. 3.1 [Logics and Meanings of Programs]:
Specifying and Verifying and Reasoning about Programs—mechanical verification …
Specifying and Verifying and Reasoning about Programs—mechanical verification …
Parallel Processing Implications for Software Engineering
CG Murphy - Encyclopedia of Software Engineering, 2002 - Wiley Online Library
This article considers parallel systems to be a broader topic than the mapping of single
algorithms to parallel processors. This strategy allows for a discussion of general principles …
algorithms to parallel processors. This strategy allows for a discussion of general principles …