default search action
András Lukács
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
- [j4]András Lukács:
Generating random elements of abelian groups. Random Struct. Algorithms 26(4): 437-445 (2005) - 2001
- [j3]András Lukács, Norbert Seifter:
Finite Contractions of Graphs with Polynomial Growth. Eur. J. Comb. 22(1): 85-90 (2001) - 1998
- [j2]András Lukács:
On Local Expansion of Vertex-Transitive Graphs. Comb. Probab. Comput. 7(2): 205-209 (1998) - [j1]András Lukács, Norbert Seifter:
Lattices in graphs with polynomial growth. Discret. Math. 186(1-3): 227-236 (1998)
Conference and Workshop Papers
- 2024
- [c10]Bálint Csanády, Lóránt Nagy, Dániel Boros, Iván Ivkovic, Dávid Kovács, Dalma Tóth-Lakits, Zsolt László Márkus, András Lukács:
Parameter Estimation of Long Memory Stochastic Processes with Deep Neural Networks. ECAI 2024: 2548-2555 - 2022
- [c9]Bálint Csanády, András Lukács:
Dilated Convolutional Neural Networks for Lightweight Diacritics Restoration. LREC 2022: 4253-4259 - 2020
- [c8]Gusztáv Gaál, Balázs Maga, András Lukács:
Attention U-Net Based Adversarial Architectures for Chest X-ray Lung Segmentation information. ADGN@ECAI 2020 - 2014
- [c7]Adrián Csiszárik, Szilvia Lestyán, András Lukács:
Efficient Apriori based algorithms for privacy preserving frequent itemset mining. CogInfoCom 2014: 431-435 - 2011
- [c6]Norbert Bánfi, László Dudás, Zsolt Fekete, Julianna Göbölös-Szabó, András Lukács, Ádám Nagy, Adrienn Szabó, Zoltán Szabó, Gábor Szücs:
City sentinel - VAST 2011 mini challenge 1 award: "Outstanding integration of computational and visual methods". IEEE VAST 2011: 305-306 - 2009
- [c5]András Lukács, David G. Embrick, Talmadge Wright:
The Managed Hearthstone: Labor and Emotional Work in the Online Community of World of Warcraft. FaVE 2009: 165-177 - [c4]Dóra Erdös, Zsolt Fekete, András Lukács:
Visualized subgraph search. IEEE VAST 2009: 267-268 - 2006
- [c3]Balázs Rácz, Csaba István Sidló, András Lukács, András A. Benczúr:
Two-Phase Data Warehouse Optimized for Data Mining. BIRTE 2006: 63-76 - 2005
- [c2]Csaba István Sidló, András Lukács:
Shaping SQL-Based Frequent Pattern Mining Algorithms. KDID 2005: 188-201 - 2004
- [c1]Balázs Rácz, András Lukács:
High Density Compression of Log Files. Data Compression Conference 2004: 557
Informal and Other Publications
- 2024
- [i4]Dániel Boros, Bálint Csanády, Iván Ivkovic, Lóránt Nagy, András Lukács, Zsolt László Márkus:
Deep learning the Hurst parameter of linear fractional processes and assessing its reliability. CoRR abs/2401.01789 (2024) - [i3]Bálint Csanády, Lajos Muzsai, Péter Vedres, Zoltán Nádasdy, András Lukács:
LlamBERT: Large-scale low-cost data annotation in NLP. CoRR abs/2403.15938 (2024) - 2022
- [i2]Bálint Csanády, András Lukács:
Dilated Convolutional Neural Networks for Lightweight Diacritics Restoration. CoRR abs/2201.06757 (2022) - 2020
- [i1]Gusztáv Gaál, Balázs Maga, András Lukács:
Attention U-Net Based Adversarial Architectures for Chest X-ray Lung Segmentation. CoRR abs/2003.10304 (2020)
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-28 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint