default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Aszalós
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j5]László Aszalós
:
Decompose Boolean Matrices with Correlation Clustering. Entropy 23(7): 852 (2021)
2010 – 2019
- 2019
- [j4]Dávid Nagy, Tamás Mihálydeák, László Aszalós:
Different Types of Search Algorithms for Rough Sets. Acta Cybern. 24(1): 105-120 (2019) - [c18]László Aszalós, Dávid Nagy:
Selecting representatives. FedCSIS (Communication Papers) 2019: 13-19 - [c17]László Aszalós, Mária Bakó:
Correlation Clustering: Let All The Flowers Bloom! FedCSIS (Communication Papers) 2019: 21-28 - [c16]László Aszalós, Dávid Nagy:
Iterative Set Approximations Based on Tolerance Relation. IJCRS 2019: 78-90 - [c15]Dávid Nagy, László Aszalós:
Approximation Based on Representatives. IJCRS 2019: 91-101 - 2018
- [c14]Dávid Nagy, Tamás Mihálydeák, László Aszalós:
Similarity Based Rough Sets with Annotation. IJCSR 2018: 88-100 - 2017
- [c13]László Aszalós, Mária Bakó:
Contraction Methods for Correlation Clustering: The Order is Important. WCO@FedCSIS 2017: 1-13 - [c12]László Aszalós, Mária Bakó:
Correlation clustering: a parallel approach? FedCSIS 2017: 403-406 - [c11]Dávid Nagy, Tamás Mihálydeák, László Aszalós:
Similarity Based Rough Sets. IJCRS (2) 2017: 94-107 - 2016
- [c10]László Aszalós, Mária Bakó:
Correlation clustering: divide and conquer. FedCSIS (Position Papers) 2016: 73-78 - 2015
- [c9]László Aszalós, Tamás Mihálydeák:
Rough Classification in Incomplete Databases by Correlation Clustering. IFSA-EUSFLAT 2015 - [c8]László Aszalós, Tamás Mihálydeák:
Correlation clustering by contraction. FedCSIS 2015: 425-434 - 2014
- [c7]László Aszalós, Tamás Mihálydeák:
Rough Classification Based on Correlation Clustering. RSKT 2014: 399-410 - [i1]László Aszalós, Lajos Hajdu, Attila Pethö:
On a correlational clustering of integers. CoRR abs/1404.0904 (2014) - 2013
- [c6]László Aszalós, Tamás Mihálydeák:
Rough Clustering Generated by Correlation Clustering. RSFDGrC 2013: 315-324 - 2012
- [j3]László Aszalós, Tamás Herendi:
Density of Tautologies in Logics with One Variable. Acta Cybern. 20(3): 385-398 (2012) - [c5]László Aszalós, Andrea Huszti:
Payment Approval for PayWord. WISA 2012: 161-176 - 2011
- [c4]Mária Bakó, László Aszalós:
e-Learning Material for Teaching Logic. HAICTA 2011: 361-371
2000 – 2009
- 2009
- [c3]László Aszalós, Andreas Herzig:
A Protocol for Execution of Distributed Logic Programs. IDC 2009: 21-30 - 2002
- [j2]László Aszalós:
Automated Puzzle Solving. J. Appl. Non Class. Logics 12(1): 99-116 (2002) - [c2]László Aszalós, Andreas Herzig:
A logic for semi-public communication in multi-agent systems. AAMAS 2002: 950-951 - 2001
- [c1]László Aszalós, Andreas Herzig:
Reasoning about Failure. ESAW 2001: 74-85 - 2000
- [j1]László Aszalós:
The Logic of Knights, Knaves, Normals and Mutes. Acta Cybern. 14(4): 533-540 (2000)
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-04-24 23: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:
