default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMáté Matolcsi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Gergely Ambrus
, Adrián Csiszárik, Máté Matolcsi, Dániel Varga, Pál Zsámboki:
The density of planar sets avoiding unit distances. Math. Program. 207(1): 303-327 (2024)- 2022
- [j17]Gergely Ambrus, Máté Matolcsi:
Density Estimates of 1-Avoiding Sets via Higher Order Correlations. Discret. Comput. Geom. 67(4): 1245-1256 (2022) - 2021
- [j16]Máté Matolcsi, Mihály Weiner:
A Rigidity Property of Complete Systems of Mutually Unbiased Bases. Open Syst. Inf. Dyn. 28(3): 2150012:1-2150012:6 (2021) - 2020
- [j15]Károly J. Böröczky, Máté Matolcsi, Imre Z. Ruzsa, Francisco Santos, Oriol Serra:
Triangulations and a Discrete Brunn-Minkowski Inequality in the Plane. Discret. Comput. Geom. 64(2): 396-426 (2020)
2010 – 2019
- 2016
- [j14]Tamás Keleti, Máté Matolcsi, Fernando Mário de Oliveira Filho, Imre Z. Ruzsa:
Better Bounds for Planar Sets Avoiding Unit Distances. Discret. Comput. Geom. 55(3): 642-661 (2016) - 2015
- [j13]Máté Matolcsi, Mihály Weiner:
An Improvement on the Delsarte-Type LP-Bound with Application to MUBs. Open Syst. Inf. Dyn. 22(1): 1550001:1-1550001:10 (2015) - 2013
- [j12]Máté Matolcsi, Imre Z. Ruzsa, Mihály Weiner:
Systems of mutually unbiased Hadamard matrices containing real and complex matrices. Australas. J Comb. 55: 35-48 (2013) - [j11]Romanos Malikiosis, Máté Matolcsi, Imre Z. Ruzsa:
A note on the pyjama problem. Eur. J. Comb. 34(7): 1071-1077 (2013) - [j10]Máté Matolcsi, Imre Z. Ruzsa:
Sets with no solutions to x+y=3zx+y=3z. Eur. J. Comb. 34(8): 1411-1414 (2013) - [j9]Christine Bachoc, Máté Matolcsi, Imre Z. Ruzsa:
Squares and Difference Sets in Finite Fields. Integers 13: A77 (2013) - 2010
- [j8]Philippe Jaming, Máté Matolcsi, Péter Móra:
The problem of mutually unbiased bases in dimension 6. Cryptogr. Commun. 2(2): 211-220 (2010) - [j7]Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa:
A superadditivity and submultiplicativity property for cardinalities of sumsets. Comb. 30(2): 163-174 (2010)
2000 – 2009
- 2008
- [j6]Máté Matolcsi, Ferenc Szöllösi:
Towards a Classification of 6 × 6 Complex Hadamard Matrices. Open Syst. Inf. Dyn. 15(2): 93-108 (2008) - [j5]Wojciech Czaja, Philippe Jaming, Máté Matolcsi:
An efficient algorithm for positive realizations. Syst. Control. Lett. 57(5): 436-441 (2008) - 2007
- [j4]Máté Matolcsi, Júlia Réffy, Ferenc Szöllösi:
Constructions of Complex Hadamard Matrices via Tiling Abelian Groups. Open Syst. Inf. Dyn. 14(3): 247-264 (2007) - [j3]Béla Nagy, Máté Matolcsi, Márta Szilvási:
Order Bound for the Realization of a Combination of Positive Filters. IEEE Trans. Autom. Control. 52(4): 724-729 (2007) - 2006
- [c1]Béla Nagy, Máté Matolcsi, Márta Szilvási:
Positive Decomposition of Transfer Functions with Multiple Poles. POSTA 2006: 335-342 - 2005
- [j2]Béla Nagy, Máté Matolcsi:
Minimal positive realizations of transfer functions with nonnegative multiple poles. IEEE Trans. Autom. Control. 50(9): 1447-1450 (2005) - [j1]Andrea Halmschlager, Máté Matolcsi:
Minimal positive realizations for a class of transfer functions. IEEE Trans. Circuits Syst. II Express Briefs 52-II(4): 177-180 (2005)
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 2025-01-09 13:10 CET 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:
