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

2014

Highly Cited

2014

Computational and memory costs restrict spectral techniques to rather small graphs, which is a serious limitation especially in… Expand

Highly Cited

2012

Highly Cited

2012

One of the important Natural Language Processing applications is Text Summarization, which helps users to manage the vast amount… Expand

Highly Cited

2002

Highly Cited

2002

Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and… Expand

Highly Cited

2001

Highly Cited

2001

This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. S. Arnborg, B… Expand

Highly Cited

2000

Highly Cited

2000

Abstract The foundation of a process model lies in its structural specifications. Using a generic process modeling language for… Expand

Highly Cited

1999

Highly Cited

1999

We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The… Expand

Highly Cited

1993

Highly Cited

1993

We show how membership in classes of graphs definable in monadic second order logic and of bounded treewidth can be decided by… Expand

Highly Cited

1992

Highly Cited

1992

We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand

Highly Cited

1992

Highly Cited

1992

We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand

Highly Cited

1989

Highly Cited

1989

We present the -calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand