Skip to search formSkip to main contentSkip to account menu

Nondeterministic algorithm

Known as: Non-deterministic algorithm 
In computer science, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Advice (complexity)AlgorithmAsymptotic computational complexityCommunicating sequential processes

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Improved Genetic Algorithms Based Path planning of Mobile Robot Under Dynamic Unknown Environment
Aiming at path planning of mobile robot under part of dynamic unknown environment, there are some shortages in the aspects of… 
Highly Cited
2005
Highly Cited
2005
Improving the real-time behavior of ethernet networks using traffic smoothing
In modern process control systems, Ethernet is achieving a leading position, proposing itself as a network capable of supporting… 
Highly Cited
2004
Highly Cited
2004
Balanced-budget rules and macroeconomic (in)stability
Highly Cited
2004
Highly Cited
2004
Fault-tolerant grid services using primary-backup: feasibility and performance
The combination of grid technology and Web services has produced an attractive platform for deploying distributed applications… 
Highly Cited
2002
Highly Cited
2002
Instruction stream mutation for non-deterministic processors
Differential power analysis (DPA) has become a real-world threat to the security of cryptographic hardware devices such as smart… 
Highly Cited
1998
Highly Cited
1998
The iconic page in manuscript, print, and digital culture
Introduction / George Bornstein and Theresa Tinkle -- Alfred the Great's burn Boethius / Kevin Kiernan -- Sensations of the page… 
Highly Cited
1993
Highly Cited
1993
FASTUS: A System for Extracting Information from Text
FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting… 
Highly Cited
1991
Highly Cited
1991
Goethe : the poet and the Age
Part 1 Germany in the 18th century: the age of Goethe? princes, pietists and professors the literary context to 1770. Part 2… 
1988
1988
Axiomatising Finite Concurrent Processes
  • M. Hennessy
  • SIAM journal on computing (Print)
  • 1988
  • Corpus ID: 42805640
We re-examine the well-known observational equivalence between processes with a view to modifying it so as to distinguish between… 
Highly Cited
1985
Highly Cited
1985
Discovering Patterns in Sequences of Events
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)