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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Web Services have become more and more important in these years, and BPEL4WS is a de facto standard for the web service… 
Highly Cited
2005
Highly Cited
2005
In modern process control systems, Ethernet is achieving a leading position, proposing itself as a network capable of supporting… 
2000
2000
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable… 
1999
1999
A robot must often react to events in its environment and exceptional conditions by suspending or abandoning its current plan and… 
Highly Cited
1998
Highly Cited
1998
Introduction / George Bornstein and Theresa Tinkle -- Alfred the Great's burn Boethius / Kevin Kiernan -- Sensations of the page… 
Review
1996
Review
1996
Contents: Preface. R. Mazuka, N. Nagai, Japanese Sentence Processing: An Interdisciplinary Approach. A. Inoue, J.D. Fodor… 
1990
1990
1989
1989
The authors consider the essential properties of a multiparty interaction construct which serves as a primitive for interprocess… 
1984
1984
We study four kinds of protocols in distributed computing. Besides the case of deterministic protocols, we consider random…