Incomparability in parallel computation. - Vince Grolmusz; Prabhakar Ragde (Discret. Appl. Math., 1990)

Large Parallel Machines Can Be Extremely Slow for Small Problems. - Vince Grolmusz (Algorithmica, 1991)

On a Ramsey-Theoretic Property of Orders. - Vince Grolmusz (J. Comb. Theory A, 1992)

A weight-size trade-off for circuits with MOD m gates. - Vince Grolmusz (STOC, 1994)

The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal - Vince Grolmusz (Inf. Comput., 1994)

On the Weak mod m Representation of Boolean Functions. - Vince Grolmusz (Chic. J. Theor. Comput. Sci., 1995)

Separating the Communication Complexities of MOD m and MOD p Circuits. - Vince Grolmusz (J. Comput. Syst. Sci., 1995)

Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). - Vince Grolmusz (COCOON, 1996)

On Set Systems with Restricted Intersections Modulo a Composite Number. - Vince Grolmusz (COCOON, 1997)

On the Power of Circuits with Gates of Low L1 Norms. - Vince Grolmusz (Theor. Comput. Sci., 1997)

Circuits and Multi-Party Protocols. - Vince Grolmusz (Comput. Complex., 1998)

Lower Bounds for (MOD p – MOD m) Circuits - Vince Grolmusz; Gábor Tardos (Electron. Colloquium Comput. Complex., 1998)

A Lower Bound for Depth-3 Circuits with MOD m Gates. - Vince Grolmusz (Inf. Process. Lett., 1998)

Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. - Vince Grolmusz (Algorithmica, 1999)

Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. - Vince Grolmusz (Comb., 2000)

Low Rank Co-Diagonal Matrices and Ramsey Graphs. - Vince Grolmusz (Electron. J. Comb., 2000)

Lower Bounds for (MODp-MODm) Circuits. - Vince Grolmusz; Gábor Tardos (SIAM J. Comput., 2000)

A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. - Vince Grolmusz (Discret. Math. Theor. Comput. Sci., 2001)

Constructive Upper Bounds for Intersecting Set Systems. - Vince Grolmusz (Electron. Notes Discret. Math., 2001)

Set-Systems with Restricted Multiple Intersections. - Vince Grolmusz (Electron. J. Comb., 2002)

Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications - Vince Grolmusz (CoRR, 2002)

Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications - Vince Grolmusz (Electron. Colloquium Comput. Complex., 2002)

Constructing set systems with prescribed intersection sizes. - Vince Grolmusz (J. Algorithms, 2002)

On k-wise set-intersections and k-wise Hamming-distances. - Vince Grolmusz; Benny Sudakov (J. Comb. Theory A, 2002)

Hyperdense Coding Modulo 6 with Filter-Machines - Vince Grolmusz (CoRR, 2003)

Defying Dimensions Mod 6 - Vince Grolmusz (CoRR, 2003)

High-density and Secure Data Transmission via Linear Combinations - Vince Grolmusz (CoRR, 2003)

A Note on Explicit Ramsey Graphs and Modular Sieves. - Vince Grolmusz (Comb. Probab. Comput., 2003)

A Note on Set Systems with no Union of Cardinality 0 Modulo m. - Vince Grolmusz (Discret. Math. Theor. Comput. Sci., 2003)

Near Quadratic Matrix Multiplication Modulo Composites - Vince Grolmusz (Electron. Colloquium Comput. Complex., 2003)

Defying Dimensions Modulo 6 - Vince Grolmusz (Electron. Colloquium Comput. Complex., 2003)

Sixtors and Mod 6 Computations - Vince Grolmusz (Electron. Colloquium Comput. Complex., 2003)

A Note on Non-Deterministic Communication Complexity with Few Witnesses. - Vince Grolmusz; Gábor Tardos (Theory Comput. Syst., 2003)

Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. - Vince Grolmusz (SIAM J. Comput., 2003)

Secure routerless routing. - Vince Grolmusz; Zoltán Király (FDNA@SIGCOMM, 2004)

