Vince Grolmusz

Available identifiers

zbMath Open grolmusz.vinceDBLPg/VinceGrolmuszWikidataQ51529200 ScholiaQ51529200MaRDI QIDQ236918

List of research outcomes

Publication	Date of Publication	Type
Harmonic analysis, real approximation, and the communication complexity of Boolean functions	2024-01-29	Paper
A weight-size trade-off for circuits with MOD \(m\) gates	2016-09-01	Paper
A lower bound for depth-3 circuits with MOD \(m\) gates	2016-06-09	Paper
A note on the PageRank of undirected graphs	2015-05-21	Paper
The Erdős Webgraph Server	2014-03-27	Paper
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication	2009-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q3439684	2007-05-29	Paper
Pairs of codes with prescribed Hamming distances and coincidences	2006-11-22	Paper
Co-orthogonal codes	2006-05-29	Paper
A Note on Explicit Ramsey Graphs and Modular Sieves	2005-03-08	Paper
https://portal.mardi4nfdi.de/entity/Q4808632	2004-08-12	Paper
Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications	2003-09-28	Paper
A note on non-deterministic communication complexity with few witnesses	2003-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4483921	2003-05-27	Paper
Constructing set systems with prescribed intersection sizes	2003-05-14	Paper
On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances	2003-03-26	Paper
Set-systems with restricted multiple intersections	2002-03-04	Paper
https://portal.mardi4nfdi.de/entity/Q4230350	2002-01-21	Paper
A degree-decreasing lemma for \((\text{MOD}_q - \text{MOD}_p)\) circuits	2002-01-07	Paper
Constructive upper bounds for intersecting set systems	2001-10-24	Paper
Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs	2000-11-13	Paper
Low rank co-diagonal matrices and Ramsey graphs	2000-04-16	Paper
Lower Bounds for (MODp - MODm) Circuits	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4259977	1999-09-07	Paper
Harmonic analysis, real approximation, and the communication complexity of Boolean functions	1999-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q4219029	1998-12-13	Paper
Circuits and multi-party protocols	1998-11-19	Paper
On the power of circuits with gates of low \(L_{1}\) norms.	1998-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q4364578	1998-06-01	Paper
The BNS lower bound for multi-party protocols is nearly optimal	1994-06-19	Paper
On a Ramsey-theoretic property of orders	1993-01-17	Paper
Large parallel machines can be extremely slow for small problems	1991-01-01	Paper
Incomparability in parallel computation	1990-01-01	Paper

Research outcomes over time

This page was built for person: Vince Grolmusz