The following pages link to Algebraic Informatics (Q2849996):
Displaying 50 items.
- Euclidean Model Checking: A Scalable Method for Verifying Quantitative Properties in Probabilistic Systems (Q2849997) (← links)
- Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata (Q2849998) (← links)
- On Elliptic Curve Paillier Schemes (Q2849999) (← links)
- Proofs of Storage: Theory, Constructions and Applications (Q2850000) (← links)
- Code Based Cryptography and Steganography (Q2850001) (← links)
- Strong Prefix Codes of Pictures (Q2850002) (← links)
- The Algebraic Theory of Parikh Automata (Q2850003) (← links)
- Generalized AG Codes as Evaluation Codes (Q2850004) (← links)
- Osculating Spaces of Varieties and Linear Network Codes (Q2850005) (← links)
- On Sets of Numbers Rationally Represented in a Rational Base Number System (Q2850006) (← links)
- A New Bound for Cyclic Codes Beating the Roos Bound (Q2850007) (← links)
- On a Conjecture of Helleseth (Q2850008) (← links)
- Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm (Q2850009) (← links)
- Side Channel Attacks against Pairing over Theta Functions (Q2850010) (← links)
- On the Efficient Generation of Generalized MNT Elliptic Curves (Q2850011) (← links)
- Shimura Modular Curves and Asymptotic Symmetric Tensor Rank of Multiplication in any Finite Field (Q2850012) (← links)
- Stochastic Equationality (Q2850013) (← links)
- On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers (Q2850015) (← links)
- Approximation of Large Probabilistic Networks by Structured Population Protocols (Q2850016) (← links)
- Model-Checking by Infinite Fly-Automata (Q2850017) (← links)
- A Selection-Quotient Process for Packed Word Hopf Algebra (Q2850018) (← links)
- Synchronous Forest Substitution Grammars (Q2850019) (← links)
- Characterizations of Weighted First-Order Logics over Semirings (Q2850020) (← links)
- Linear Induction Algebra and a Normal Form for Linear Operators (Q2850021) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- An Algebraic Geometric Approach to Multidimensional Words (Q2947144) (← links)
- Why We Need Semirings in Automata Theory (Extended Abstract) (Q2947145) (← links)
- Unbordered Pictures: Properties and Construction (Q2947146) (← links)
- Effective Invariant Theory of Permutation Groups Using Representation Theory (Q2947147) (← links)
- On Differential Uniformity of Maps that May Hide an Algebraic Trapdoor (Q2947148) (← links)
- On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions (Q2947149) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- A New Partial Key Exposure Attack on Multi-power RSA (Q2947151) (← links)
- A Chomsky-Schützenberger Theorem for Weighted Automata with Storage (Q2947152) (← links)
- EF+EX Forest Algebras (Q2947153) (← links)
- On Near Prime-Order Elliptic Curves with Small Embedding Degrees (Q2947154) (← links)
- Key-Policy Multi-authority Attribute-Based Encryption (Q2947155) (← links)
- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
- Complexity of Uniform Membership of Context-Free Tree Grammars (Q2947158) (← links)
- Attacking BEAR and LION Schemes in a Realistic Scenario (Q2947159) (← links)
- Weighted Restarting Automata and Pushdown Relations (Q2947160) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- From Grammars and Automata to Algebras and Coalgebras (Q3014929) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- Codes and Combinatorial Structures from Circular Planar Nearrings (Q3014934) (← links)
