Sciweavers

69
Voted
TCS
1998
15 years 10 days ago
Near-Optimal, Distributed Edge Colouring via the Nibble Method
Devdatt P. Dubhashi, David A. Grable, Alessandro P...
70
Voted
TCS
1998
15 years 10 days ago
Parameterized Circuit Complexity and the W Hierarchy
Rodney G. Downey, Michael R. Fellows, Kenneth W. R...
101
Voted
TCS
1998
15 years 10 days ago
Threshold Dominating Sets and an Improved Characterization of W[2]
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
Rodney G. Downey, Michael R. Fellows
93
Voted
TCS
1998
15 years 10 days ago
Merit Factors and Morse Sequences
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
T. Downarowicz, Y. Lacroix
56
Voted
TCS
1998
15 years 10 days ago
The Quotient of an Abstract Interpretation
Agostino Cortesi, Gilberto Filé, William H....
62
Voted
TCS
1998
15 years 10 days ago
Counting Non-Isomorphic Chord Diagrams
Robert Cori, Michel Marcus
TCS
1998
15 years 10 days ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
45
Voted
TCS
1998
15 years 10 days ago
Open Maps, Behavioural Equivalences, and Congruences
Allan Cheng, Mogens Nielsen