| Component Edge Connectivity of Hypercubes |
5 |
| Link Vulnerability in Networks |
3 |
| On Self-Dual Four Circulant Codes |
3 |
| An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme |
2 |
| Certificate-Based Generalized Ring Signcryption Scheme |
2 |
| Exponential Domination Critical and Stability in Some Graphs |
2 |
| Approximation Algorithms for Barrier Sweep Coverage |
2 |
| Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator |
2 |
| Diverse Palindromic Factorization is NP-Complete |
2 |
| On Basic Properties of Jumping Finite Automata |
2 |
| On M-Equivalence and Strong M-Equivalence for Parikh Matrices |
2 |
| Online Graph Coloring Against a Randomized Adversary |
2 |
| Algorithms and Bounds for L-Drawings of Directed Graphs |
1 |
| One-Time Nondeterministic Computations |
1 |
| A Family of Scheduling Algorithms for Hybrid Parallel Platforms |
1 |
| Multi-Sequential Word Relations |
1 |
| Lower Bounds for Synchronizing Word Lengths in Partial Automata |
1 |
| Quantum Pushdown Automata with Garbage Tape |
1 |
| Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs |
1 |
| Greedy Palindromic Lengths |
1 |
| On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes |
1 |
| Provably Secure (Broadcast) Homomorphic Signcryption |
1 |
| Secure Data Deduplication with Reliable Data Deletion in Cloud |
1 |
| Triple-Cycle Permutations Over Finite Fields of Characteristic Two |
1 |
| On the Lower Bounds of (0)-Super Solutions for Random k-SAT |
1 |
| Advances on Testing C-Planarity of Embedded Flat Clustered Graphs |
1 |
| Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications |
1 |
| Computing Version Spaces in the Qualitative Approach to Multicriteria Decision Aid |
1 |
| Fast Average-Case Pattern Matching on Weighted Sequences |
1 |
| Identifying Potential Regulatory Elements by Transcription Factor Binding Site Alignment Using Partial Order Graphs |
1 |
| Permutations and Negative Beta-Shifts |
1 |
| Rigidity and Substitutive Dendric Words |
1 |
| Complementation of Branching Automata for Scattered and Countable N-Free Posets |
1 |
| Degrees of Infinite Words, Polynomials and Atoms |
1 |
| Double Circulant Self-Dual and LCD Codes Over Z(p2) |
1 |
| A Note on the Link Residual Closeness of Graphs Under Join Operation |
1 |
| One-Variable Word Equations and Three-Variable Constant-Free Word Equations |
1 |
| m-Bonsai: A Practical Compact Dynamic Trie |
0 |
| Improved Compression of DNA Sequencing Data with Cascading Bloom Filters |
0 |
| Bidirectional Variable-Order de Bruijn Graphs |
0 |
| On the Complexity of Solving Restricted Word Equations |
0 |
| Compositions of Tree-to-Tree Statistical Machine Translation Models |
0 |
| On the Strength of Unambiguous Tree Automata |
0 |
| Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words |
0 |
| Nonsingular Polynomials from Feedback Shift Registers |
0 |
| Prices of Anarchy of Selfish 2D Bin Packing Games |
0 |
| Tight Bounds for Restricted Grid Scheduling |
0 |
| Uncountable Realtime Probabilistic Classes |
0 |
| New Results on Vector and Homing Vector Automata |
0 |
| Cobham's Theorem and Automaticity |
0 |
