default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Szegedy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy:
Random homomorphisms into the orthogonality graph. J. Comb. Theory B 167: 392-444 (2024)- [i1]Balázs Szegedy, Domonkos Czifra, Péter Korösi-Szabó:
Dynamic Memory Based Adaptive Optimization. CoRR abs/2402.15262 (2024) - 2023
- [j14]Péter Csikvári, Balázs Szegedy:
On Sidorenko's conjecture for determinants and Gaussian Markov random fields. Random Struct. Algorithms 62(2): 335-375 (2023) - 2022
- [j13]Pablo Candela
, Diego González-Sánchez, Balázs Szegedy:
A refinement of Cauchy-Schwarz complexity. Eur. J. Comb. 106: 103592 (2022)
2010 – 2019
- 2019
- [j12]Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy:
Measures on the square as sparse graph limits. J. Comb. Theory B 138: 1-40 (2019) - 2018
- [j11]Hamed Hatami, Svante Janson, Balázs Szegedy:
Graph properties, graph limits, and entropy. J. Graph Theory 87(2): 208-229 (2018) - [j10]Ágnes Backhausz, Balázs Szegedy:
On large-girth regular graphs and random processes on trees. Random Struct. Algorithms 53(3): 389-416 (2018) - 2015
- [j9]Ágnes Backhausz, Balázs Szegedy, Bálint Virág:
Ramanujan graphings and correlation decay in local algorithms. Random Struct. Algorithms 47(3): 424-435 (2015) - 2012
- [j8]László Lovász, Balázs Szegedy:
Random graphons and a weak Positivstellensatz for graphs. J. Graph Theory 70(2): 214-225 (2012) - 2011
- [j7]Balázs Szegedy:
Limits of kernel operators and the spectral regularity lemma. Eur. J. Comb. 32(7): 1156-1167 (2011) - [j6]László Lovász, Balázs Szegedy:
Finitely forcible graphons. J. Comb. Theory B 101(5): 269-301 (2011)
2000 – 2009
- 2009
- [j5]László Lovász, Balázs Szegedy:
Contractors and connectors of graph algebras. J. Graph Theory 60(1): 11-30 (2009) - 2007
- [j4]Balázs Szegedy:
Coverings of Abelian groups and vector spaces. J. Comb. Theory A 114(1): 20-34 (2007) - 2006
- [j3]Balázs Szegedy, Christian Szegedy:
Symplectic Spaces And Ear-Decomposition Of Matroids. Comb. 26(3): 353-377 (2006) - [j2]László Lovász, Balázs Szegedy:
Limits of dense graph sequences. J. Comb. Theory B 96(6): 933-957 (2006) - [c2]Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi:
Graph limits and parameter testing. STOC 2006: 261-270 - 2005
- [c1]Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans:
Group-theoretic Algorithms for Matrix Multiplication. FOCS 2005: 379-388 - 2001
- [j1]Balázs Szegedy:
Tilings of the Square With Similar Right Triangles. Comb. 21(1): 139-144 (2001)
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 2024-10-07 21:20 CEST 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:
