default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVince Grolmusz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]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: 108863 (2024)- 2023
- [i17]Vince Grolmusz:
A Note on the LogRank Conjecture in Communication Complexity. CoRR abs/2310.03355 (2023) - [i16]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 abs/2312.05791 (2023) - 2022
- [j35]Balázs Szalkai, Vince Grolmusz:
SCARF: a biomedical association rule finding webserver. J. Integr. Bioinform. 19(1) (2022) - [j34]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) - 2020
- [i15]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 abs/2010.09568 (2020)
2010 – 2019
- 2019
- [c15]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: 1-5 - [c14]Máté Fellner, Bálint Varga, Vince Grolmusz:
The Frequent Complete Subgraphs in the Human Connectome. IWANN (2) 2019: 908-920 - 2018
- [j33]Balázs Szalkai, Vince Grolmusz:
SECLAF: a webserver and deep neural network design tool for hierarchical biological sequence classification. Bioinform. 34(14): 2487-2489 (2018) - 2017
- [i14]Balázs Szalkai, Vince Grolmusz:
Near Perfect Protein Multi-Label Classification with Deep Neural Networks. CoRR abs/1703.10663 (2017) - [i13]Balázs Szalkai, Vince Grolmusz:
SCARF: A Biomedical Association Rule Finding Webserver. CoRR abs/1709.09850 (2017) - 2015
- [j32]Vince Grolmusz:
A note on the PageRank of undirected graphs. Inf. Process. Lett. 115(6-8): 633-634 (2015) - 2014
- [j31]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: 315-317 (2014) - 2012
- [i12]Vince Grolmusz:
A Note on the PageRank of Undirected Graphs. CoRR abs/1205.1960 (2012) - 2011
- [j30]Gábor Iván, Vince Grolmusz:
When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks. Bioinform. 27(3): 405-407 (2011) - 2010
- [j29]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): 594-608 (2010)
2000 – 2009
- 2009
- [j28]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): 931-938 (2009) - [c13]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
- [j27]Rafael Ördög, Zoltan Szabadka, Vince Grolmusz:
Analyzing the simplicial decomposition of spatial protein structures. BMC Bioinform. 9(S-1) (2008) - [j26]Vince Grolmusz:
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication. IEEE Trans. Inf. Theory 54(8): 3687-3692 (2008) - [c12]Rafael Ördög, Vince Grolmusz:
Evaluating Genetic Algorithms in Protein-Ligand Docking. ISBRA 2008: 402-413 - 2006
- [j25]Vince Grolmusz:
Co-Orthogonal Codes. Des. Codes Cryptogr. 38(3): 363-372 (2006) - [j24]Vince Grolmusz:
Pairs of codes with prescribed Hamming distances and coincidences. Des. Codes Cryptogr. 41(1): 87-99 (2006) - [c11]Zoltan Szabadka, Vince Grolmusz:
Building a Structured PDB: The RS-PDB Database. EMBC 2006: 5755-5758 - 2005
- [j23]Vince Grolmusz:
On some applications of randomized memory. Electron. Notes Discret. Math. 19: 203-209 (2005) - [c10]Vince Grolmusz, Zoltán Király:
Generalized Secure Routerless Routing. ICN (2) 2005: 454-462 - 2004
- [c9]Vince Grolmusz, Zoltán Király:
Secure routerless routing. FDNA@SIGCOMM 2004: 21-27 - 2003
- [j22]Vince Grolmusz:
A Note on Explicit Ramsey Graphs and Modular Sieves. Comb. Probab. Comput. 12(5-6): 565-569 (2003) - [j21]Vince Grolmusz:
A Note on Set Systems with no Union of Cardinality 0 Modulo m. Discret. Math. Theor. Comput. Sci. 6(1): 41-44 (2003) - [j20]Vince Grolmusz, Gábor Tardos:
A Note on Non-Deterministic Communication Complexity with Few Witnesses. Theory Comput. Syst. 36(4): 387-391 (2003) - [j19]Vince Grolmusz:
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. SIAM J. Comput. 32(6): 1475-1487 (2003) - [i11]Vince Grolmusz:
Near Quadratic Matrix Multiplication Modulo Composites. CoRR cs.CC/0301004 (2003) - [i10]Vince Grolmusz:
Hyperdense Coding Modulo 6 with Filter-Machines. CoRR cs.CC/0306049 (2003) - [i9]Vince Grolmusz:
Defying Dimensions Mod 6. CoRR cs.CC/0307020 (2003) - [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. Electron. Colloquium Comput. Complex. TR03 (2003) - [i6]Vince Grolmusz:
Defying Dimensions Modulo 6. Electron. Colloquium Comput. Complex. TR03 (2003) - [i5]Vince Grolmusz:
Sixtors and Mod 6 Computations. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j18]Vince Grolmusz:
Set-Systems with Restricted Multiple Intersections. Electron. J. Comb. 9(1) (2002) - [j17]Vince Grolmusz:
Constructing set systems with prescribed intersection sizes. J. Algorithms 44(2): 321-337 (2002) - [j16]Vince Grolmusz, Benny Sudakov:
On k-wise set-intersections and k-wise Hamming-distances. J. Comb. Theory A 99(1): 180-190 (2002) - [c8]Vince Grolmusz:
Co-orthogonal Codes. COCOON 2002: 144-152 - [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. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j15]Vince Grolmusz:
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. Discret. Math. Theor. Comput. Sci. 4(2): 247-254 (2001) - [j14]Vince Grolmusz:
Constructive Upper Bounds for Intersecting Set Systems. Electron. Notes Discret. Math. 7: 54-57 (2001) - 2000
- [j13]Vince Grolmusz:
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. Comb. 20(1): 71-86 (2000) - [j12]Vince Grolmusz:
Low Rank Co-Diagonal Matrices and Ramsey Graphs. Electron. J. Comb. 7 (2000) - [j11]Vince Grolmusz, Gábor Tardos:
Lower Bounds for (MODp-MODm) Circuits. SIAM J. Comput. 29(4): 1209-1222 (2000)
1990 – 1999
- 1999
- [j10]Vince Grolmusz:
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. Algorithmica 23(4): 341-353 (1999) - 1998
- [j9]Vince Grolmusz:
Circuits and Multi-Party Protocols. Comput. Complex. 7(1): 1-18 (1998) - [j8]Vince Grolmusz:
A Lower Bound for Depth-3 Circuits with MOD m Gates. Inf. Process. Lett. 67(2): 87-90 (1998) - [c7]Vince Grolmusz, Gábor Tardos:
Lower Bounds for (MOD p - MOD m) Circuits. FOCS 1998: 279-289 - [c6]Vince Grolmusz:
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. ICALP 1998: 215-222 - [i2]Vince Grolmusz, Gábor Tardos:
Lower Bounds for (MOD p -- MOD m) Circuits. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j7]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
- [j6]Vince Grolmusz:
On the Weak mod m Representation of Boolean Functions. Chic. J. Theor. Comput. Sci. 1995 (1995) - [j5]Vince Grolmusz:
Separating the Communication Complexities of MOD m and MOD p Circuits. J. Comput. Syst. Sci. 51(2): 307-313 (1995) - [i1]Vince Grolmusz:
On the Power of Circuits with Gates of Low L1 Norms. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j4]Vince Grolmusz:
The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal. Inf. Comput. 112(1): 51-54 (1994) - [c3]Vince Grolmusz:
A weight-size trade-off for circuits with MOD m gates. STOC 1994: 68-74 - 1992
- [j3]Vince Grolmusz:
On a Ramsey-Theoretic Property of Orders. J. Comb. Theory 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. Discret. Appl. Math. 29(1): 63-78 (1990)
1980 – 1989
- 1987
- [c1]Vince Grolmusz, Prabhakar Ragde:
Incomparability in Parallel Computation. FOCS 1987: 89-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
