default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Grabowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Bartosz Balis
, Tomasz Lelek, Jakub Bodera, Michal Grabowski, Costin Grigoras:
Improving prediction of computational job execution times with machine learning. Concurr. Comput. Pract. Exp. 36(2) (2024)- 2022
- [c12]Bartosz Balis, Michal Grabowski:
Evaluation of Machine Learning Techniques for Predicting Run Times of Scientific Workflow Jobs. PPAM (1) 2022: 197-208
2010 – 2019
- 2019
- [c11]Robert Janowski, Michal Grabowski, Piotr Arabas:
New Heuristics for TCP Retransmission Timers. CORES 2019: 117-129 - [c10]Marcin Przewiezlikowski, Michal Grabowski, Dariusz Kurzyk, Katarzyna Rycerz:
Support for High-Level Quantum Bayesian Inference. ICCS (5) 2019: 764-770 - 2018
- [j7]Aleksander Denisiuk, Michal Grabowski:
Embedding of the Hamming space into a sphere with weighted quadrance metric and c-means clustering of nominal-continuous data. Intell. Data Anal. 22(6): 1297-1314 (2018) - 2017
- [j6]Aleksander Denisiuk, Michal Grabowski:
Low Distortion Embedding of the Hamming Space into a Sphere with Quadrance Metric and k-means Clustering of Nominal-continuous Data. Fundam. Informaticae 153(3): 221-233 (2017) - 2015
- [c9]Aleksander Denisiuk, Michal Grabowski:
A Variant of the K-Means Clustering Algorithm for Continuous-Nominal Data. CORES 2015: 17-26
2000 – 2009
- 2005
- [c8]Michal Grabowski, Andrzej Szalas:
A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. AWIC 2005: 183-189 - 2003
- [j5]Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas:
Towards a Framework for Approximate Ontologies. Fundam. Informaticae 57(2-4): 147-165 (2003)
1990 – 1999
- 1993
- [j4]Michal Grabowski:
On the Status of Proving Program Properties in Effective Interpretations. Theor. Comput. Sci. 120(1): 69-81 (1993)
1980 – 1989
- 1989
- [j3]Michal Grabowski:
Open Problems Related to Axiomatic Descriptions of Programs. J. Inf. Process. Cybern. 25(11/12): 619-624 (1989) - 1988
- [j2]Michal Grabowski:
Arithmetical completeness versus relative completeness. Stud Logica 47(3): 213-220 (1988) - [c7]Michal Grabowski, Hardi Hungar:
On the Existence of Effective Hoare Logics. LICS 1988: 428-435 - 1985
- [j1]Michal Grabowski:
On Relative Completeness of Hoare Logics. Inf. Control. 66(1/2): 29-44 (1985) - [c6]Michal Grabowski:
On the Relative Incompleteness of Logics for Total Correctness. Logic of Programs 1985: 118-127 - 1984
- [c5]Michal Grabowski:
On Relative Completeness of Programming Logics. POPL 1984: 258-261 - [c4]Michal Grabowski:
Non-uniformity of dynamic logic - Extended abstract. Symposium on Computation Theory 1984: 91-97 - 1980
- [c3]Michal Grabowski:
Some model-theoretical properties of logic for programs with random control. Logic of Programs 1980: 148-155
1970 – 1979
- 1978
- [c2]Michal Grabowski, Antoni Kreczmar:
Dynamic Theories of Real and Complex Numbers. MFCS 1978: 239-249 - 1976
- [c1]Michal Grabowski:
A Remark on Equivalence of Mazurkiewicz's Finite-Control Algorithms over Nets. MFCS 1976: 311-316
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 2025-01-21 00:19 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:
