 | 2009 |
|---|
| 48 |       | Rafael Ördög,
Vince Grolmusz:
On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures.
IWANN (2) 2009: 1162-1169 |
| 2008 |
|---|
| 47 | | Rafael Ördög,
Vince Grolmusz:
Evaluating Genetic Algorithms in Protein-Ligand Docking.
ISBRA 2008: 402-413 |
| 46 | | Rafael Ördög,
Zoltan Szabadka,
Vince Grolmusz:
Analyzing the simplicial decomposition of spatial protein structures.
BMC Bioinformatics 9(S-1): (2008) |
| 45 | | Vince Grolmusz:
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication.
IEEE Transactions on Information Theory 54(8): 3687-3692 (2008) |
| 2006 |
|---|
| 44 | | Vince Grolmusz:
Co-Orthogonal Codes.
Des. Codes Cryptography 38(3): 363-372 (2006) |
| 43 | | Vince Grolmusz:
Pairs of codes with prescribed Hamming distances and coincidences.
Des. Codes Cryptography 41(1): 87-99 (2006) |
| 2005 |
|---|
| 42 | | Vince Grolmusz,
Zoltán Király:
Generalized Secure Routerless Routing.
ICN (2) 2005: 454-462 |
| 41 | | Vince Grolmusz:
On some applications of randomized memory.
Electronic Notes in Discrete Mathematics 19: 203-209 (2005) |
| 2003 |
|---|
| 40 | | Vince Grolmusz:
Near Quadratic Matrix Multiplication Modulo Composites
CoRR cs.CC/0301004: (2003) |
| 39 | | Vince Grolmusz:
Hyperdense Coding Modulo 6 with Filter-Machines
CoRR cs.CC/0306049: (2003) |
| 38 | | Vince Grolmusz:
Defying Dimensions Mod 6
CoRR cs.CC/0307020: (2003) |
| 37 | | Vince Grolmusz:
High-density and Secure Data Transmission via Linear Combinations
CoRR cs.CC/0307041: (2003) |
| 36 |  | Vince Grolmusz:
A Note on Explicit Ramsey Graphs and Modular Sieves.
Combinatorics, Probability & Computing 12(5-6): 565-569 (2003) |
| 35 | | Vince Grolmusz:
A Note on Set Systems with no Union of Cardinality 0 Modulo m.
Discrete Mathematics & Theoretical Computer Science 6(1): 41-44 (2003) |
| 34 | | Vince Grolmusz:
Near Quadratic Matrix Multiplication Modulo Composites
Electronic Colloquium on Computational Complexity (ECCC) 10(001): (2003) |
| 33 | | Vince Grolmusz:
Defying Dimensions Modulo 6
Electronic Colloquium on Computational Complexity (ECCC)(058): (2003) |
| 32 | | Vince Grolmusz:
Sixtors and Mod 6 Computations
Electronic Colloquium on Computational Complexity (ECCC)(074): (2003) |
| 31 | | Vince Grolmusz:
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications.
SIAM J. Comput. 32(6): 1475-1487 (2003) |
| 30 | | Vince Grolmusz,
Gábor Tardos:
A Note on Non-Deterministic Communication Complexity with Few Witnesses.
Theory Comput. Syst. 36(4): 387-391 (2003) |
| 2002 |
|---|
| 29 | | Vince Grolmusz:
Co-orthogonal Codes.
COCOON 2002: 144-152 |
| 28 | | Vince Grolmusz:
Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications
CoRR cs.CC/0207009: (2002) |
| 27 | | Vince Grolmusz:
Set-Systems with Restricted Multiple Intersections.
Electr. J. Comb. 9(1): (2002) |
| 26 | | Vince Grolmusz:
Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications
Electronic Colloquium on Computational Complexity (ECCC)(052): (2002) |
| 25 | | Vince Grolmusz:
Constructing set systems with prescribed intersection sizes.
J. Algorithms 44(2): 321-337 (2002) |
| 24 | | Vince Grolmusz,
Benny Sudakov:
On k-wise set-intersections and k-wise Hamming-distances.
J. Comb. Theory, Ser. A 99(1): 180-190 (2002) |
| 2001 |
|---|
| 23 | | Vince Grolmusz:
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits.
Discrete Mathematics & Theoretical Computer Science 4(2): 247-254 (2001) |
| 22 | | Vince Grolmusz:
Constructive Upper Bounds for Intersecting Set Systems.
Electronic Notes in Discrete Mathematics 7: 54-57 (2001) |
| 2000 |
|---|
| 21 | | Vince Grolmusz:
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs.
Combinatorica 20(1): 71-86 (2000) |
| 20 | | Vince Grolmusz:
Low Rank Co-Diagonal Matrices and Ramsey Graphs.
Electr. J. Comb. 7: (2000) |
| 19 | | Vince Grolmusz,
Gábor Tardos:
Lower Bounds for (MODp-MODm) Circuits.
SIAM J. Comput. 29(4): 1209-1222 (2000) |
| 1999 |
|---|
| 18 | | Vince Grolmusz:
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions.
Algorithmica 23(4): 341-353 (1999) |
| 1998 |
|---|
| 17 | | Vince Grolmusz,
Gábor Tardos:
Lower Bounds for (MOD p - MOD m) Circuits.
FOCS 1998: 279-289 |
| 16 | | Vince Grolmusz:
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits.
ICALP 1998: 215-222 |
| 15 | | Vince Grolmusz:
Circuits and Multi-Party Protocols.
Computational Complexity 7(1): 1-18 (1998) |
| 14 | | Vince Grolmusz,
Gábor Tardos:
Lower Bounds for (MOD p -- MOD m) Circuits
Electronic Colloquium on Computational Complexity (ECCC) 5(36): (1998) |
| 13 | | Vince Grolmusz:
A Lower Bound for Depth-3 Circuits with MOD m Gates.
Inf. Process. Lett. 67(2): 87-90 (1998) |
| 1997 |
|---|
| 12 | | Vince Grolmusz:
On Set Systems with Restricted Intersections Modulo a Composite Number.
COCOON 1997: 82-90 |
| 11 | | Vince Grolmusz:
On the Power of Circuits with Gates of Low L1 Norms.
Theor. Comput. Sci. 188(1-2): 117-128 (1997) |
| 1996 |
|---|
| 10 | | Vince Grolmusz:
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version).
COCOON 1996: 142-151 |
| 1995 |
|---|
| 9 | | Vince Grolmusz:
On the Weak mod m Representation of Boolean Functions.
Chicago J. Theor. Comput. Sci. 1995: (1995) |
| 8 | | Vince Grolmusz:
On the Power of Circuits with Gates of Low L1 Norms
Electronic Colloquium on Computational Complexity (ECCC) 2(46): (1995) |
| 1994 |
|---|
| 7 | | Vince Grolmusz:
A weight-size trade-off for circuits with MOD m gates.
STOC 1994: 68-74 |
| 6 | | Vince Grolmusz:
The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal
Inf. Comput. 112(1): 51-54 (1994) |
| 1992 |
|---|
| 5 | | Vince Grolmusz:
Separating the Communication Complexities of MOD m and MOD p Circuits
FOCS 1992: 278-287 |
| 4 | | Vince Grolmusz:
On a Ramsey-Theoretic Property of Orders.
J. Comb. Theory, Ser. A 61(2): 243-251 (1992) |
| 1991 |
|---|
| 3 | | Vince Grolmusz:
Large Parallel Machines Can Be Extremely Slow for Small Problems.
Algorithmica 6(4): 479-489 (1991) |
| 1990 |
|---|
| 2 | | Vince Grolmusz,
Prabhakar Ragde:
Incomparability in parallel computation.
Discrete Applied Mathematics 29(1): 63-78 (1990) |
| 1987 |
|---|
| 1 | | Vince Grolmusz,
Prabhakar Ragde:
Incomparability in Parallel Computation
FOCS 1987: 89-98 |
