default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel M. Idziak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski
, Armin Weiß:
Equation Satisfiability in Solvable Groups. Theory Comput. Syst. 68(4): 740-757 (2024)- 2022
- [j12]Pawel M. Idziak, Jacek Krzaczkowski:
Satisfiability in MultiValued Circuits. SIAM J. Comput. 51(3): 337-378 (2022) - [c10]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Satisfiability Problems for Finite Groups. ICALP 2022: 127:1-127:20 - [c9]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Complexity of Modular Circuits. LICS 2022: 32:1-32:11 - [c8]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Satisfiability of Circuits and Equations over Finite Malcev Algebras. STACS 2022: 37:1-37:14 - 2021
- [i5]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Complexity of Modular Circuits. CoRR abs/2106.02947 (2021) - 2020
- [c7]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Intermediate problems in modular circuits satisfiability. LICS 2020: 578-590 - [i4]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Intermediate problems in modular circuits satisfiability. CoRR abs/2002.08626 (2020) - [i3]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Equation satisfiability in solvable groups. CoRR abs/2010.11788 (2020)
2010 – 2019
- 2018
- [c6]Pawel M. Idziak, Jacek Krzaczkowski:
Satisfiability in multi-valued circuits. LICS 2018: 550-558 - [c5]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. MFCS 2018: 17:1-17:15 - 2017
- [i2]Pawel M. Idziak, Jacek Krzaczkowski:
Satisfiability in multi-valued circuits. CoRR abs/1710.08163 (2017) - 2014
- [c4]Pawel M. Idziak, Siobhán Clarke:
An Analysis of Decision-Making Techniques in Dynamic, Self-Adaptive Systems. SASO Workshops 2014: 137-143 - [c3]Arnaud Cordier, Remi Domingues, Anthony Labaere, Nicolas Noel, Adrien Thiery, Thomas Cerqueus, Siobhán Clarke, Pawel M. Idziak, Hui Song, Philip Perry, Anthony Ventresque:
Dynamic Adaptation of the Traffic Management System CarDemo. SASO 2014: 193-194 - 2013
- [j11]Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc:
How big is BCI fragment of BCK logic. J. Log. Comput. 23(3): 673-691 (2013) - 2011
- [i1]Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc:
How big is BCI fragment of BCK logic. CoRR abs/1112.0643 (2011) - 2010
- [j10]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and Learnability Arising from Algebras with Few Subpowers. SIAM J. Comput. 39(7): 3023-3037 (2010)
2000 – 2009
- 2009
- [j9]Pawel M. Idziak, Keith A. Kearnes, Emil W. Kiss, Matthew Valeriote:
Definable principal congruences and solvability. Ann. Pure Appl. Log. 157(1): 30-49 (2009) - [j8]Pawel M. Idziak, Katarzyna Slomczynska, Andrzej Wronski:
Fregean Varieties. Int. J. Algebra Comput. 19(5): 595-645 (2009) - 2007
- [c2]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and learnability arising from algebras with few subpowers. LICS 2007: 213-224 - 2003
- [j7]Andrei A. Bulatov, Pawel M. Idziak:
Counting Mal'tsev clones on small sets. Discret. Math. 268(1-3): 59-80 (2003) - 2000
- [j6]Brian A. Davey, Pawel M. Idziak, William A. Lampe, George F. McNulty:
Dualizability and graph algebras. Discret. Math. 214(1-3): 145-172 (2000) - [j5]Joel Berman, Pawel M. Idziak:
Counting Finite Algebras in the Post Varieties. Int. J. Algebra Comput. 10(3): 323-338 (2000)
1990 – 1999
- 1999
- [j4]Pawel M. Idziak:
Clones containing Mal'tsev Operations. Int. J. Algebra Comput. 9(2): 213-226 (1999) - 1996
- [j3]Stanley Burris, Pawel M. Idziak:
A directly Representable Variety has a discrete First-Order Law. Int. J. Algebra Comput. 6(3): 269-276 (1996) - 1995
- [c1]Pawel M. Idziak, Jerzy Tyszkiewicz:
Monadic second order probabilities in algebra. Directly representable varieties and groups. Logic and Random Structures 1995: 79-107 - 1991
- [j2]Pawel M. Idziak:
Elementary Theory of Finite Equivalential Algebras. Reports Math. Log. 25 (1991)
1980 – 1989
- 1988
- [j1]Katarzyna Idziak, Pawel M. Idziak:
Decidability Problem for Finite Heyting Algebras. J. Symb. Log. 53(3): 729-735 (1988)
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-12-10 21:46 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:
