default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGergely Kovásznai
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Mohammed Ridha Nsaif
, Gergely Kovásznai, Ali Malik, Ruairí de Fréin:
SM-FPLF: Link-State Prediction for Software-Defined DCN Power Optimization. IEEE Access 12: 79496-79518 (2024)- 2023
- [j3]Gergely Kovásznai, Mohammed Ridha Nsaif:
Integer Programming Based Optimization of Power Consumption for Data Center Networks. Acta Cybern. 26(3): 563-579 (2023) - [e2]Zsolt Gazdag, Szabolcs Iván, Gergely Kovásznai:
Proceedings of the 16th International Conference on Automata and Formal Languages, AFL 2023, Eger, Hungary, September 5-7, 2023. EPTCS 386, 2023 [contents] - 2020
- [e1]Gergely Kovásznai, István Fazekas, Tibor Tómács:
Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020), Eger, Hungary, January 29-31, 2020. CEUR Workshop Proceedings 2650, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [c10]Gergely Kovásznai, Krisztián Gajdár, Laura Kovács:
Portfolio SAT and SMT Solving of Cardinality Constraints in Sensor Network Optimization. SYNASC 2019: 85-91 - 2017
- [c9]Gergely Kovásznai, Csaba Biró, Balazs Erdelyi:
Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers. SMT 2017: 15-27 - 2016
- [j2]Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
Complexity of Fixed-Size Bit-Vector Logics. Theory Comput. Syst. 59(2): 323-376 (2016) - 2014
- [c8]Gergely Kovásznai, Helmut Veith, Andreas Fröhlich, Armin Biere:
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic. MFCS (2) 2014: 481-492 - [c7]Andreas Fröhlich, Gergely Kovásznai, Armin Biere, Helmut Veith:
iDQ: Instantiation-Based DQBF Solving. POS@SAT 2014: 103-116 - 2013
- [c6]Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into. CADE 2013: 443-449 - [c5]Andreas Fröhlich, Gergely Kovásznai, Armin Biere:
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding. CSR 2013: 378-390 - 2012
- [c4]Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width. SMT@IJCAR 2012: 44-56 - 2011
- [c3]Gergely Kovásznai:
Developing an expert system for diet recommendation. SACI 2011: 505-509
2000 – 2009
- 2009
- [c2]László Kovács, Gergely Kovásznai, Gábor Kusper:
Metamodels in generation of UML using NLI-based dialog. SACI 2009: 29-34 - 2006
- [j1]Gergely Kovásznai:
HyperS Tableaux - Heuristic Hyper Tableaux. Acta Cybern. 17(2): 325-338 (2006) - 2003
- [c1]Gergely Kovásznai, Constantine Kotropoulos, Ioannis Pitas:
CAML - A Universal Configuration Language for Dialogue Systems. DEXA 2003: 896-906
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-09-21 23:41 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:
