Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

We present Rabinizer 4, a tool set for translating formulae of linear temporal logic to different types of deterministic \(\omega… Expand

Is this relevant?

2016

2016

Limit-deterministic Buchi automata can replace deterministic Rabin automata in probabilistic model checking algorithms, and can… Expand

Is this relevant?

Highly Cited

2016

Highly Cited

2016

Generative state estimators based on probabilistic filters and smoothers are one of the most popular classes of state estimators… Expand

Is this relevant?

Highly Cited

2014

Highly Cited

2014

Maintaining the reliability of integrated circuits as transistor sizes continue to shrink to nanoscale dimensions is a… Expand

Is this relevant?

2011

2011

Graph statesa[ 5 ] are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

We consider the numerical solution of elliptic boundary value problems in domains with random boundary perturbations. Assuming… Expand

Is this relevant?

1998

1998

Logic languages can deal with non-deterministic computations via built-in search facilities. However, standard search methods… Expand

Is this relevant?

1998

1998

An important objective of software fault tolerant systems should be to provide a fault-tolerance infrastructure in a manner that… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

This paper gives a full characterization of the time needed to compute a Boolean function on a CREW PRAM with an unlimited number… Expand

Is this relevant?

1984

1984

Abstract In this paper we study the computational complexity of sets of different densities in NP. We show that the deterministic… Expand

Is this relevant?