| 2015 | FOSSACS | On the Mints Hierarchy in First-Order Intuitionistic Logic. | Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski |
| 2012 | CSL | Bounded Combinatory Logic. | Boris Ddder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn |
| 2005 | ICALP | Unsafe Grammars and Panic Automata. | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz |
| 2004 | CSL | My (Un)Favourite Things. | Pawel Urzyczyn |
| 2002 | FOSSACS | Higher-Order Pushdown Trees Are Easy. | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn |
| 1999 | ICFP | Type Fixpoints: Iteration vs. Recursion. | Zdzislaw Splawski, Pawel Urzyczyn |
| 1997 | LICS | Discrimination by Parallel Observers. | Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn |
| 1996 | LICS | The Subtyping Problem for Second-Order Types is Undecidable. | Jerzy Tiuryn, Pawel Urzyczyn |
| 1995 | MFCS | Positive Recursive Type Assignment. | Pawel Urzyczyn |
| 1994 | LFCS | Comparing Cubes. | Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn |
| 1994 | LICS | The Emptiness Problem for Intersection Types | Pawel Urzyczyn |
| 1990 | STOC | The Undecidability of the Semi-Unification Problem (Preliminary Report) | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1989 | LICS | Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1988 | LICS | On the Computational Power of Universally Polymorphic Recursion | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1988 | POPL | A Proper Extension of ML with an Effective Type-Assignment. | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1987 | FCT | Verification of Programs with Higher-Order Arrays. | Wojciech Kowalczyk, Pawel Urzyczyn |
| 1987 | LICS | The Hierarchy of Finitely Typed Functional Programs (Short Version) | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1984 | MFCS | Remarks on Comparing Expressive Power of Logics of Programs. | Jerzy Tiuryn, Pawel Urzyczyn |
| 1983 | FCT | Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. | Pawel Urzyczyn |
| 1983 | FOCS | Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) | Jerzy Tiuryn, Pawel Urzyczyn |