default search action
Jerzy Tiuryn
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j55]Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki:
Phylogenetic network-assisted rooting of unrooted gene trees. J. Comb. Optim. 47(5): 82 (2024) - 2022
- [c53]Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki:
Rooting Gene Trees via Phylogenetic Networks. COCOON 2022: 419-431 - 2021
- [j54]Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn:
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2125-2135 (2021) - 2020
- [j53]Jaroslaw Paszek, Jerzy Tiuryn, Pawel Górecki:
Minimizing genomic duplication episodes. Comput. Biol. Chem. 89: 107260 (2020)
2010 – 2019
- 2019
- [j52]Jerzy Tiuryn, Ewa Szczurek:
Learning signaling networks from combinatorial perturbations by exploiting siRNA off-target effects. Bioinform. 35(14): i605-i614 (2019) - 2017
- [j51]Bartek Wilczynski, Jerzy Tiuryn:
FastBill: An Improved Tool for Prediction of Cis-Regulatory Modules. J. Comput. Biol. 24(3): 193-199 (2017) - 2016
- [j50]Aleksander Jankowski, Jerzy Tiuryn, Shyam Prabhakar:
Romulus: robust multi-state identification of transcription factor binding sites from DNase-seq data. Bioinform. 32(16): 2419-2426 (2016) - [j49]Aleksander Jankowski, Paulina Obara, Utsav Mathur, Jerzy Tiuryn:
Enhanceosome transcription factors preferentially dimerize with high mobility group proteins. BMC Syst. Biol. 10: 14 (2016) - 2014
- [j48]Michal Wozniak, Limsoon Wong, Jerzy Tiuryn:
eCAMBer: efficient support for large-scale comparative analysis of multiple bacterial strains. BMC Bioinform. 15: 65 (2014) - 2013
- [j47]Janusz Dutkowski, Jerzy Tiuryn:
A Probabilistic Model of Neutral and Selective Dynamics of Protein Network Evolution. J. Comput. Biol. 20(9): 631-642 (2013) - [j46]Janusz M. Bujnicki, Jerzy Tiuryn:
Bioinformatics and Computational Biology in Poland. PLoS Comput. Biol. 9(5) (2013) - [j45]Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn:
Unrooted Tree Reconciliation: A Unified Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 10(2): 522-536 (2013) - 2012
- [c52]Pawel Górecki, Jerzy Tiuryn:
Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model. Logic and Program Semantics 2012: 83-105 - 2011
- [j44]Michal Wozniak, Limsoon Wong, Jerzy Tiuryn:
CAMBerVis: visualization software to support comparative analysis of multiple bacterial strains. Bioinform. 27(23): 3313-3314 (2011) - [j43]Ewa Szczurek, Florian Markowetz, Irit Gat-Viks, Przemyslaw Biecek, Jerzy Tiuryn, Martin Vingron:
Deregulation upon DNA damage revealed by joint analysis of context-specific perturbation data. BMC Bioinform. 12: 249 (2011) - [j42]Norbert Dojer, Przemyslaw Biecek, Jerzy Tiuryn:
Bi-Billboard: Symmetrization and Careful Choice of Informant Species Results in Higher Accuracy of Regulatory Element Prediction. J. Comput. Biol. 18(6): 809-819 (2011) - 2010
- [j41]Michal Wozniak, Jerzy Tiuryn, Janusz Dutkowski:
MODEVO: exploring modularity and evolution of protein interaction networks. Bioinform. 26(14): 1790-1791 (2010) - [j40]Ewa Szczurek, Przemyslaw Biecek, Jerzy Tiuryn, Martin Vingron:
Introducing Knowledge into Differential Expression Analysis. J. Comput. Biol. 17(8): 953-967 (2010) - [c51]Michal Wozniak, Limsoon Wong, Jerzy Tiuryn:
CAMBer: An approach to support comparative analysis of multiple bacterial strains. BIBM 2010: 121-126
2000 – 2009
- 2009
- [j39]Janusz Dutkowski, Jerzy Tiuryn:
Phylogeny-guided interaction mapping in seven eukaryotes. BMC Bioinform. 10: 393 (2009) - [j38]Bartek Wilczynski, Norbert Dojer, Mateusz Patelak, Jerzy Tiuryn:
Finding evolutionarily conserved cis-regulatory modules with a universal set of motifs. BMC Bioinform. 10 (2009) - 2007
- [j37]Pawel Górecki, Jerzy Tiuryn:
Inferring phylogeny from whole genomes. Bioinform. 23(2): 116-122 (2007) - [j36]Pawel Górecki, Jerzy Tiuryn:
URec: a system for unrooted reconciliation. Bioinform. 23(4): 511-512 (2007) - [j35]Szymon Nowakowski, Jerzy Tiuryn:
A new approach to the assessment of the quality of predictions of transcription factor binding sites. J. Biomed. Informatics 40(2): 139-149 (2007) - [j34]Damian Wójtowicz, Jerzy Tiuryn:
Evolution of Gene Families Based on Gene Duplication, Loss, Accumulated Change, and Innovation. J. Comput. Biol. 14(4): 479-495 (2007) - [c50]Bartek Wilczynski, Jerzy Tiuryn:
Reconstruction of Mammalian Cell Cycle Regulatory Network from Microarray Data Using Stochastic Logical Networks. CMSB 2007: 121-135 - [c49]Janusz Dutkowski, Jerzy Tiuryn:
Identification of functional modules from conserved ancestral protein-protein interactions. ISMB/ECCB (Supplement of Bioinformatics) 2007: 149-158 - 2006
- [j33]Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek Wilczynski, Jerzy Tiuryn:
Applying dynamic Bayesian networks to perturbed gene expression data. BMC Bioinform. 7: 249 (2006) - [j32]Bartek Wilczynski, Torgeir R. Hvidsten, Andriy Kryshtafovych, Jerzy Tiuryn, Henryk Jan Komorowski, Krzysztof Fidelis:
Using local gene expression similarities to discover regulatory binding site modules. BMC Bioinform. 7: 505 (2006) - [j31]Anna Gambin, Jerzy Tiuryn, Jerzy Tyszkiewicz:
Alignment with Context Dependent Scoring Function. J. Comput. Biol. 13(1): 81-101 (2006) - [j30]Pawel Górecki, Jerzy Tiuryn:
DLS-trees: A model of evolutionary scenarios. Theor. Comput. Sci. 359(1-3): 378-399 (2006) - [c48]Bartek Wilczynski, Jerzy Tiuryn:
Regulatory Network Reconstruction Using Stochastic Logical Networks. CMSB 2006: 142-154 - [c47]Damian Wójtowicz, Jerzy Tiuryn:
On Genome Evolution with Innovation. MFCS 2006: 801-811 - [c46]Damian Wójtowicz, Jerzy Tiuryn:
On Genome Evolution with Accumulated Change and Innovation. Comparative Genomics 2006: 39-50 - 2005
- [c45]Szymon Nowakowski, Krzysztof Fidelis, Jerzy Tiuryn:
Introducing Dependencies into Alignment Analysis and Its Use for Local Structure Prediction in Proteins. PPAM 2005: 1106-1113 - 2004
- [c44]Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz:
A Case Study of Genome Evolution: From Continuous to Discrete Time Model. MFCS 2004: 1-24 - [c43]Pawel Górecki, Jerzy Tiuryn:
On the Structure of Reconciliations. Comparative Genomics 2004: 42-54 - 2003
- [j29]Dexter Kozen, Jerzy Tiuryn:
Substructural logic and partial correctness. ACM Trans. Comput. Log. 4(3): 355-378 (2003) - [c42]Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn:
Type Inference for Nested Self Types. TYPES 2003: 99-114 - 2002
- [j28]Viviana Bono, Jerzy Tiuryn:
Products and Polymorphic Subtypes. Fundam. Informaticae 51(1-2): 13-41 (2002) - [j27]Jerzy Tiuryn, Pawel Urzyczyn:
The Subtyping Problem for Second-Order Types Is Undecidable. Inf. Comput. 179(1): 1-18 (2002) - [c41]Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz:
Contextual alignment of biological sequences. ECCB 2002: 116-127 - 2001
- [j26]Jerzy Tiuryn:
A Sequent Calculus for Subtyping Polymorphic Types. Inf. Comput. 164(2): 345-369 (2001) - [j25]Dexter Kozen, Jerzy Tiuryn:
On the completeness of propositional Hoare logic. Inf. Sci. 139(3-4): 187-195 (2001) - [j24]David Harel, Dexter Kozen, Jerzy Tiuryn:
Dynamic logic. SIGACT News 32(1): 66-69 (2001) - [c40]Dexter Kozen, Jerzy Tiuryn:
Intuitionistic Linear Logic and Partial Correctness. LICS 2001: 259-268 - 2000
- [c39]Dexter Kozen, Jerzy Tiuryn:
On the Completeness of Propositional Hoare Logic. RelMiCS 2000: 195-202 - [e2]Jerzy Tiuryn:
Foundations of Software Science and Computation Structures, Third International Conference, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings. Lecture Notes in Computer Science 1784, Springer 2000, ISBN 3-540-67257-5 [contents]
1990 – 1999
- 1999
- [j23]A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn:
Alpha-Conversion and Typability. Inf. Comput. 150(1): 1-21 (1999) - [j22]Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn:
Discrimination by Parallel Observers: The Algorithm. Inf. Comput. 150(2): 153-186 (1999) - [c38]Jerzy Tiuryn:
Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. MFCS 1999: 443-453 - 1997
- [c37]Jerzy Tiuryn:
Subtyping over a Lattice (Abstract). Kurt Gödel Colloquium 1997: 84-88 - [c36]Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn:
Discrimination by Parallel Observers. LICS 1997: 396-407 - 1996
- [j21]Vaughan R. Pratt, Jerzy Tiuryn:
Satisfiability of Inequalities in a Poset. Fundam. Informaticae 28(1-2): 165-182 (1996) - [c35]Jerzy Tiuryn, Mitchell Wand:
Untyped Lambda-Calculus with Input-Output. CAAP 1996: 317-329 - [c34]Jerzy Tiuryn, Pawel Urzyczyn:
The Subtyping Problem for Second-Order Types is Undecidable. LICS 1996: 74-85 - [c33]Jerzy Tiuryn:
A Sequent Calculus for Subtyping Polymorphic Types. MFCS 1996: 135-155 - 1995
- [c32]Jerzy Tiuryn:
Equational Axiomatization of Bicoercibility for Polymorphic Types. FSTTCS 1995: 166-179 - [e1]Leszek Pacholski, Jerzy Tiuryn:
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 [contents] - 1994
- [j20]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
An Analysis of ML Typability. J. ACM 41(2): 368-398 (1994) - 1993
- [j19]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Undecidability of the Semi-unification Problem. Inf. Comput. 102(1): 83-101 (1993) - [j18]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15(2): 290-311 (1993) - [c31]Jerzy Tiuryn, Mitchell Wand:
Type Reconstruction with Recursive Types and Atomic Subtyping. TAPSOFT 1993: 686-701 - [c30]Achim Jung, Jerzy Tiuryn:
A New Characterization of Lambda Definability. TLCA 1993: 245-257 - 1992
- [j17]A. J. Kfoury, Jerzy Tiuryn:
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus. Inf. Comput. 98(2): 228-257 (1992) - [j16]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93(1): 1-41 (1992) - [c29]Jerzy Tiuryn:
Solving Equational Constraints in Polymorphic Types. LFCS 1992: 480-492 - [c28]Jerzy Tiuryn:
Subtype Inequalities. LICS 1992: 308-315 - 1990
- [j15]Jerzy Tiuryn, David B. Benson:
Fixed Points in Free Process Algebras, Part II. Theor. Comput. Sci. 70(2): 179-192 (1990) - [c27]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
ML Typability is DEXTIME-Complete. CAAP 1990: 206-220 - [c26]A. J. Kfoury, Jerzy Tiuryn:
Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary). LICS 1990: 2-11 - [c25]Jerzy Tiuryn:
Type Inference Problems: A Survey. MFCS 1990: 105-120 - [c24]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Undecidability of the Semi-Unification Problem (Preliminary Report). STOC 1990: 468-476 - [p1]Dexter Kozen, Jerzy Tiuryn:
Logics of Programs. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 789-840
1980 – 1989
- 1989
- [j14]Jerzy Tiuryn:
A Simplified Proof of DDL < DL. Inf. Comput. 81(1): 1-12 (1989) - [j13]David B. Benson, Jerzy Tiuryn:
Fixed Points in Free Process Algebras, Part I. Theor. Comput. Sci. 63(3): 275-294 (1989) - [c23]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report). LICS 1989: 98-105 - 1988
- [j12]Jerzy Tiuryn, Pawel Urzyczyn:
Some Relationships Between Logics of Programs and Complexity Theory. Theor. Comput. Sci. 60: 83-108 (1988) - [c22]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
On the Computational Power of Universally Polymorphic Recursion. LICS 1988: 72-81 - [c21]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
A Proper Extension of ML with an Effective Type-Assignment. POPL 1988: 58-69 - 1987
- [c20]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Hierarchy of Finitely Typed Functional Programs (Short Version). LICS 1987: 225-235 - 1986
- [c19]Jerzy Tiuryn:
Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs. MFCS 1986: 177-198 - 1985
- [j11]Jerzy Tiuryn:
Preface. Inf. Control. 67(1-3): 1 (1985) - [c18]David B. Benson, Jerzy Tiuryn:
Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note). Mathematical Foundations of Programming Semantics 1985: 53-58 - 1984
- [j10]Jerzy Tiuryn:
Unbounded Program Memory Adds to the Expressive Power of First-Order Programming Logic. Inf. Control. 60(1-3): 12-35 (1984) - [j9]Albert R. Meyer, Jerzy Tiuryn:
Equivalences among Logics of Programs. J. Comput. Syst. Sci. 29(2): 160-170 (1984) - [c17]Jerzy Tiuryn, Pawel Urzyczyn:
Remarks on Comparing Expressive Power of Logics of Programs. MFCS 1984: 535-543 - 1983
- [c16]Jerzy Tiuryn, Pawel Urzyczyn:
Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract). FOCS 1983: 180-184 - [c15]Jerzy Tiuryn:
Implicit definability of finite binary trees by sets of equations. Logic and Machines 1983: 320-332 - [c14]Jan A. Bergstra, Jerzy Tiuryn:
PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness. Logic of Programs 1983: 45-56 - 1982
- [j8]Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn:
Another Incompleteness Result for Hoare's Logic. Inf. Control. 52(2): 159-171 (1982) - [j7]Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker:
Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982) - [c13]Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn:
On the Power of Nondeterminism in Dynamic Logic. ICALP 1982: 48-60 - 1981
- [j6]Jerzy Tiuryn:
Logic of effective definitions. Fundam. Informaticae 4(3): 629-660 (1981) - [j5]Jan A. Bergstra, Jerzy Tiuryn:
Logic of effective definitions. Fundam. Informaticae 4(3): 661-674 (1981) - [j4]Jan A. Bergstra, Jerzy Tiuryn:
Algorithmic degrees of algebraic structures. Fundam. Informaticae 4(4): 851-862 (1981) - [j3]Jan A. Bergstra, Jerzy Tiuryn:
Regular extensions of iterative algebras and metric interpretations. Fundam. Informaticae 4(4): 997-1014 (1981) - [c12]Jerzy Tiuryn:
Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract). FOCS 1981: 335-339 - [c11]Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn:
Hoare's Logic is Incomplete When It Does Not Have To Be. Logic of Programs 1981: 9-23 - [c10]Albert R. Meyer, Jerzy Tiuryn:
A Note On Equivalences Among Logics of Programs. Logic of Programs 1981: 282-299 - 1980
- [j2]Jerzy Tiuryn:
Unique Fixed Points Vs. Least Fixed Points. Theor. Comput. Sci. 12: 229-254 (1980) - [c9]Jan A. Bergstra, Jerzy Tiuryn:
Regular extensions of iterative algebras and metric interpretations. CLAAP 1980: 1-10
1970 – 1979
- 1979
- [c8]Jan A. Bergstra, Jerzy Tiuryn:
Implicit definability of algebraic structures by means of program properties. FCT 1979: 58-63 - [c7]Jerzy Tiuryn:
Unique Fixed Points v. Least Fixed Points. ICALP 1979: 633-645 - [c6]Jerzy Tiuryn:
A Survey of the Logic of Effective Definitions. Logic of Programs 1979: 198-245 - [c5]Jerzy Tiuryn:
Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract). MFCS 1979: 443-452 - 1978
- [j1]Jerzy Tiuryn:
Some Results on the Decomposition of Finite Automata. Inf. Control. 38(3): 288-297 (1978) - 1977
- [c4]Jerzy Tiuryn:
Fixed-Points and Algebras with Infinitely Long Expressions, II. FCT 1977: 332-339 - [c3]Jerzy Tiuryn:
Fixed-Points and Algebras with Infinitely Long Expressions, I. MFCS 1977: 513-522 - 1976
- [c2]Jerzy Tiuryn:
On the Domain of Iteration in Iterative Algebraic Theories. MFCS 1976: 544-550 - 1974
- [c1]Jerzy Tiuryn:
The Algebraic Approach to the Theory of Computing Systems. MFCS 1974: 126-142
Coauthor Index
aka: A. J. Kfoury
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint