Works matching IS 01290541 AND DT 2010 AND VI 21 AND IP 6
Results: 17
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 873, doi. 10.1142/S012905411000760X
- By:
- Publication type:
- Article
ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 875, doi. 10.1142/S0129054110007611
- By:
- Publication type:
- Article
PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 893, doi. 10.1142/S0129054110007623
- By:
- Publication type:
- Article
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 905, doi. 10.1142/S0129054110007635
- By:
- Publication type:
- Article
FINDING ALL APPROXIMATE GAPPED PALINDROMES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 925, doi. 10.1142/S0129054110007647
- By:
- Publication type:
- Article
THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 941, doi. 10.1142/S0129054110007659
- By:
- Publication type:
- Article
ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 963, doi. 10.1142/S0129054110007660
- By:
- Publication type:
- Article
IMPROVING TWO NOVEL THREE-PARTY ENCRYPTED KEY EXCHANGE PROTOCOLS WITH PERFECT FORWARD SECRECY.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 979, doi. 10.1142/S0129054110007672
- By:
- Publication type:
- Article
PARIKH MATRIX MAPPING AND LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 993, doi. 10.1142/S0129054110007684
- By:
- Publication type:
- Article
TERMINATION ANALYSIS OF LINEAR LOOPS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1005, doi. 10.1142/S0129054110007696
- By:
- Publication type:
- Article
AUTHOR INDEX VOLUME 21 (2010).
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1101, doi. 10.1142/S0129054110007763
- Publication type:
- Article
PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1021, doi. 10.1142/S0129054110007702
- By:
- Publication type:
- Article
HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1049, doi. 10.1142/S0129054110007726
- By:
- Publication type:
- Article
A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1065, doi. 10.1142/S0129054110007738
- By:
- Publication type:
- Article
PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1073, doi. 10.1142/S012905411000774X
- By:
- Publication type:
- Article
ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1089, doi. 10.1142/S0129054110007751
- By:
- Publication type:
- Article
OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES.
- Published in:
- International Journal of Foundations of Computer Science, 2010, v. 21, n. 6, p. 1035, doi. 10.1142/S0129054110007714
- By:
- Publication type:
- Article