The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jerzy Tiuryn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    ML Typability is DEXTIME-Complete. [Citation Graph (1, 0)][DBLP]
    CAAP, 1990, pp:206-220 [Conf]
  2. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Hierarchy of Finitely Typed Functional Programs (Short Version) [Citation Graph (1, 0)][DBLP]
    LICS, 1987, pp:225-235 [Conf]
  3. Jerzy Tiuryn
    Type Inference Problems: A Survey. [Citation Graph (1, 0)][DBLP]
    MFCS, 1990, pp:105-120 [Conf]
  4. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Undecidability of the Semi-Unification Problem (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1990, pp:468-476 [Conf]
  5. Vaughan R. Pratt, Jerzy Tiuryn
    Satisfiability of Inequalities in a Poset. [Citation Graph (1, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:1-2, pp:165-182 [Journal]
  6. Dexter Kozen, Jerzy Tiuryn
    On the Completeness of Propositional Hoare Logic. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2000, pp:195-202 [Conf]
  7. Jerzy Tiuryn, Mitchell Wand
    Untyped Lambda-Calculus with Input-Output. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:317-329 [Conf]
  8. Bartek Wilczynski, Jerzy Tiuryn
    Regulatory Network Reconstruction Using Stochastic Logical Networks. [Citation Graph (0, 0)][DBLP]
    CMSB, 2006, pp:142-154 [Conf]
  9. Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz
    Contextual alignment of biological sequences. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:116-127 [Conf]
  10. Jan A. Bergstra, Jerzy Tiuryn
    Implicit definability of algebraic structures by means of program properties. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:58-63 [Conf]
  11. Jerzy Tiuryn
    Fixed-Points and Algebras with Infinitely Long Expressions, II. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:332-339 [Conf]
  12. Jerzy Tiuryn
    Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:335-339 [Conf]
  13. Jerzy Tiuryn, Pawel Urzyczyn
    Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:180-184 [Conf]
  14. Jerzy Tiuryn
    Equational Axiomatization of Bicoercibility for Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:166-179 [Conf]
  15. Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn
    On the Power of Nondeterminism in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:48-60 [Conf]
  16. Jerzy Tiuryn
    Unique Fixed Points v. Least Fixed Points. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:633-645 [Conf]
  17. Jerzy Tiuryn
    Subtyping over a Lattice (Abstract). [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:84-88 [Conf]
  18. Jerzy Tiuryn
    Implicit definability of finite binary trees by sets of equations. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:320-332 [Conf]
  19. Jerzy Tiuryn
    Solving Equational Constraints in Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:480-492 [Conf]
  20. Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
    Discrimination by Parallel Observers. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:396-407 [Conf]
  21. A. J. Kfoury, Jerzy Tiuryn
    Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary) [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:2-11 [Conf]
  22. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    On the Computational Power of Universally Polymorphic Recursion [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:72-81 [Conf]
  23. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:98-105 [Conf]
  24. Dexter Kozen, Jerzy Tiuryn
    Intuitionistic Linear Logic and Partial Correctness. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:259-268 [Conf]
  25. Jerzy Tiuryn
    Subtype Inequalities [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:308-315 [Conf]
  26. Jerzy Tiuryn, Pawel Urzyczyn
    The Subtyping Problem for Second-Order Types is Undecidable. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:74-85 [Conf]
  27. Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
    Hoare's Logic is Incomplete When It Does Not Have To Be. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:9-23 [Conf]
  28. Jan A. Bergstra, Jerzy Tiuryn
    PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:45-56 [Conf]
  29. Jerzy Tiuryn
    A Survey of the Logic of Effective Definitions. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1979, pp:198-245 [Conf]
  30. Albert R. Meyer, Jerzy Tiuryn
    A Note On Equivalences Among Logics of Programs. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:282-299 [Conf]
  31. Jerzy Tiuryn
    The Algebraic Approach to the Theory of Computing Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:126-142 [Conf]
  32. Jerzy Tiuryn
    On the Domain of Iteration in Iterative Algebraic Theories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:544-550 [Conf]
  33. Jerzy Tiuryn
    Fixed-Points and Algebras with Infinitely Long Expressions, I. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:513-522 [Conf]
  34. Jerzy Tiuryn
    Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:443-452 [Conf]
  35. Jerzy Tiuryn
    Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:177-198 [Conf]
  36. Jerzy Tiuryn
    A Sequent Calculus for Subtyping Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:135-155 [Conf]
  37. Jerzy Tiuryn
    Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:443-453 [Conf]
  38. Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz
    A Case Study of Genome Evolution: From Continuous to Discrete Time Model. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:1-24 [Conf]
  39. Jerzy Tiuryn, Pawel Urzyczyn
    Remarks on Comparing Expressive Power of Logics of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:535-543 [Conf]
  40. Damian Wójtowicz, Jerzy Tiuryn
    On Genome Evolution with Innovation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:801-811 [Conf]
  41. David B. Benson, Jerzy Tiuryn
    Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note). [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1985, pp:53-58 [Conf]
  42. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    A Proper Extension of ML with an Effective Type-Assignment. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:58-69 [Conf]
  43. Szymon Nowakowski, Krzysztof Fidelis, Jerzy Tiuryn
    Introducing Dependencies into Alignment Analysis and Its Use for Local Structure Prediction in Proteins. [Citation Graph (0, 0)][DBLP]
    PPAM, 2005, pp:1106-1113 [Conf]
  44. Pawel Górecki, Jerzy Tiuryn
    On the Structure of Reconciliations. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2004, pp:42-54 [Conf]
  45. Damian Wójtowicz, Jerzy Tiuryn
    On Genome Evolution with Accumulated Change and Innovation. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2006, pp:39-50 [Conf]
  46. Jerzy Tiuryn, Mitchell Wand
    Type Reconstruction with Recursive Types and Atomic Subtyping. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:686-701 [Conf]
  47. Achim Jung, Jerzy Tiuryn
    A New Characterization of Lambda Definability. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:245-257 [Conf]
  48. Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn
    Type Inference for Nested Self Types. [Citation Graph (0, 0)][DBLP]
    TYPES, 2003, pp:99-114 [Conf]
  49. Pawel Górecki, Jerzy Tiuryn
    Inferring phylogeny from whole genomes. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:2, pp:116-122 [Journal]
  50. Pawel Górecki, Jerzy Tiuryn
    URec: a system for unrooted reconciliation. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:4, pp:511-512 [Journal]
  51. Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek Wilczynski, Jerzy Tiuryn
    Applying dynamic Bayesian networks to perturbed gene expression data. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:249- [Journal]
  52. Jan A. Bergstra, Jerzy Tiuryn
    Logic of effective definitions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:3, pp:661-674 [Journal]
  53. Jan A. Bergstra, Jerzy Tiuryn
    Algorithmic degrees of algebraic structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:851-862 [Journal]
  54. Jan A. Bergstra, Jerzy Tiuryn
    Regular extensions of iterative algebras and metric interpretations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:4, pp:997-1014 [Journal]
  55. Viviana Bono, Jerzy Tiuryn
    Products and Polymorphic Subtypes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:51, n:1-2, pp:13-41 [Journal]
  56. Jerzy Tiuryn
    Logic of effective definitions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:3, pp:629-660 [Journal]
  57. Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
    Another Incompleteness Result for Hoare's Logic [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:2, pp:159-171 [Journal]
  58. Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
    Discrimination by Parallel Observers: The Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:2, pp:153-186 [Journal]
  59. A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
    Alpha-Conversion and Typability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:1, pp:1-21 [Journal]
  60. A. J. Kfoury, Jerzy Tiuryn
    Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:98, n:2, pp:228-257 [Journal]
  61. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    The Undecidability of the Semi-unification Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:1, pp:83-101 [Journal]
  62. Jerzy Tiuryn
    A Sequent Calculus for Subtyping Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:164, n:2, pp:345-369 [Journal]
  63. Jerzy Tiuryn
    Some Results on the Decomposition of Finite Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:38, n:3, pp:288-297 [Journal]
  64. Jerzy Tiuryn
    Unbounded Program Memory Adds to the Expressive Power of First-Order Programming Logic [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:12-35 [Journal]
  65. Jerzy Tiuryn
    Preface [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:1- [Journal]
  66. Jerzy Tiuryn
    A Simplified Proof of DDL < DL [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:1, pp:1-12 [Journal]
  67. Jerzy Tiuryn, Pawel Urzyczyn
    The Subtyping Problem for Second-Order Types Is Undecidable. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:1, pp:1-18 [Journal]
  68. Dexter Kozen, Jerzy Tiuryn
    On the completeness of propositional Hoare logic. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:139, n:3-4, pp:187-195 [Journal]
  69. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    An Analysis of ML Typability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:368-398 [Journal]
  70. Szymon Nowakowski, Jerzy Tiuryn
    A new approach to the assessment of the quality of predictions of transcription factor binding sites. [Citation Graph (0, 0)][DBLP]
    Journal of Biomedical Informatics, 2007, v:40, n:2, pp:139-149 [Journal]
  71. Albert R. Meyer, Jerzy Tiuryn
    Equivalences among Logics of Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:2, pp:160-170 [Journal]
  72. David B. Benson, Jerzy Tiuryn
    Fixed Points in Free Process Algebras, Part I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:3, pp:275-294 [Journal]
  73. Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker
    Floyds Principle, Correctness Theories and Program Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:113-149 [Journal]
  74. Pawel Górecki, Jerzy Tiuryn
    DLS-trees: A model of evolutionary scenarios. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:378-399 [Journal]
  75. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:93, n:1, pp:1-41 [Journal]
  76. Jerzy Tiuryn
    Unique Fixed Points Vs. Least Fixed Points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:229-254 [Journal]
  77. Jerzy Tiuryn, David B. Benson
    Fixed Points in Free Process Algebras, Part II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:2, pp:179-192 [Journal]
  78. Jerzy Tiuryn, Pawel Urzyczyn
    Some Relationships Between Logics of Programs and Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:60, n:, pp:83-108 [Journal]
  79. Dexter Kozen, Jerzy Tiuryn
    Substructural logic and partial correctness. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:3, pp:355-378 [Journal]
  80. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Type Reconstruction in the Presence of Polymorphic Recursion. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1993, v:15, n:2, pp:290-311 [Journal]
  81. Bartek Wilczynski, Jerzy Tiuryn
    Reconstruction of Mammalian Cell Cycle Regulatory Network from Microarray Data Using Stochastic Logical Networks. [Citation Graph (0, 0)][DBLP]
    CMSB, 2007, pp:121-135 [Conf]

  82. Regular extensions of iterative algebras and metric interpretations. [Citation Graph (, )][DBLP]


  83. Identification of functional modules from conserved ancestral protein-protein interactions. [Citation Graph (, )][DBLP]


  84. MODEVO: exploring modularity and evolution of protein interaction networks. [Citation Graph (, )][DBLP]


  85. Finding evolutionarily conserved cis-regulatory modules with a universal set of motifs. [Citation Graph (, )][DBLP]


  86. Using local gene expression similarities to discover regulatory binding site modules. [Citation Graph (, )][DBLP]


  87. Phylogeny-guided interaction mapping in seven eukaryotes. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002