Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Grolmusz, Vince - Institute of Mathematics, Eötvös Loránd University
Large Parallel Machines can be Extremely Slow for Small Problems
Separating the Communication Complexities of MOD m and MOD p Circuits
A Weight--Size Trade--Off for Circuits with MOD m Gates Vince Grolmusz
BIOINFORMATICS Vol. 00 no. 00 2010
A Note on Explicit Ramsey Graphs and Modular Sieves
Co-Orthogonal Codes Extended Abstract
CIRCUITS AND MULTI--PARTY Vince Grolmusz
Harmonic Analysis, Real Approximation, and the Communication Complexity of
The BNS Lower Bound for Multi--Party Protocols is Nearly Optimal
DIMACS Technical Report 200011 A Note on Set Systems with no Union of Cardinality 0
A Note on NonDeterministic Communication Complexity with Few Witnesses
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix
Cysteine and Tryptophan Anomalies Found when Scanning all the Binding Sites in the Protein Data Bank
Complexity of Algorithms Lecture Notes, Spring 1999
A Hybrid Clustering of Protein Binding Sites Gabor Ivan1,2
The Ramachandran Map of More Than 6,500 Perfect Polypeptide Chains
On the bond graphs in the Delaunay-tetrahedra of the simplicial decomposition of spatial protein
This is a personal preprint version of the paper, that is published in the Biochemical and Biophysical Research Communications in a more polished, peer-reviewed form. The DOI: doi:10.1016/j.bbrc.2009.04.022
Progr Colloid Polym Sci (2008) 135: 8792 DOI 10.1007/2882_2008_117
A Note on Explicit Ramsey Graphs and Modular Sieves
On the Asymmetry of the Residue Compositions of the Binding Sites on Protein Surfaces
Separating the Communication Complexities of MOD m and MOD p Circuits
Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications
High Throughput Processing of the Structural Information in the Protein Data Bank
