default search action
Leszek Pacholski
Person information
- affiliation: University of Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c19]Leszek Pacholski:
Correlations Linking Macroergonomic Premises with Key Features of Intelligent Buildings. AHFE (16) 2021: 401-408
2010 – 2019
- 2019
- [c18]Joanna Kalkowska, Leszek Pacholski:
The Conditioning of Macroergonomic Design and Improvement of the Intelligent Building's Use and Service. AHFE (19) 2019: 165-172 - [c17]Milena Drzewiecka-Dahlke, Leszek Pacholski:
The Macroergonomic Improvement of Total Quality Management Industrial Systems. AHFE (19) 2019: 173-183 - 2017
- [c16]Marcin Butlewski
, Grzegorz Dahlke
Implementation of TPM Methodology in Worker Fatigue Management - A Macroergonomic Approach. AHFE (21) 2017: 32-41 - [c15]Leszek Pacholski, Marek Szczuka:
Methodology of Maturity Level Rating for Macro Ergonomic System in Area of Sustainable Development. AHFE (21) 2017: 42-51 - 2010
- [j13]Witold Charatonik, Leszek Pacholski:
Set constraints with projections. J. ACM 57(4): 23:1-23:37 (2010)
2000 – 2009
- 2006
- [j12]Leszek Pacholski:
Ergonomic issues of the neural integrated human-computer interaction. Cybern. Syst. 37(2-3): 219-228 (2006) - 2003
- [j11]Jerzy Marcinkowski, Leszek Pacholski:
Thue trees. Ann. Pure Appl. Log. 119(1-3): 19-59 (2003) - 2001
- [e3]Leszek Pacholski, Peter Ruzicka:
SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings. Lecture Notes in Computer Science 2234, Springer 2001, ISBN 3-540-42912-3 [contents] - 2000
- [j10]Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
Complexity Results for First-Order Two-Variable Logic with Counting. SIAM J. Comput. 29(4): 1083-1117 (2000) - [c14]Leszek Pacholski:
Tutoriel II: Is it difficult to solve equations in the algebra of words. JFPLC 2000: 221-
1990 – 1999
- 1999
- [j9]Piotr Krysta, Leszek Pacholski:
The STO problem is NP-complete. J. Symb. Comput. 27(2): 207-219 (1999) - [e2]Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbicki:
Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings. Lecture Notes in Computer Science 1672, Springer 1999, ISBN 3-540-66408-4 [contents] - 1998
- [j8]Antoni Koscielski, Leszek Pacholski:
Makanin's Algorithm is not Primitive Recursive. Theor. Comput. Sci. 191(1-2): 145-156 (1998) - [c13]Pawel Mielniczuk, Leszek Pacholski:
Tarskian Set Constraints Are in NEXPTIME. MFCS 1998: 589-596 - 1997
- [j7]Patrick Cégielski, Leszek Pacholski, Denis Richard, Jerzy Tomasik, Alex Wilkie:
Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France. Ann. Pure Appl. Log. 89(1): 1 (1997) - [c12]Leszek Pacholski, Andreas Podelski:
Set Constraints: A Pearl in Research on Constraints. CP 1997: 549-562 - [c11]Leszek Pacholski, Wieslaw Szwast, Lidia Tendera:
Complexity of Two-Variable Logic with Counting. LICS 1997: 318-327 - 1996
- [j6]Antoni Koscielski, Leszek Pacholski:
Complexity of Makanin's Algorithm. J. ACM 43(4): 670-684 (1996) - 1995
- [e1]Leszek Pacholski, Jerzy Tiuryn:
Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers. Lecture Notes in Computer Science 933, Springer 1995, ISBN 3-540-60017-5 [contents] - 1994
- [c10]Witold Charatonik, Leszek Pacholski:
Set constraints with projections are in NEXPTIME. FOCS 1994: 642-653 - [c9]Witold Charatonik, Leszek Pacholski:
Negative Set Constraints with Equality. LICS 1994: 128-136 - 1993
- [j5]Leszek Pacholski, Wieslaw Szwast:
A Counterexample to the 0-1 Law for the Class of Existential Second-Order Minimal Gödel Sentences with Equality. Inf. Comput. 107(1): 91-103 (1993) - [c8]Leszek Pacholski, Malgorzata Wejman:
Formal Modelling of the Ergonomicity Level Evaluation of Man-Microcomputer Systems. HCI (1) 1993: 1029-1032 - [c7]Leszek Pacholski:
Undecidability of Implication Problems in Logic Programming, Database Theory and Classical Logic. Kurt Gödel Colloquium 1993: 63-68 - 1992
- [c6]Leszek Pacholski:
Decidability of finiteness properties (Abstract). CTRS 1992: 429 - [c5]Jerzy Marcinkowski, Leszek Pacholski:
Undecidability of the Horn-Clause Implication Problem. FOCS 1992: 354-362 - 1991
- [j4]Leszek Pacholski, Wieslaw Szwast:
Asymptotic Probabilities of Existential Second-Order Gödel Structures. J. Symb. Log. 56(2): 427-438 (1991) - [c4]Witold Charatonik, Leszek Pacholski:
Word Equations with Two Variables. IWWERT 1991: 43-56 - [c3]Leszek Pacholski, Wieslaw Szwast:
On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality. LICS 1991: 280-285 - 1990
- [c2]Antoni Koscielski, Leszek Pacholski:
Complexity of Unification in Free Groups and Free Semi-groups. FOCS 1990: 824-829
1980 – 1989
- 1989
- [c1]Leszek Pacholski, Wieslaw Szwast:
The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality. FOCS 1989: 160-163 - 1981
- [j3]Leszek Pacholski:
Homogeneous limit reduced powers. Arch. Math. Log. 21(1): 131-136 (1981) - [j2]Leszek Pacholski, Jedrzej Wierzejewski:
Annual Meeting of the Association for Symbolic Logic: Karpacz, Poland 1979. J. Symb. Log. 46(3): 690-702 (1981)
1970 – 1979
- 1979
- [j1]Leszek Pacholski:
European Meeting of the Association for Symbolic Logic. J. Symb. Log. 44(3): 441-468 (1979)
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-05-02 21:48 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: