Result 1 to 20 of 30 total
Computations with uncertain time constraints: Effects on parallelism and universality. (English)
Calude, Cristian S. (ed.) et al., Unconventional computation. 10th international conference, UC 2011, Turku, Finland, June 6‒10, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21340-3/pbk). Lecture Notes in Computer Science 6714, 152-163 (2011).
1
Some accepting powers of three-dimensional parallel Turing machines. (English)
Artif. Life Robot. 13, No. 1, 27-30 (2008).
2
Three-dimensional parallel Turing machines. (English)
Artif. Life Robot. 13, No. 1, 364-367 (2008).
3
Accelerating machines: a review. (English)
Int. J. Parallel Emergent Distrib. Syst. 23, No. 1, 81-104 (2008).
4
Three counterexamples to dispel the myth of the universal computer. (English)
Parallel Process. Lett. 16, No. 3, 381-403 (2006).
5
Boolean functions and computation models. (English)
Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer-Verlag. xiv, 601 p. EUR 41.95 (net); sFr 72.00; \sterling 29.50; \$ 44.95 (2002).
6
Parallel machines. (English)
Minds Mach. 7, No. 4, 543-551 (1997).
7
parallel machines. (English)
Minds Mach. 7, No. 4, 543-551 (1997).
8
Parallel versus sequential processing of relational stimulus structures. (English)
Biol. Cybern. 71, No.6, 523-529 (1994).
9
Parallel random access machines with both multiplication and shifts. (English)
Inf. Comput. 110, No.1, 96-118 (1994).
10
A universal cellular automaton in quasi-linear time and its S-m-n form. (English)
Theor. Comput. Sci. 123, No.2, 199-237 (1994).
11
Multiplication, division, and shift instructions in parallel random access machines. (English)
Theor. Comput. Sci. 100, No.1, 1-44 (1992).
12
Sequential and parallel dynamics complexity in automata networks. (English)
Rev. Mat. Apl. 12, No.2, 103-106 (1991).
13
Computational models for feasible real analysis. (English)
Feasible mathematics, Proc. Math. Sci. Inst. Workshop, Ithaca/NY (USA) 1989, Prog. Comput. Sci. Appl. Log. 9, 221-237 (1990).
14
A Note on Nondeterminism in Small, Fast Parallel Computers. (English)
IEEE Transactions on Computers 38, No.05, 766-767 (1989).
15
Some subclasses of context-free languages in $NC\sp 1$. (English)
Inf. Process. Lett. 29, No.3, 111-117 (1988).
16
Parallel computation with threshold functions. (English)
J. Comput. Syst. Sci. 36, No.3, 278-302 (1988).
17
Randomization for more efficient algorithms. (English)
Stochastics in combinatorial optimization, Adv., Sch. CISM, Udine/Italy 1986, 52-75 (1987).
18
Parallel complexity theory. (English)
Research Notes in Theoretical Computer Science. London: Pitman; New York- Toronto: John Wiley \& Sons, Inc. XIII, 200 p.; \sterling 17.95 (1987).
19
An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits. (English)
Inf. Process. Lett. 24, 363-367 (1987).
20
Result 1 to 20 of 30 total
Start
Contact
Print
General Help
