Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Vince Grolmusz
2010 – today
- 2012
[i12]- 2011
- [j29]Gábor Iván, Vince Grolmusz: When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks. Bioinformatics 27(3): 405-407 (2011)
- 2010
- [j28]Gábor Iván, Zoltan Szabadka, Vince Grolmusz: Cysteine and tryptophan anomalies found when scanning all the binding sites in the Protein Data Bank. IJBRA 6(6): 594-608 (2010)
2000 – 2009
- 2009
- [j27]Gábor Iván, Zoltan Szabadka, Vince Grolmusz: On the Asymmetry of the Residue Compositions of the Binding Sites on protein Surfaces. J. Bioinformatics and Computational Biology 7(6): 931-938 (2009)
- [c11]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
- [j26]Rafael Ördög, Zoltan Szabadka, Vince Grolmusz: Analyzing the simplicial decomposition of spatial protein structures. BMC Bioinformatics 9(S-1) (2008)
- [j25]Vince Grolmusz: Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication. IEEE Transactions on Information Theory 54(8): 3687-3692 (2008)
- [c10]Rafael Ördög, Vince Grolmusz: Evaluating Genetic Algorithms in Protein-Ligand Docking. ISBRA 2008: 402-413
- 2006
- [j24]
- [j23]Vince Grolmusz: Pairs of codes with prescribed Hamming distances and coincidences. Des. Codes Cryptography 41(1): 87-99 (2006)
- 2005
- [j22]Vince Grolmusz: On some applications of randomized memory. Electronic Notes in Discrete Mathematics 19: 203-209 (2005)
- [c9]
- 2003
- [j21]Vince Grolmusz: A Note on Explicit Ramsey Graphs and Modular Sieves. Combinatorics, Probability & Computing 12(5-6): 565-569 (2003)
- [j20]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)
- [j19]Vince Grolmusz, Gábor Tardos: A Note on Non-Deterministic Communication Complexity with Few Witnesses. Theory Comput. Syst. 36(4): 387-391 (2003)
- [j18]Vince Grolmusz: Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. SIAM J. Comput. 32(6): 1475-1487 (2003)
- [i11]
- [i10]
- [i9]
- [i8]Vince Grolmusz: High-density and Secure Data Transmission via Linear Combinations. CoRR cs.CC/0307041 (2003)
- [i7]Vince Grolmusz: Near Quadratic Matrix Multiplication Modulo Composites. Electronic Colloquium on Computational Complexity (ECCC) 10(001) (2003)
- [i6]Vince Grolmusz: Defying Dimensions Modulo 6. Electronic Colloquium on Computational Complexity (ECCC)(058) (2003)
- [i5]Vince Grolmusz: Sixtors and Mod 6 Computations. Electronic Colloquium on Computational Complexity (ECCC)(074) (2003)
- 2002
- [j17]
- [j16]Vince Grolmusz: Constructing set systems with prescribed intersection sizes. J. Algorithms 44(2): 321-337 (2002)
- [j15]Vince Grolmusz, Benny Sudakov: On k-wise set-intersections and k-wise Hamming-distances. J. Comb. Theory, Ser. A 99(1): 180-190 (2002)
- [c8]
- [i4]Vince Grolmusz: Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications. CoRR cs.CC/0207009 (2002)
- [i3]Vince Grolmusz: Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications. Electronic Colloquium on Computational Complexity (ECCC)(052) (2002)
- 2001
- [j14]Vince Grolmusz: A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. Discrete Mathematics & Theoretical Computer Science 4(2): 247-254 (2001)
- [j13]Vince Grolmusz: Constructive Upper Bounds for Intersecting Set Systems. Electronic Notes in Discrete Mathematics 7: 54-57 (2001)
- 2000
- [j12]Vince Grolmusz: Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. Combinatorica 20(1): 71-86 (2000)
- [j11]
- [j10]Vince Grolmusz, Gábor Tardos: Lower Bounds for (MODp-MODm) Circuits. SIAM J. Comput. 29(4): 1209-1222 (2000)
1990 – 1999
- 1999
- [j9]Vince Grolmusz: Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. Algorithmica 23(4): 341-353 (1999)
- 1998
- [j8]
- [j7]Vince Grolmusz: A Lower Bound for Depth-3 Circuits with MOD m Gates. Inf. Process. Lett. 67(2): 87-90 (1998)
- [c7]
- [c6]
- [i2]Vince Grolmusz, Gábor Tardos: Lower Bounds for (MOD p -- MOD m) Circuits. Electronic Colloquium on Computational Complexity (ECCC) 5(36) (1998)
- 1997
- [j6]Vince Grolmusz: On the Power of Circuits with Gates of Low L1 Norms. Theor. Comput. Sci. 188(1-2): 117-128 (1997)
- [c5]Vince Grolmusz: On Set Systems with Restricted Intersections Modulo a Composite Number. COCOON 1997: 82-90
- 1996
- [c4]Vince Grolmusz: Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). COCOON 1996: 142-151
- 1995
- [j5]Vince Grolmusz: On the Weak mod m Representation of Boolean Functions. Chicago J. Theor. Comput. Sci. 1995 (1995)
- [i1]Vince Grolmusz: On the Power of Circuits with Gates of Low L1 Norms. Electronic Colloquium on Computational Complexity (ECCC) 2(46) (1995)
- 1994
- [j4]Vince Grolmusz: The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal. Inf. Comput. 112(1): 51-54 (1994)
- [c3]
- 1992
- [j3]Vince Grolmusz: On a Ramsey-Theoretic Property of Orders. J. Comb. Theory, Ser. A 61(2): 243-251 (1992)
- [c2]Vince Grolmusz: Separating the Communication Complexities of MOD m and MOD p Circuits. FOCS 1992: 278-287
- 1991
- [j2]Vince Grolmusz: Large Parallel Machines Can Be Extremely Slow for Small Problems. Algorithmica 6(4): 479-489 (1991)
- 1990
- [j1]Vince Grolmusz, Prabhakar Ragde: Incomparability in parallel computation. Discrete Applied Mathematics 29(1): 63-78 (1990)
1980 – 1989
- 1987
- [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:57 CET by the dblp team