Discover open access scientific publications

Search, annotate, share and cite publications

Publications in Theoretical Computer Science

New Results and Applications for Multi-Secret Sharing Schemes

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2013English

New Bounds on Simonyi’s Conjecture

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2018English

Parity of the Number of Irreducible Factors for Composite Polynomials

Finite Fields and Their Applications
Theoretical Computer ScienceApplied MathematicsNumber TheoryEngineeringAlgebra
2010English

A New Lower Bound for the Smallest Complete (K, N)-Arc in $$\Mathrm {PG}(2,q)$$PG(2,q)

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2018English

Signcryption Schemes With Threshold Unsigncryption, and Applications

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2012English

Improved User-Private Information Retrieval via Finite Geometry

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2018English

Hadwiger’s Conjecture for Squares of 2-Trees

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Simultaneous Core Multipartitions

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Lower Bound Theorems for General Polytopes

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Polynomial Factorization Over Finite Fields by Computing Euler–Poincaré Characteristics of Drinfeld Modules

Finite Fields and Their Applications
Theoretical Computer ScienceApplied MathematicsNumber TheoryEngineeringAlgebra
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy