He is working on the existence theory of finite combinatorial structures (sequences, finite geometries, codes) with “nice” algebraic properties. To obtain constructions or nonexistence proofs, any useful methods are welcome, but the main tools he uses come from Algebra and Number Theory. This approach is often combined with heavy computer searches.
His research interests lie primarily in Number Theory, Combinatorics and Special functions, in particular, sums of squares formula, the partition function and various related functions, and q-series which includes modular forms, theta functions, and basic hypergeometric series.
His research interests lie in the interplay between combinatorics, computer science, engineering, and biology, especially the following:
Combinatorics of nanotechnology: low-power design, thermal-aware design, crosstalk issues, and test pattern generation for deep submicron and nanometer-scale circuits, oligonucleotide sequence design for DNA computing, quantum error-correcting codes.
Designs, codes and cryptography: triple systems, block designs, pairwise balanced designs, group-divisible designs, t-designs, Latin squares, error-correcting codes, erasure-resilient codes, deletion codes, codes for non-conventional channels, combinatorial cryptography, algorithms and computational methods, applications in computer science, engineering and biology.
Extremal set systems: Turán-type problems, packings and coverings, cover-free systems, applications in computer science and engineering.
His research is mainly focused on applying algorithm and mechanism design ideas to problems with economic applications (e.g. sponsored search auctions, truthful mechanism design, optimal pricing, market equilibrium, social networks, etc.).
His research interests fall into the general areas of computational biology and bioinformatics, i.e., developing mathematical methods to solve biological problems. His current research topics include: ortholog assignment, operon prediction, and the minimum common integer partition problem. He is also interested in gene expression data analysis, protein-to-protein interaction, and promoter binding sites identification.
He studies a range of topics related to computing on semialgebraic sets, in particular semidefinite programs (SDP). This includes algebraic techniques for dimension reduction of SDPs, SDP relaxation techniques for computationally intractable problems, and exact symbolic computing over R, including complexity questions. As well, he is interested in combinatorics, algebraic geometry (mostly real), and group theory.
His research interests include: number theory and the application of algebra and number theory to coding theory, sequences, combinatorics, etc. His current projects include: algebraic coding, codes and sequences over rings, LDPC codes, quantum codes, etc.
Her current research interests include applications of algebra and number theory to coding theory and different aspects of information theoretical security.
His research areas include Discrete and computational geometry, the combinatorial geometry of polytopes, analytic number theory and modular forms, and secure communications / cryptography.
His current research interests include the growing interplay between the continuous volume of a polytope and its discrete volume, the latter defined by the number of integer points that are contained in the polytope. Many branches of combinatorics, discrete geometry, and number theory can be unified using this interplay. Indeed, one of the main problems in encryption is to find the number of integer points that are contained inside a given parallelepiped whose vertices have rational coordinates.
Some of his recent research deals with extensions of angles to higher dimensions, where generalized angles – called solid angles – play a role in defining new discrete volumes of polytopes. Some of the Number Theory that comes into the general analysis consists of Dedekind Sums and their many higher dimensional generalizations.
Among the applications of the theory of discrete volumes of polytopes are the Frobenius coin exchange problem, the enumeration of doubly-stochastic matrices, new volume formulas for the Birkhoff polytopes and related transportation polytopes, and algorithms for integer flow networks.
His research areas are in cryptography, information security,
coding theory and combinatorics. His current research interests
include authentication codes, public-key cryptosystems,
digital signature schemes, hash functions, provable security,
broadcast encryption, secret sharing, secure multiparty computation,
key distributions, Private Information Retrieval, stream authentication,
cover-free families, perfect hash families etc.
His research interests focus on logic, computability theory and complexity theory. He works mainly on the algebraic properties of the structure of Turing degrees, undecidability, the effective aspects of analysis, algebra and combinatorics. He also has interest in reverse mathematics and set theory.
My research interests include: number theory, algebraic curves and applications to coding, cryptography, low-discrepancy sequence, sphere-packings. some my current projects are: constructions of block codes from algebraic geometry, quantum coding, space-time coding and sphere packings.
He studies analytic number theory. More specifically, he is interested in the theory of large sieve, mean-value type theorems, exponential and character sums, sieve methods, automorphic forms and elliptic curves. Some of his recent research deals with primes represented by polynomials, traces of Frobenius morphism for elliptic curves and analytic ranks of elliptic curves.