Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Urzyczyn, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Alpha-conversion and typability
A.J. Kfoury
,
S. Ronchi della Rocca
,
J. Tiuryn
,
P. Urzyczyn
Information and Computation
150
(1), 1999, pp. 1-21
An analysis of ML typability
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Journal of the ACM
41
(2), 1994, March, pp. 368-398
The undecidability of the semi-unification problem
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Information and Computation
102
(1), 1993, January, pp. 83-101
On the expressive power of finitely typed and universally polymorphic recursive procedures
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Theoretical Computer Science
93
, 1992, pp. 1-41
The undecidability of the semi-unification problem
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 468-476
Some relationships between logics of programs and complexity theory
J. Tiuryn
,
P. Urzyczyn
Theoretical Computer Science
60
(1), 1988, March, pp. 83-108
'During' cannot be expressed by 'after'
P. Urzyczyn
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 97-104
Necessary and sufficient conditions for the universality of programming formalisms
A.J. Kfoury
,
P. Urzyczyn
Acta Informatica
22
(4), 1985, pp. 347-377
Some relationships between logics of programs and complexity theory
J. Tiuryn
,
P. Urzyczyn
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 180-184