Works matching IS 01290541 AND DT 2010 AND VI 21 AND IP 3
Results: 14
PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 257, doi. 10.1142/S0129054110007234
- By:
- Publication type:
- Article
THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 277, doi. 10.1142/S0129054110007246
- By:
- Publication type:
- Article
THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 289, doi. 10.1142/S0129054110007258
- By:
- Publication type:
- Article
COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 311, doi. 10.1142/S012905411000726X
- By:
- Publication type:
- Article
SETS OF K-INDEPENDENT STRINGS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 321, doi. 10.1142/S0129054110007271
- By:
- Publication type:
- Article
INCREMENTAL CHECKPOINT SCHEMES FOR WEIBULL FAILURE DISTRIBUTION.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 329, doi. 10.1142/S0129054110007283
- By:
- Publication type:
- Article
COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 345, doi. 10.1142/S0129054110007295
- By:
- Publication type:
- Article
MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE:: AN FPTAS USING QUADRATIC KNAPSACK.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 357, doi. 10.1142/S0129054110007301
- By:
- Publication type:
- Article
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 385, doi. 10.1142/S0129054110007313
- By:
- Publication type:
- Article
ON THE PERFORMANCE AND COST OF SOME PRAM MODELS ON CMP HARDWARE.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 387, doi. 10.1142/S0129054110007325
- By:
- Publication type:
- Article
LOW-LATENCY CONNECTED COMPONENT LABELING USING AN FPGA.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 405, doi. 10.1142/S0129054110007337
- By:
- Publication type:
- Article
THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 427, doi. 10.1142/S0129054110007349
- By:
- Publication type:
- Article
COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 441, doi. 10.1142/S0129054110007350
- By:
- Publication type:
- Article
A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 3, p. 459, doi. 10.1142/S0129054110007362
- By:
- Publication type:
- Article