Online Two Stage k-Search Problem and Its Competitive Analysis.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 653, doi. 10.1142/S0129054116500210
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2016 AND VI 27 AND IP 6
Results: 8
1
2
Weak-Rupture Degree of Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 725, doi. 10.1142/S0129054116500258
- By:
- Publication type:
- Article
3
A Note on Edge Isoperimetric Numbers and Regular Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 771, doi. 10.1142/S0129054116500283
- By:
- Publication type:
- Article
4
A New Operator over Parikh Languages.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 757, doi. 10.1142/S0129054116500271
- By:
- Publication type:
- Article
5
Multiple Repair Localities with Distinct Erasure Tolerance.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 665, doi. 10.1142/S0129054116500222
- By:
- Publication type:
- Article
6
Neighbor Rupture Degree of Harary Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 739, doi. 10.1142/S012905411650026X
- By:
- Publication type:
- Article
7
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 675, doi. 10.1142/S0129054116500234
- By:
- Publication type:
- Article
8
Operational State Complexity of Subtree-Free Regular Tree Languages.
- Published in:
- International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 705, doi. 10.1142/S0129054116500246
- By:
- Publication type:
- Article