Generalized Secure Routerless Routing. - Vince Grolmusz; Zoltán Király (ICN (2), 2005)

On some applications of randomized memory. - Vince Grolmusz (Electron. Notes Discret. Math., 2005)

Building a Structured PDB: The RS-PDB Database. - Zoltan Szabadka; Vince Grolmusz (EMBC, 2006)

Co-Orthogonal Codes. - Vince Grolmusz (Des. Codes Cryptogr., 2006)

Pairs of codes with prescribed Hamming distances and coincidences. - Vince Grolmusz (Des. Codes Cryptogr., 2006)

Evaluating Genetic Algorithms in Protein-Ligand Docking. - Rafael Ördög; Vince Grolmusz (ISBRA, 2008)

Analyzing the simplicial decomposition of spatial protein structures. - Rafael Ördög; Zoltan Szabadka; Vince Grolmusz (BMC Bioinform., 2008)

Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication. - Vince Grolmusz (IEEE Trans. Inf. Theory, 2008)

On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures. - Rafael Ördög; Vince Grolmusz (IWANN (2), 2009)

On the Asymmetry of the Residue Compositions of the Binding Sites on protein Surfaces. - Gábor Iván; Zoltan Szabadka; Vince Grolmusz (J. Bioinform. Comput. Biol., 2009)

Cysteine and tryptophan anomalies found when scanning all the binding sites in the Protein Data Bank. - Gábor Iván; Zoltan Szabadka; Vince Grolmusz (Int. J. Bioinform. Res. Appl., 2010)

When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks. - Gábor Iván; Vince Grolmusz (Bioinform., 2011)

The Erdős webgraph server. - Rafael Ördög; Dániel Bánky; Balázs Szerencsi; Péter Juhász; Vince Grolmusz (Discret. Appl. Math., 2014)

A note on the PageRank of undirected graphs. - Vince Grolmusz (Inf. Process. Lett., 2015)

Near Perfect Protein Multi-Label Classification with Deep Neural Networks. - Balázs Szalkai; Vince Grolmusz (CoRR, 2017)

SECLAF: a webserver and deep neural network design tool for hierarchical biological sequence classification. - Balázs Szalkai; Vince Grolmusz (Bioinform., 2018)

Good Neighbors, Bad Neighbors: The Frequent Network Neighborhood Mapping of the Hippocampus Enlightens Several Structural Factors of the Human Intelligence. - Máté Fellner; Bálint Varga; Vince Grolmusz (CISP-BMEI, 2019)

The Frequent Complete Subgraphs in the Human Connectome. - Máté Fellner; Bálint Varga; Vince Grolmusz (IWANN (2), 2019)

Introducing and Applying Newtonian Blurring: An Augmented Dataset of 126, 000 Human Connectomes at braingraph.org. - Laszlo Keresztes; Evelin Szögi; Bálint Varga; Vince Grolmusz (CoRR, 2020)

SCARF: a biomedical association rule finding webserver. - Balázs Szalkai; Vince Grolmusz (J. Integr. Bioinform., 2022)

On the border of the amyloidogenic sequences: prefix analysis of the parallel beta sheets in the PDB_Amyloid collection. - Kristóf Takács; Vince Grolmusz (J. Integr. Bioinform., 2022)

A Note on the LogRank Conjecture in Communication Complexity. - Vince Grolmusz (CoRR, 2023)

Gluing GAP to RAS Mutants: A New Approach to an Old Problem in Cancer Drug Development. - Ivan Randelovic; Kinga Nyíri; Gergely Koppány; Marcel Baranyi; József Tóvári; Attila Kigyós; József Timár; Beáta G. Vértessy; Vince Grolmusz (CoRR, 2023)

Opening Amyloid-Windows to the secondary structure of proteins: The amyloidogenecity increases tenfold inside beta-sheets. - Kristóf Takács; Bálint Varga; Viktor Farkas; András Perczel; Vince Grolmusz (Comput. Biol. Medicine, 2024)