Sciweavers

11345 search results - page 1667 / 2269
» Foundations of Computer Science
Sort
View
FM
2009
Springer
98views Formal Methods» more  FM 2009»
16 years 1 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
FSTTCS
2009
Springer
16 years 1 months ago
The Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
Jérémie Cabessa, Jacques Duparc, Ale...
FSTTCS
2009
Springer
16 years 1 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
FSTTCS
2009
Springer
16 years 1 months ago
On Timed Alternating Simulation for Concurrent Timed Games
We address the problem of alternating simulation refinement for concurrent timed games (TG). We show that checking timed alternating simulation between TG is EXPTIME-complete, and...
Laura Bozzelli, Axel Legay, Sophie Pinchinat
FSTTCS
2009
Springer
16 years 1 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
« Prev « First page 1667 / 2269 Last » Next »