Sciweavers

2473 search results - page 197 / 495
» The Logic of Communication Graphs
Sort
View
149
Voted
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 1 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
197
Voted
PPOPP
2010
ACM
16 years 1 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
FM
2009
Springer
134views Formal Methods» more  FM 2009»
15 years 1 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
144
Voted
ICALP
2007
Springer
15 years 10 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
143
Voted
TAMC
2010
Springer
15 years 9 months ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann