Vince Grolmusz

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 12

Top Topics

Secondary Structure Of Proteins

Top Venues

J. Integr. Bioinform.

Inf. Process. Lett.

Publications

Kristóf Takács, Bálint Varga, Viktor Farkas, András Perczel, Vince Grolmusz
Opening Amyloid-Windows to the secondary structure of proteins: The amyloidogenecity increases tenfold inside beta-sheets. Comput. Biol. Medicine 179 (2024)
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
Gluing GAP to RAS Mutants: A New Approach to an Old Problem in Cancer Drug Development. CoRR (2023)
Vince Grolmusz
A Note on the LogRank Conjecture in Communication Complexity. CoRR (2023)
Balázs Szalkai, Vince Grolmusz
SCARF: a biomedical association rule finding webserver. J. Integr. Bioinform. 19 (1) (2022)
Kristóf Takács, Vince Grolmusz
On the border of the amyloidogenic sequences: prefix analysis of the parallel beta sheets in the PDB_Amyloid collection. J. Integr. Bioinform. 19 (1) (2022)
Laszlo Keresztes, Evelin Szögi, Bálint Varga, Vince Grolmusz
Introducing and Applying Newtonian Blurring: An Augmented Dataset of 126, 000 Human Connectomes at braingraph.org. CoRR (2020)
Máté Fellner, Bálint Varga, Vince Grolmusz
The Frequent Complete Subgraphs in the Human Connectome. IWANN (2) (2019)
Máté Fellner, Bálint Varga, Vince Grolmusz
Good Neighbors, Bad Neighbors: The Frequent Network Neighborhood Mapping of the Hippocampus Enlightens Several Structural Factors of the Human Intelligence. CISP-BMEI (2019)
Balázs Szalkai, Vince Grolmusz
SECLAF: a webserver and deep neural network design tool for hierarchical biological sequence classification. Bioinform. 34 (14) (2018)
Balázs Szalkai, Vince Grolmusz
SCARF: A Biomedical Association Rule Finding Webserver. CoRR (2017)
Balázs Szalkai, Vince Grolmusz
Near Perfect Protein Multi-Label Classification with Deep Neural Networks. CoRR (2017)
Vince Grolmusz
A note on the PageRank of undirected graphs. Inf. Process. Lett. 115 (6-8) (2015)
Rafael Ördög, Dániel Bánky, Balázs Szerencsi, Péter Juhász, Vince Grolmusz
The Erdős webgraph server. Discret. Appl. Math. 167 (2014)
Vince Grolmusz
A Note on the PageRank of Undirected Graphs CoRR (2012)
Gábor Iván, Vince Grolmusz
When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks. Bioinform. 27 (3) (2011)
Gábor Iván, Zoltan Szabadka, Vince Grolmusz
Cysteine and tryptophan anomalies found when scanning all the binding sites in the Protein Data Bank. Int. J. Bioinform. Res. Appl. 6 (6) (2010)
Gábor Iván, Zoltan Szabadka, Vince Grolmusz
On the Asymmetry of the Residue Compositions of the Binding Sites on protein Surfaces. J. Bioinform. Comput. Biol. 7 (6) (2009)
Rafael Ördög, Vince Grolmusz
On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures. IWANN (2) (2009)
Rafael Ördög, Zoltan Szabadka, Vince Grolmusz
Analyzing the simplicial decomposition of spatial protein structures. BMC Bioinform. 9 (S-1) (2008)
Rafael Ördög, Vince Grolmusz
Evaluating Genetic Algorithms in Protein-Ligand Docking. ISBRA (2008)
Vince Grolmusz
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication. IEEE Trans. Inf. Theory 54 (8) (2008)
Zoltan Szabadka, Vince Grolmusz
Building a Structured PDB: The RS-PDB Database. EMBC (2006)
Vince Grolmusz
Pairs of codes with prescribed Hamming distances and coincidences. Des. Codes Cryptogr. 41 (1) (2006)
Vince Grolmusz
Co-Orthogonal Codes. Des. Codes Cryptogr. 38 (3) (2006)
Vince Grolmusz, Zoltán Király
Generalized Secure Routerless Routing. ICN (2) (2005)
Vince Grolmusz
On some applications of randomized memory. Electron. Notes Discret. Math. 19 (2005)
Vince Grolmusz, Zoltán Király
Secure routerless routing. FDNA@SIGCOMM (2004)
Vince Grolmusz
Near Quadratic Matrix Multiplication Modulo Composites Electron. Colloquium Comput. Complex. 10 (001) (2003)
Vince Grolmusz
Defying Dimensions Modulo 6 Electron. Colloquium Comput. Complex. (058) (2003)
Vince Grolmusz
Near Quadratic Matrix Multiplication Modulo Composites CoRR (2003)
Vince Grolmusz, Gábor Tardos
A Note on Non-Deterministic Communication Complexity with Few Witnesses. Theory Comput. Syst. 36 (4) (2003)
Vince Grolmusz
A Note on Explicit Ramsey Graphs and Modular Sieves. Comb. Probab. Comput. 12 (5-6) (2003)
Vince Grolmusz
A Note on Set Systems with no Union of Cardinality 0 Modulo m. Discret. Math. Theor. Comput. Sci. 6 (1) (2003)
Vince Grolmusz
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. SIAM J. Comput. 32 (6) (2003)
Vince Grolmusz
Hyperdense Coding Modulo 6 with Filter-Machines CoRR (2003)
Vince Grolmusz
Defying Dimensions Mod 6 CoRR (2003)
Vince Grolmusz
Sixtors and Mod 6 Computations Electron. Colloquium Comput. Complex. (074) (2003)
Vince Grolmusz
High-density and Secure Data Transmission via Linear Combinations CoRR (2003)
Vince Grolmusz
Co-orthogonal Codes. COCOON (2002)
Vince Grolmusz, Benny Sudakov
On k-wise set-intersections and k-wise Hamming-distances. J. Comb. Theory, Ser. A 99 (1) (2002)
Vince Grolmusz
Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications CoRR (2002)
Vince Grolmusz
Set-Systems with Restricted Multiple Intersections. Electron. J. Comb. 9 (1) (2002)
Vince Grolmusz
Constructing set systems with prescribed intersection sizes. J. Algorithms 44 (2) (2002)
Vince Grolmusz
Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications Electron. Colloquium Comput. Complex. (052) (2002)
Vince Grolmusz
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. Discret. Math. Theor. Comput. Sci. 4 (2) (2001)
Vince Grolmusz
Constructive Upper Bounds for Intersecting Set Systems. Electron. Notes Discret. Math. 7 (2001)
Vince Grolmusz
Low Rank Co-Diagonal Matrices and Ramsey Graphs. Electron. J. Comb. 7 (2000)
Vince Grolmusz
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. Comb. 20 (1) (2000)
Vince Grolmusz, Gábor Tardos
) Circuits. SIAM J. Comput. 29 (4) (2000)
Vince Grolmusz
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. Algorithmica 23 (4) (1999)
Vince Grolmusz, Gábor Tardos
Lower Bounds for (MOD p - MOD m) Circuits. FOCS (1998)
Vince Grolmusz, Gábor Tardos
Lower Bounds for (MOD p -- MOD m) Circuits Electron. Colloquium Comput. Complex. 5 (36) (1998)
Vince Grolmusz
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. ICALP (1998)
Vince Grolmusz
Gates. Inf. Process. Lett. 67 (2) (1998)
Vince Grolmusz
Circuits and Multi-Party Protocols. Comput. Complex. 7 (1) (1998)
Vince Grolmusz
On Set Systems with Restricted Intersections Modulo a Composite Number. COCOON (1997)
Vince Grolmusz
Norms. Theor. Comput. Sci. 188 (1-2) (1997)
Vince Grolmusz
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). COCOON (1996)
Vince Grolmusz
Norms Electron. Colloquium Comput. Complex. 2 (46) (1995)
Vince Grolmusz
Representation of Boolean Functions. Chic. J. Theor. Comput. Sci. 1995 (1995)
Vince Grolmusz
Separating the Communication Complexities of MOD m and MOD p Circuits. J. Comput. Syst. Sci. 51 (2) (1995)
Vince Grolmusz
A weight-size trade-off for circuits with MOD m gates. STOC (1994)
Vince Grolmusz
The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal Inf. Comput. 112 (1) (1994)
Vince Grolmusz
Separating the Communication Complexities of MOD m and MOD p Circuits FOCS (1992)
Vince Grolmusz
On a Ramsey-Theoretic Property of Orders. J. Comb. Theory, Ser. A 61 (2) (1992)
Vince Grolmusz
Large Parallel Machines Can Be Extremely Slow for Small Problems. Algorithmica 6 (4) (1991)
Vince Grolmusz, Prabhakar Ragde
Incomparability in parallel computation. Discret. Appl. Math. 29 (1) (1990)
Vince Grolmusz, Prabhakar Ragde
Incomparability in Parallel Computation FOCS (1987)