The Iota-Delta Function as an Alternative to Boolean Formalism.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 415, doi. 10.1142/S0129054118500120
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2018 AND VI 29 AND IP 3
Results: 8
1
2
Quantum Pushdown Automata with Garbage Tape.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 425, doi. 10.1142/S0129054118500132
- By:
- Publication type:
- Article
3
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 357, doi. 10.1142/S0129054118500089
- By:
- Publication type:
- Article
4
Greedy Palindromic Lengths.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 331, doi. 10.1142/S0129054118500077
- By:
- Publication type:
- Article
5
Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 403, doi. 10.1142/S0129054118500119
- By:
- Publication type:
- Article
6
Link Vulnerability in Networks.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 447, doi. 10.1142/S0129054118500144
- By:
- Publication type:
- Article
7
Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 377, doi. 10.1142/S0129054118500090
- By:
- Publication type:
- Article
8
A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 3, p. 391, doi. 10.1142/S0129054118500107
- By:
- Publication type:
- Article