Sciweavers

20 search results - page 2 / 4
» jcss 2010
Sort
View
92
Voted
JCSS
2010
68views more  JCSS 2010»
14 years 10 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
Joachim Wehler
68
Voted
JCSS
2010
77views more  JCSS 2010»
14 years 10 months ago
Isomorphism and canonization of tournaments and hypertournaments
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks ...
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
100
Voted
JCSS
2010
155views more  JCSS 2010»
14 years 10 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
Michael Dom, Jiong Guo, Rolf Niedermeier
86
Voted
JCSS
2010
102views more  JCSS 2010»
14 years 10 months ago
Matching and alpha-equivalence check for nominal terms
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
Christophe Calvès, Maribel Fernández
94
Voted
JCSS
2010
69views more  JCSS 2010»
14 years 10 months ago
On the formal semantics of IF-like logics
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in...
Santiago Figueira, Daniel Gorín, Rafael Gri...