Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

Highly Cited

2012

Highly Cited

2012

In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety… Expand

Highly Cited

2011

Highly Cited

2011

We describe an algorithm for approximate inference in graphical models based on Holder's inequality that provides upper and lower… Expand

Highly Cited

2006

Highly Cited

2006

In this correspondence, we present a method for constructing sparse matrices that have a compact description and whose associated… Expand

Highly Cited

2005

Highly Cited

2005

Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine… Expand

2005

2005

We study the problem of covering graphs with trees and a graph of bounded maximum degree. By a classical theorem of Nash-Williams… Expand

Highly Cited

2005

Highly Cited

2005

The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative… Expand

2000

2000

In a projective space PG(n, q) a quasi-quadric is a set of points that has the same intersection numbers with respect to… Expand

Highly Cited

1999

Highly Cited

1999

We analyze the model-checking problems for safety and liveness properties in parameterized broadcast protocols. We show that the… Expand

1985

1985

Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine… Expand

Highly Cited

1976

Highly Cited

1976

Abstract It is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by… Expand