Cím: 
-
Eötvös Loránd
Tudományegyetem
-
Számítógéptudományi
Tanszék
-
H-1117 Budapest
-
Pázmány Péter sétány 1/C, 3-614-es szoba
-
E-mail: grolmusz@cs.elte.hu
-
Fax: +36-1-381-2231
Kutatási terület:
Algoritmikus bonyolultságelmélet, Boole-hálózatok
bonyolultsága, kommunikációs bonyolultság.
Boole hálózatok mod kapukkal. Boole-függvények
polinom-reprezentációja. Többrésztvevõs
kommunikációs bonyolultság. Adatbányászat.
Kódok és kriptográfia. Kombinatorika.
Bõvebben: Kutatási eredmények részletesebb
összefoglalása.
On-line cikkek:
-
Secure Routerless
Routing, Joint work with Zoltán
Király. To appear in the Proceedings of the Workshop "Future
Directions in Network Architectures 2004" of the SIGCOMM'04
Conference, Portland, Oregon, August 30-September 3 2004 (©
ACM 2004, only for your personal use, not for re-distribution).
-
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; © Springer-Verlag
-
Pairs of
Codes with Prescribed Hamming Distances and Coincidences (also
in PDF),
DIMACS
Technical Report No. 2002-09.
-
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.