A SIMPLE ARRAY VERSION OF M-HEAP.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 1, p. 67, doi. 10.1142/S012905411450004X
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2014 AND VI 25 AND IP 1
Results: 5
1
2
THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 1, p. 101, doi. 10.1142/S0129054114500063
- By:
- Publication type:
- Article
3
SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 1, p. 59, doi. 10.1142/S0129054114500038
- By:
- Publication type:
- Article
4
PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 1, p. 25, doi. 10.1142/S0129054114500026
- By:
- Publication type:
- Article
5
A NEW CONSTRUCTION OF IDENTITY-BASED SIGNCRYPTION WITHOUT RANDOM ORACLES.
- Published in:
- International Journal of Foundations of Computer Science, 2014, v. 25, n. 1, p. 1, doi. 10.1142/S0129054114500014
- By:
- Publication type:
- Article