The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leszek Pacholski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leszek Pacholski, Wieslaw Szwast
    The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality [Citation Graph (1, 0)][DBLP]
    FOCS, 1989, pp:160-163 [Conf]
  2. Leszek Pacholski, Andreas Podelski
    Set Constraints: A Pearl in Research on Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:549-562 [Conf]
  3. Leszek Pacholski
    Decidability of finiteness properties (Abstract). [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:429- [Conf]
  4. Witold Charatonik, Leszek Pacholski
    Set constraints with projections are in NEXPTIME [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:642-653 [Conf]
  5. Antoni Koscielski, Leszek Pacholski
    Complexity of Unification in Free Groups and Free Semi-groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:824-829 [Conf]
  6. Jerzy Marcinkowski, Leszek Pacholski
    Undecidability of the Horn-Clause Implication Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:354-362 [Conf]
  7. Leszek Pacholski, Malgorzata Wejman
    Formal Modelling of the Ergonomicity Level Evaluation of Man-Microcomputer Systems. [Citation Graph (0, 0)][DBLP]
    HCI (1), 1993, pp:1029-1032 [Conf]
  8. Witold Charatonik, Leszek Pacholski
    Word Equations with Two Variables. [Citation Graph (0, 0)][DBLP]
    IWWERT, 1991, pp:43-56 [Conf]
  9. Leszek Pacholski
    Tutoriel II: Is it difficult to solve equations in the algebra of words. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2000, pp:221-0 [Conf]
  10. Leszek Pacholski
    Undecidability of Implication Problems in Logic Programming, Database Theory and Classical Logic. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:63-68 [Conf]
  11. Witold Charatonik, Leszek Pacholski
    Negative Set Constraints with Equality [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:128-136 [Conf]
  12. Leszek Pacholski, Wieslaw Szwast
    On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:280-285 [Conf]
  13. Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
    Complexity of Two-Variable Logic with Counting. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:318-327 [Conf]
  14. Pawel Mielniczuk, Leszek Pacholski
    Tarskian Set Constraints Are in NEXPTIME. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:589-596 [Conf]
  15. Patrick Cégielski, Leszek Pacholski, Denis Richard, Jerzy Tomasik, Alex Wilkie
    Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:89, n:1, pp:1- [Journal]
  16. Jerzy Marcinkowski, Leszek Pacholski
    Thue trees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:119, n:1-3, pp:19-59 [Journal]
  17. Leszek Pacholski
    Ergonomic issues of the neural integrated human-computer interaction. [Citation Graph (0, 0)][DBLP]
    Cybernetics and Systems, 2006, v:37, n:2-3, pp:219-228 [Journal]
  18. Leszek Pacholski, Wieslaw Szwast
    A Counterexample to the 0-1 Law for the Class of Existential Second-Order Minimal Gödel Sentences with Equality [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:1, pp:91-103 [Journal]
  19. Antoni Koscielski, Leszek Pacholski
    Complexity of Makanin's Algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:4, pp:670-684 [Journal]
  20. Piotr Krysta, Leszek Pacholski
    The STO problem is NP-complete. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:2, pp:207-219 [Journal]
  21. Leszek Pacholski
    European Meeting of the Association for Symbolic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:3, pp:441-468 [Journal]
  22. Leszek Pacholski, Wieslaw Szwast
    Asymptotic Probabilities of Existential Second-Order Gödel Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:2, pp:427-438 [Journal]
  23. Leszek Pacholski, Jedrzej Wierzejewski
    Annual Meeting of the Association for Symbolic Logic: Karpacz, Poland 1979. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:3, pp:690-702 [Journal]
  24. Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
    Complexity Results for First-Order Two-Variable Logic with Counting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1083-1117 [Journal]
  25. Antoni Koscielski, Leszek Pacholski
    Makanin's Algorithm is not Primitive Recursive. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:145-156 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002