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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
In recent years, there has been major interest in the exposure to physical therapy during rehabilitation. Several publications… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38… (More)
  • figure 7
Is this relevant?
2011
2011
We introduce nondeterministic streaming string transducers (NSSTs) { a new computational model that can implement MSO-definable… (More)
  • figure 3.1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The temporal logics pCTL and pCTL* have been proposed as tools for the formal speci cation and veri cation of probabilistic… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We study the problem of uniquely identifying the initial state of a given finite-state machine from among a set of possible… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The principal aim of this paper is to give an analysis of some recent combinatorial theories of computer security from the… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Abstract relational algebra is proposed as a practical means to describe the denotational semantics of programming languages. We… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations… (More)
Is this relevant?