20 citations · 46 across the 10 of their papers we have counts for
10 papers
AdChain: Decentralized Header Bidding
Behkish Nassirzadeh, Albert Heinle, Stefanos Leonardos +2
Due to the involvement of multiple intermediaries without trusted parties, lack of proper regulations, and a complicated supply chain, ad impression discrepancy affects online adve…
CountChain: A Decentralized Oracle Network for Counting Systems
Behkish Nassirzadeh, Stefanos Leonardos, Albert Heinle +2
Blockchain integration in industries like online advertising is hindered by its connectivity limitations to off-chain data. These industries heavily rely on precise counting system…
Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We use techniques from the fields of computer algebra and satisfiability checking to develop a new algorithm to search for complex Golay pairs. We implement this algorithm and use…
Enumeration of Complex Golay Pairs via Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We provide a complete enumeration of all complex Golay pairs of length up to 25, verifying that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. Thi…
A Factorization Algorithm for G-Algebras and Applications
Albert Heinle, Viktor Levandovskyy
It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous -algebras, are finite factorization domains (FFD for sh…
On Noncommutative Finite Factorization Domains
Jason P. Bell, Albert Heinle, Viktor Levandovskyy
A domain is said to have the finite factorization property if every nonzero non-unit element of has at least one and at most finitely many distinct factorizations up to mul…
A New Primitive for a Diffie-Hellman-like Key Exchange Protocol Based on Multivariate Ore Polynomials
Reinhold Burger, Albert Heinle
In this paper we present a new primitive for a key exchange protocol based on multivariate non-commutative polynomial rings, analogous to the classic Diffie-Hellman method. Our tec…
Factoring Differential Operators in n Variables
Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n…
SymbolicData:SDEval - Benchmarking for Everyone
Albert Heinle, Viktor Levandovskyy, Andreas Nareike
In this paper we will present SDeval, a software project that contains tools for creating and running benchmarks with a focus on problems in computer algebra. It is built on top of…
Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra
Albert Heinle, Viktor Levandovskyy
We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and -Weyl algebra, which are both viewed as a -graded rings. We…