Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

A Simple Algorithm for Estimating Distribution Parameters from $$n$$ n -Dimensional Randomized Binary Responses: Label: en
Practical Attacks on Relational Databases Protected via Searchable Encryption: Label: en
Conditional Cube Searching and Applications on Trivium-Variant Ciphers: Label: en
Linear Cryptanalysis of Reduced-Round Speck with a Heuristic Approach: Automatic Search for Linear Trails: Label: en
Automatic Search for Related-Key Differential Trails in SIMON-like Block Ciphers Based on MILP: Label: en
Speeding up MILP Aided Differential Characteristic Search with Matsui’s Strategy: Label: en
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs: Label: en
A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation: Label: en
Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions: Label: en
Verifiable Decryption for Fully Homomorphic Encryption: Label: en
Multi-key Homomorphic Proxy Re-Encryption: Label: en
On Constructing Pairing-Free Identity-Based Encryptions: Label: en
Function-Dependent Commitments for Verifiable Multi-party Computation: Label: en
Offline Assisted Group Key Exchange: Label: en
Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT: Label: en
Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony: Label: en
Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update: Label: en
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata: Label: en
On Fixable Families of Boolean Networks: Label: en
A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia: Label: en
Eroders and Proliferation: Repairing that Goes Wrong: Label: en
Inversion of Mutually Orthogonal Cellular Automata: Label: en
CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher: Label: en
Self-verifying Cellular Automata: Label: en
Quantum Walks on Quantum Cellular Automata Lattices: Towards a New Model for Quantum Computation: Label: en
The Representation Role for Basic Operations Embodied in Cellular Automata: A Suitability Example for Addition in Redundant Numeral Systems vs Conventional Ones: Label: en
Polynomial Equations over Finite, Discrete-Time Dynamical Systems: Label: en
Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays: Label: en
Regional Synchronization of a Probabilistic Cellular Automaton: Label: en
Regional Control of Probabilistic Cellular Automata: Label: en
Size Effect in Cellular Automata Based Disease Spreading Model: Label: en
Termination and Stability Levels in Evolved CA Agents for the Black–Pattern Task: Label: en
Towards Self-organizing Sensor Networks: Game-Theoretic $$\epsilon $$ -Learning Automata-Based Approach: Label: en
Coexistence in Three-Species Cyclic Competition: Lattice-Based Versus Lattice-Free Individual-Based Models: Label: en
Hardware Implementation of a Biomimicking Hybrid CA: Label: en
PAM: Discrete 3-D Model of Tumor Dynamics in the Presence of Anti-tumor Treatment: Label: en
A Novel Cellular Automata Modelling Framework for Micro-environmental Interaction and Co-invasion: Label: en
Modeling Spatio-Temporal Dynamics of Metabolic Networks with Cellular Automata and Constraint-Based Methods: Label: en
Cellular Automata Model for Proteomics and Its Application in Cancer Immunotherapy: Label: en
Languages generated by conjunctive query fragments of FC[REG]: Label: en
Approaching repetition thresholds via local resampling and entropy compression: Label: en
Synchronizing automata with coinciding cycles: Label: en
Rewriting rules for arithmetics in alternate base systems: Label: en
Tree-walking-storage automata: Label: en
Jumping automata over Infinite words: Label: en
Groups whose word problems are accepted by abelian $G$-automata: Label: en
On the Simon's congruence neighborhood of languages: Label: en
On word-representable and multi-word-representable graphs: Label: en
Zielonka DAG acceptance and regular languages over infinite words: Label: en
Completely distinguishable automata and the set of synchronizing words: Label: en