Go home now Header Background Image
Search
Subscription Submission Procedure Login
User: anonymous
 
 
 
 
 
Articles by Topics
Topic F. - Theory of Computation
Topic F.1 - COMPUTATION BY ABSTRACT DEVICES
Topic F.1.2 - Modes of Computation

T. Balanescu, A. J. Cowling, H. Georgescu, M. Gheorghe, M. Holcombe, C. Vertan:
Communicating Stream X-Machines Systems are no more than X-Machines
/jucs_5_9/communicating_stream_x_machines
page 494 - 507
Vol.5 / Issue 9
J. Blõmer:
Randomness and Secrecy - A Brief Introduction
/jucs_12_6/randomness_and_secrecy_a
page 654 - 671
Vol.12 / Issue 6
V. Bosserhoff:
Notions of Probabilistic Computability on Represented Spaces
/jucs_14_6/notions_of_probabilistic_computability
page 956 - 995
Vol.14 / Issue 6
J. Bravo, R. Hervás, G. Chavira:
Ubiquitous Computing in the Classroom: An Approach through Identification Process
/jucs_11_9/ubiquitous_computing_in_the
page 1494 - 1504
Vol.11 / Issue 9
E. Börger:
The Origins and the Development of the ASM Method for High Level System Design and Analysis
/jucs_8_1/the_origins_and_the
page 2 - 74
Vol.8 / Issue 1
H. Georgescu, C. Vertan:
A New Approach to Communicating X-Machines Systems
/jucs_6_5/a_new_approach_to
page 490 - 502
Vol.6 / Issue 5
Y. Gurevich, M. Spielmann:
Recursive Abstract State Machines
/jucs_3_4/recursiv_abstract
page 233 - 246
Vol.3 / Issue 4
Y. Gurevich, N. Tillmann:
Partial Updates: Exploration
/jucs_7_11/partial_updates_exploration
page 917 - 951
Vol.7 / Issue 11
H. Hempel:
Randomized Algorithms and Complexity Theory
/jucs_12_6/randomized_algorithms_and_complexity
page 746 - 761
Vol.12 / Issue 6
V. Leppaenen:
On Implementing EREW Work-Optimally on Mesh of Trees
/jucs_1_1/on_implementing_erew_work
page 23 - 34
Vol.1 / Issue 1
T. Riege, J. Rothe:
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
/jucs_12_6/improving_deterministic_and_randomized
page 725 - 745
Vol.12 / Issue 6
T. Riege, J. Rothe:
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey
/jucs_12_5/completenes_in_the_boolean
page 551 - 578
Vol.12 / Issue 5
M. Viroli, A. Omicini:
Modelling Agents as Observable Sources
/jucs_8_4/modelling_agents_as_observable
page 423 - 451
Vol.8 / Issue 4
D. de Frutos Escrig, C.G. Rodríguez:
Process Equivalences as Global Bisimulations
/jucs_12_11/process_equivalences_as_global
page 1521 - 1550
Vol.12 / Issue 11