Marek A. Suchenek

According to our database1, Marek A. Suchenek authored at least 18 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Worst-Case Analysis of Heapsort, Exactly.
Comput. J., 2024

2017
Elementary Yet Precise Worst-case Analysis of MergeSort, A short version (SV).
CoRR, 2017

2016
Best-case Analysis of MergeSort with an Application to the Sum of Digits Problem, A manuscript (MS).
CoRR, 2016

2015
A Complete Worst-Case Analysis of Heapsort with Experimental Verification of Its Results, A manuscript (MS).
CoRR, 2015

Technical Notes on Complexity of the Satisfiability Problem.
CoRR, 2015

2012
Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program.
Fundam. Informaticae, 2012

2000
Evaluation of Queries under Closed-World Assumption. Part II: The Hierarchical Case.
J. Autom. Reason., 2000

Sound and Complete Propositional Nonmonotonic Logic of Hierarchically-Minimal Models.
Proceedings of the Intelligent Information Systems, 2000

1997
Evaluation of Queries under Closed-World Assumption.
J. Autom. Reason., 1997

1994
Preservation properties in deductive databases.
Methods Log. Comput. Sci., 1994

1993
First -Order Syntactic Characterizations of Minimal Entailment, Domain-Minimal Entailment, and Herbrand Entailment.
J. Autom. Reason., 1993

Mesh models of knowledge in distributed systems.
Proceedings of the 1993 Euromicro Workshop on Parallel and Distributed Processing, 1993

1990
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models.
Int. J. Found. Comput. Sci., 1990

On reasoning from Closed World Databases with Disjunctive Views.
Proceedings of the Workshop Logic Programming and Non-Monotonic Logic, 1990

1989
Non-invasive testing of real-time avionic μ-processor systems.
Microprocessing and Microprogramming, 1989

A Syntactic Characterization of Minimal Entailment.
Proceedings of the Logic Programming, 1989

1988
Incremental models of updating data bases.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1987
Forcing versus Closed World Assumption.
Proceedings of the Methodologies for Intelligent Systems, 1987


  Loading...