Leszek Pacholski

Witold Charatonik, Leszek Pacholski: Set constraints with projections. J. ACM 57(4) (2010)

Leszek Pacholski: Ergonomic issues of the neural integrated human-computer interaction. Cybernetics and Systems 37(2-3): 219-228 (2006)

Jerzy Marcinkowski, Leszek Pacholski: Thue trees. Ann. Pure Appl. Logic 119(1-3): 19-59 (2003)

Leszek Pacholski, Peter Ruzicka (Eds.): 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

Leszek Pacholski, Wieslaw Szwast, Lidia Tendera: Complexity Results for First-Order Two-Variable Logic with Counting. SIAM J. Comput. 29(4): 1083-1117 (2000)

Leszek Pacholski: Tutoriel II: Is it difficult to solve equations in the algebra of words. JFPLC 2000: 221-

Piotr Krysta, Leszek Pacholski: The STO problem is NP-complete. J. Symb. Comput. 27(2): 207-219 (1999)

Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbicki (Eds.): 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

Antoni Koscielski, Leszek Pacholski: Makanin's Algorithm is not Primitive Recursive. Theor. Comput. Sci. 191(1-2): 145-156 (1998)

Pawel Mielniczuk, Leszek Pacholski: Tarskian Set Constraints Are in NEXPTIME. MFCS 1998: 589-596

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. Logic 89(1): 1 (1997)

Leszek Pacholski, Andreas Podelski: Set Constraints: A Pearl in Research on Constraints. CP 1997: 549-562

Leszek Pacholski, Wieslaw Szwast, Lidia Tendera: Complexity of Two-Variable Logic with Counting. LICS 1997: 318-327

Antoni Koscielski, Leszek Pacholski: Complexity of Makanin's Algorithm. J. ACM 43(4): 670-684 (1996)

Leszek Pacholski, Jerzy Tiuryn (Eds.): 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

Witold Charatonik, Leszek Pacholski: Set constraints with projections are in NEXPTIME. FOCS 1994: 642-653

Witold Charatonik, Leszek Pacholski: Negative Set Constraints with Equality. LICS 1994: 128-136

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)

Leszek Pacholski, Malgorzata Wejman: Formal Modelling of the Ergonomicity Level Evaluation of Man-Microcomputer Systems. HCI (1) 1993: 1029-1032

Leszek Pacholski: Undecidability of Implication Problems in Logic Programming, Database Theory and Classical Logic. Kurt Gödel Colloquium 1993: 63-68

Leszek Pacholski: Decidability of finiteness properties (Abstract). CTRS 1992: 429

Jerzy Marcinkowski, Leszek Pacholski: Undecidability of the Horn-Clause Implication Problem. FOCS 1992: 354-362

Leszek Pacholski, Wieslaw Szwast: Asymptotic Probabilities of Existential Second-Order Gödel Structures. J. Symb. Log. 56(2): 427-438 (1991)

Witold Charatonik, Leszek Pacholski: Word Equations with Two Variables. IWWERT 1991: 43-56

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

Antoni Koscielski, Leszek Pacholski: Complexity of Unification in Free Groups and Free Semi-groups. FOCS 1990: 824-829

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

Leszek Pacholski, Jedrzej Wierzejewski: Annual Meeting of the Association for Symbolic Logic: Karpacz, Poland 1979. J. Symb. Log. 46(3): 690-702 (1981)

Leszek Pacholski: European Meeting of the Association for Symbolic Logic. J. Symb. Log. 44(3): 441-468 (1979)