default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek A. Suchenek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Marek A. Suchenek:
Worst-Case Analysis of Heapsort, Exactly. Comput. J. 67(3): 812-824 (2024)
2010 – 2019
- 2017
- [i4]Marek A. Suchenek:
Elementary Yet Precise Worst-case Analysis of MergeSort, A short version (SV). CoRR abs/1702.08443 (2017) - 2016
- [i3]Marek A. Suchenek:
Best-case Analysis of MergeSort with an Application to the Sum of Digits Problem, A manuscript (MS). CoRR abs/1607.04604 (2016) - 2015
- [i2]Marek A. Suchenek:
Technical Notes on Complexity of the Satisfiability Problem. CoRR abs/1504.01092 (2015) - [i1]Marek A. Suchenek:
A Complete Worst-Case Analysis of Heapsort with Experimental Verification of Its Results, A manuscript (MS). CoRR abs/1504.01459 (2015) - 2012
- [j7]Marek A. Suchenek:
Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program. Fundam. Informaticae 120(1): 75-92 (2012)
2000 – 2009
- 2000
- [j6]Marek A. Suchenek:
Evaluation of Queries under Closed-World Assumption. Part II: The Hierarchical Case. J. Autom. Reason. 25(4): 247-289 (2000) - [c6]Marek A. Suchenek:
Sound and Complete Propositional Nonmonotonic Logic of Hierarchically-Minimal Models. Intelligent Information Systems 2000: 193-205
1990 – 1999
- 1997
- [j5]Marek A. Suchenek:
Evaluation of Queries under Closed-World Assumption. J. Autom. Reason. 18(3): 357-398 (1997) - 1994
- [j4]Marek A. Suchenek:
Preservation properties in deductive databases. Methods Log. Comput. Sci. 1(3): 315-338 (1994) - 1993
- [j3]Marek A. Suchenek:
First -Order Syntactic Characterizations of Minimal Entailment, Domain-Minimal Entailment, and Herbrand Entailment. J. Autom. Reason. 10(2): 237-263 (1993) - [c5]Marek A. Suchenek, Henrietta Okeke:
Mesh models of knowledge in distributed systems. PDP 1993: 113-120 - 1990
- [j2]Marek A. Suchenek:
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models. Int. J. Found. Comput. Sci. 1(1): 49-60 (1990) - [c4]Marek A. Suchenek, Rajshekhar Sunderraman:
On reasoning from Closed World Databases with Disjunctive Views. LPNMR 1990: 132-149
1980 – 1989
- 1989
- [j1]Marek A. Suchenek, Xitong Zheng, Golam Sarwar:
Non-invasive testing of real-time avionic μ-processor systems. Microprocessing and Microprogramming 27(1-5): 665-671 (1989) - [c3]Marek A. Suchenek:
A Syntactic Characterization of Minimal Entailment. NACLP 1989: 81-91 - 1988
- [c2]Marek A. Suchenek:
Incremental models of updating data bases. Algebraic Logic and Universal Algebra in Computer Science 1988: 243-271 - 1987
- [c1]Marek A. Suchenek:
Forcing versus Closed World Assumption. ISMIS 1987: 453-460
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:23 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:
