Skip to search formSkip to main contentSemantic Scholar

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

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

2013

2013

We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

The reachability analysis of recursive programs that communicate
asynchronously over reliable FIFO channels calls for… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

We present a family of pairwise tournaments reducing k-class classification to binary classification. These reductions are… Expand

Is this relevant?

2002

2002

We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC… Expand

Is this relevant?

2000

2000

We describe a new approach for cluster-based drawing of large graphs, which obtains clusters by using binary space partition (BSP… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision… Expand

Is this relevant?

1995

1995

Abstract We present algorithms for five interdistance enumeration problems that take as input a set S of n points in R d (for a… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circuits. We prove that in the… Expand

Is this relevant?

1990

1990

Given a point set p, a chain is a subset C C p of points in which for any two points one is dominated by the other. A two-chain… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

This paper studies a restriction of one-dimensional bounded cellular automata in which information is allowed to move only in one… Expand

Is this relevant?