Vince Grolmusz

Orcid: 0000-0001-9456-8876

According to our database1, Vince Grolmusz authored at least 59 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Opening Amyloid-Windows to the secondary structure of proteins: The amyloidogenecity increases tenfold inside beta-sheets.
Comput. Biol. Medicine, 2024

2023
Gluing GAP to RAS Mutants: A New Approach to an Old Problem in Cancer Drug Development.
CoRR, 2023

A Note on the LogRank Conjecture in Communication Complexity.
CoRR, 2023

2022
On the border of the amyloidogenic sequences: prefix analysis of the parallel beta sheets in the PDB_Amyloid collection.
J. Integr. Bioinform., 2022

SCARF: a biomedical association rule finding webserver.
J. Integr. Bioinform., 2022

2020
Introducing and Applying Newtonian Blurring: An Augmented Dataset of 126, 000 Human Connectomes at braingraph.org.
CoRR, 2020

2019
The Frequent Complete Subgraphs in the Human Connectome.
Proceedings of the Advances in Computational Intelligence, 2019

Good Neighbors, Bad Neighbors: The Frequent Network Neighborhood Mapping of the Hippocampus Enlightens Several Structural Factors of the Human Intelligence.
Proceedings of the 12th International Congress on Image and Signal Processing, 2019

2018
SECLAF: a webserver and deep neural network design tool for hierarchical biological sequence classification.
Bioinform., 2018

2017
Near Perfect Protein Multi-Label Classification with Deep Neural Networks.
CoRR, 2017

2015
A note on the PageRank of undirected graphs.
Inf. Process. Lett., 2015

2014
The Erdős webgraph server.
Discret. Appl. Math., 2014

2011
When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks.
Bioinform., 2011

2010
Cysteine and tryptophan anomalies found when scanning all the binding sites in the Protein Data Bank.
Int. J. Bioinform. Res. Appl., 2010

2009
On the Asymmetry of the Residue Compositions of the Binding Sites on protein Surfaces.
J. Bioinform. Comput. Biol., 2009

On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures.
Proceedings of the Distributed Computing, 2009

2008
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication.
IEEE Trans. Inf. Theory, 2008

Analyzing the simplicial decomposition of spatial protein structures.
BMC Bioinform., 2008

Evaluating Genetic Algorithms in Protein-Ligand Docking.
Proceedings of the Bioinformatics Research and Applications, 2008

2006
Pairs of codes with prescribed Hamming distances and coincidences.
Des. Codes Cryptogr., 2006

Co-Orthogonal Codes.
Des. Codes Cryptogr., 2006

Building a Structured PDB: The RS-PDB Database.
Proceedings of the 28th International Conference of the IEEE Engineering in Medicine and Biology Society, 2006

2005
On some applications of randomized memory.
Electron. Notes Discret. Math., 2005

Generalized Secure Routerless Routing.
Proceedings of the Networking, 2005

2004
Secure routerless routing.
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture, 2004

2003
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications.
SIAM J. Comput., 2003

A Note on Non-Deterministic Communication Complexity with Few Witnesses.
Theory Comput. Syst., 2003

Sixtors and Mod 6 Computations
Electron. Colloquium Comput. Complex., 2003

Defying Dimensions Modulo 6
Electron. Colloquium Comput. Complex., 2003

Near Quadratic Matrix Multiplication Modulo Composites
Electron. Colloquium Comput. Complex., 2003

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

A Note on Explicit Ramsey Graphs and Modular Sieves.
Comb. Probab. Comput., 2003

High-density and Secure Data Transmission via Linear Combinations
CoRR, 2003

Defying Dimensions Mod 6
CoRR, 2003

Hyperdense Coding Modulo 6 with Filter-Machines
CoRR, 2003

2002
On k-wise set-intersections and k-wise Hamming-distances.
J. Comb. Theory A, 2002

Constructing set systems with prescribed intersection sizes.
J. Algorithms, 2002

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

Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications
CoRR, 2002

Set-Systems with Restricted Multiple Intersections.
Electron. J. Comb., 2002

2001
Constructive Upper Bounds for Intersecting Set Systems.
Electron. Notes Discret. Math., 2001

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

2000
Lower Bounds for (MOD<sub>p</sub>-MOD<sub>m</sub>) Circuits.
SIAM J. Comput., 2000

Low Rank Co-Diagonal Matrices and Ramsey Graphs.
Electron. J. Comb., 2000

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

1999
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions.
Algorithmica, 1999

1998
A Lower Bound for Depth-3 Circuits with MOD <i>m</i> Gates.
Inf. Process. Lett., 1998

Lower Bounds for (MOD p -- MOD m) Circuits
Electron. Colloquium Comput. Complex., 1998

Circuits and Multi-Party Protocols.
Comput. Complex., 1998

1997
On the Power of Circuits with Gates of Low L<sub>1</sub> Norms.
Theor. Comput. Sci., 1997

On Set Systems with Restricted Intersections Modulo a Composite Number.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Separating the Communication Complexities of MOD m and MOD p Circuits.
J. Comput. Syst. Sci., 1995

On the Weak mod <i>m</i> Representation of Boolean Functions.
Chic. J. Theor. Comput. Sci., 1995

1994
The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal
Inf. Comput., July, 1994

A weight-size trade-off for circuits with MOD m gates.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1992
On a Ramsey-Theoretic Property of Orders.
J. Comb. Theory A, 1992

1991
Large Parallel Machines Can Be Extremely Slow for Small Problems.
Algorithmica, 1991

1990
Incomparability in parallel computation.
Discret. Appl. Math., 1990


  Loading...