scientific article
From MaRDI portal
Publication:4040986
zbMath0702.68055MaRDI QIDQ4040986
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (10)
Collectives of automata in labyrinths ⋮ Navigation Without Perception of Coordinates and Distances ⋮ Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers ⋮ Building a nest by an automaton ⋮ Derandomizing random walks in undirected graphs using locally fair exploration strategies ⋮ Setting port numbers for fast graph exploration ⋮ Impact of memory size on graph exploration capability ⋮ Unnamed Item ⋮ Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers ⋮ Graph exploration by a finite automaton
This page was built for publication: