Vince Grolmusz         

Address: 

         Bulletin Board for my STUDENTS

Research interest:

• Protein information technology

• Hyperdense coding and its applications
  

• Algorithmic complexity theory, circuit- and communication complexity.
  

• Gábor Iván, Zoltán Szabadka, Vince Grolmusz: On the asymmetry of the residue compositions of the binding sites on protein surfaces; to appear in Journal of Bioinformatics and Computational Biology.
  
• Rafael Ördög, Zoltán Szabadka, Vince Grolmusz: DECOMP: A PDB decomposition tool on the web, Bioinformation Vol. 3 No. 10. pp. 413-414 (2009)
• Dániel Bánky, Rafael Ördög, Vince Grolmusz: NASCENT: An automatic protein interaction network generation tool for non-model organisms. Bioinformation Vol. 3 No. 8. pp. 361-363 (2009)
  
• Rafael Ördög, Vince Grolmusz: On the bond graphs in the Delaunay-tetrahedra of the simplicial decomposition of spatial protein structures; Proceedings of the International Workshop on Practical Applications of Computational Biology & Bioinformatics (IWPACBB'09) LNCS 5518, University of Salamanca, June 10-12, 2009. Also available as a personal preprint version.
• Gábor Iván, Zoltán Szabadka, Rafael Ördög, Vince Grolmusz, Gábor Náray-Szabó: Four Spatial Points That Define Enzyme Families, Biochemical and Biophysical Research Communications, Vol. 383, No. 4, pp. 417-420, (2009)  doi:10.1016/j.bbrc.2009.04.022; also available as a personal preprint version.
  
• K. Hill, C.B. Pénzes, B.G. Vértessy, Z. Szabadka, V. Grolmusz, É. Kiss: Amphiphilic Nature of New Antitubercular Drug Candidates and Their Interaction with Lipid Monolayer, Progr Colloid Polym Sci (2008) 135: 87–92, DOI 10.1007/2882_2008_117
  
• Vince Grolmusz:  Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication.  IEEE Transactions on Information Theory.Volume 54, Issue 8, Aug. 2008 Pages:3687 - 3692; DOI:10.1109/TIT.2008.926346
• Rafael Ördög, Vince Grolmusz: Evaluating Genetic Algorithms in Protein-Ligand Docking, Proc. Bioinformatics Research and Applications, Atlanta, GA, 2008, LNCS Vol. 4983/2008, pp. 402-413, DOI: 10.1007/978-3-540-79450-9
• Zoltán Szabadka, Rafael Ördög, Vince Grolmusz: The Ramachandran Map of More Than 6,500 Perfect Polypeptide Chains,
  Biophysical Reviews and Letters, Vol 2, No. 3/4 (2007), pp. 267-271, DOI:10.1142/S1793048007000519
• Rafael Ordog, Zoltán Szabadka, Vince Grolmusz: Analyzing the Simplicial Decomposition of Spatial Protein Structures; 6th International Conference on Bioinformatics (InCoB 2007), Hong Kong University of Science and Technology, Hong Kong, 27th-30th August, 2007; Journal version: BMC Bioinformatics,  2008, 9(Suppl 1):S11(doi:10.1186/1471-2105-9-S1-S11), http://www.biomedcentral.com/1471-2105/9/S1/S11
• Zoltán Szabadka, Gábor Iván, Vince Grolmusz: Being a Binding-Site: Characterizing Residue-Composition of Binding Sites on Proteins, 6th International Conference on Bioinformatics (InCoB 2007), Hong Kong University of Science and Technology, Hong Kong, 27th-30th August, 2007. Journal version: Bioinformation 2(5), 216-221 (2007), http://www.bioinformation.net/002/004800022007.htm
  
• Building a Structured PDB: The RS-PDB Database,  joint work with Zoltán Szabadka. Proceedings of the 28th IEEE EMBS Annual International Conference, New York City, Aug. 30-Sept 3, 2006., pp. 5755-5758.
  
• High Throughput Processing of the Structural Information of the Protein Data Bank, joint work with Zoltán Szabadka, DIMACS Workshop on Information Processing by Protein Structures in Molecular Recognition, June 13 - 14, 2005, DIMACS Center,  Rutgers University. Preprint version. Journal version  Journal of Molecular Graphics and Modeling.25 (2007) pp. 831-836 http://dx.doi.org/10.1016/j.jmgm.2006.08.004
• Grolmusz, V.: On some applications of randomized memory. Proceedings of the GRACO 2005, Angra dos Reis, Brazil, 27-29 April 2005. Electronic Notes in Discrete Mathematics, Vol. 19, 2005, pp. 203-209
• Generalized Secure Routerless Routing, joint work with Zoltán Király. Proceedings of the 4th International Conference on Networking, (ICN) Reunion Island, France, April 17-21, 2005, in the LNCS Series No. 3421, pp. 454-462; C Springer-Verlag;
• Secure Routerless Routing, Joint work with Zoltán Király.  Proceedings of the Workshop "Future Directions in Network Architectures 2004" of the SIGCOMM'04 Conference, Portland, Oregon, August 30-September 3 2004
• Defying Dimensions Modulo 6, ECCC Report TR03-058
• Near Quadratic Matrix Multiplication Modulo Composites,  ECCC Report TR03-001,
• A Note on Non-Deterministic Communication Complexity with Few Witnesses, Joint work with Gábor Tardos, Journal version: Theory of Computing Systems, Vol. 36, No.4. pp. 387-391
• A Note on Explicit Ramsey Graphs and Modular Sieves, (also in PDF),  Combinatorics, Probability and Computing Vol. 12, (2003) pp. 565-569 (an invited paper).
• Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications, ECCC Report TR02-052, ( also in PDF), Journal version:  SIAM Journal on Computing, Vol. 32, No. 6 (2003), pp 1475-1487.
• Co-Orthogonal Codes, (also in PDF), Proceedings of the COCOON'2002, Singapore, August, 2002, Published in the LNCS Series No. 2387, pp. 144-152; C Springer-Verlag; Journal version: Designs, Codes and Cryptography Vol. 38, No. 3 (2006) pp. 363-372
• Pairs of Codes with Prescribed Hamming Distances and Coincidences (also in PDF), DIMACS Technical Report No. 2002-09. Journal version: Designs, Codes and Cryptography,  Vol 41 (2006) , No. 1., pp. 87-99.
  
• A Trade-Off for Covering the Off-Diagonal Elements of Matrices, (also in PDF), DIMACS Technical Report No. 2002-01
• k-wise Set-Intersections and k-wise Hamming-Distances   (also in PDF), joint work with Benny Sudakov, DIMACS Technical Report No. 2001-11. Journal version: J. Combin. Theory Ser. A 99 (2002), no. 1, 180--190.
• Set-Systems with Restricted Multiple Intersections, (also in PDF) Electronic Journal of Combinatorics,  Vol. 9, (2002), No. 1, R8
• Constructing Set-Systems with Prescribed Intersection Sizes, (also in PDF) DIMACS Technical Report No. 2001-03, Also in the  Journal of Algorithms, Vol. 44 (2002), pp. 321-337.
• A Note on Set Systems with no Union of Cardinality 0 Modulo m, (also in PDF)DIMACS Technical Report No. 2000-11; also in DMTCS, Vol 6, No. 1 (2003), pp 41-44.
• Low Rank Co-Diagonal Matrices and Ramsey Graphs, Electronic Journal of Combinatorics,  Vol. 7, (2000), No. 1, R15
• Lower Bounds for (MOD p, MOD m) Circuits, Joint work with Gábor Tardos,  ECCC Report TR98-036,   Conference version: Proceedings of FOCS'98, Palo Alto, California, November 1998, pp. 279-289;  Journal version: SIAM Journal on Computing, Vol. 29, (2000), No. 4, pp. 1209-1222
• A Degree-Decreasing Lemma for (MOD q-MOD p) Circuits,  DMTCS Vol. 4. (2001) No. 2. pp. 247-254. A preliminary version appeared in the Proceedings of ICALP'98, Aalborg, Denmark, July 1998, LNCS 1443, pp. 215-213,
• Superpolynomial Size Set-Systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs (PS or PDF) Journal version: Combinatorica, Vol. 20, (2000), No. 1, pp. 73-88. Preliminary version appeared in the  Proceedings of  COCOON'97, Shanghai, August 20-22, 1997, LNCS 1276, pp. 82-90.
• Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (also in PDF) Algorithmica  Vol. 23. (1999) pp. 341-353 (an invited paper). Also in Proceedings of COCOON'96, Hong Kong, June 17-19, 1996, LNCS 1090, pp. 142-151.
•  Circuits and Multi-Party Protocols,  (also in PDF) computational complexity Vol. 7, (1998), pp. 1-18.
• On the Power of Circuits with Gates of Low L_1 Norms ECCC Report TR95-046 Journal version: Theoretical Computer Science A, Vol. 188, (1997), pp. 117-127.
• On the weak mod m representation of Boolean functions, CJTCS Vol. 1995 No. 2
• A Weight-Size Trade-Off for Circuits with MOD m Gates, (also in PDF) Proc. 26th ACM STOC, Montreal, 1994, pp. 68-74
• The BNS Lower Bound for Multi--Party Protocols is Nearly Optimal (also in PDF) Information and Computation, Vol. 112, (1994) No. 1, pp. 51--54.
• Separating the Communication Complexities of MOD m and MOD p Circuits, (also in PDF), Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), Pittsburgh, 1992, pp. 278-287, Journal version:  Journal of Computer and Systems Sciences, Vol. 51, (1995), No. 2, pp. 307-313
• Large Parallel Machines Can be Extremely Slow for Small Problems;  (also in PDF) Algorithmica, Vol. 6, (1991), pp. 479-489.

Publication List

Citations

Grant history

GNUpg Key