Vince Grolmusz Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). [Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:142-151 [Conf]
Vince Grolmusz On Set Systems with Restricted Intersections Modulo a Composite Number. [Citation Graph (0, 0)][DBLP] COCOON, 1997, pp:82-90 [Conf]
Vince Grolmusz Separating the Communication Complexities of MOD m and MOD p Circuits [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:278-287 [Conf]
Vince Grolmusz Large Parallel Machines Can Be Extremely Slow for Small Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 1991, v:6, n:4, pp:479-489 [Journal]
Vince Grolmusz Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:23, n:4, pp:341-353 [Journal]
Vince Grolmusz On the Weak mod m Representation of Boolean Functions. [Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal]
Vince Grolmusz Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 2000, v:20, n:1, pp:71-86 [Journal]
Vince Grolmusz Pairs of codes with prescribed Hamming distances and coincidences. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:41, n:1, pp:87-99 [Journal]
Vince Grolmusz A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. [Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:247-254 [Journal]
Vince Grolmusz A Note on Set Systems with no Union of Cardinality 0 Modulo m. [Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:41-44 [Journal]
Vince Grolmusz Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:052, pp:- [Journal]
Vince Grolmusz Sixtors and Mod 6 Computations [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:074, pp:- [Journal]
Vince Grolmusz On the Power of Circuits with Gates of Low L1 Norms [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:46, pp:- [Journal]
Vince Grolmusz Constructing set systems with prescribed intersection sizes. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:44, n:2, pp:321-337 [Journal]
Vince Grolmusz Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:6, pp:1475-1487 [Journal]
Vince Grolmusz On the Power of Circuits with Gates of Low L1 Norms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:188, n:1-2, pp:117-128 [Journal]
On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures. [Citation Graph (, )][DBLP]
Evaluating Genetic Algorithms in Protein-Ligand Docking. [Citation Graph (, )][DBLP]
Analyzing the simplicial decomposition of spatial protein structures. [Citation Graph (, )][DBLP]