Vince Grolmusz

68 papers A* 5Misc 3Journal 53Unranked 7

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