| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Jerzy Tyszkiewicz 21 Anna Gambin , Slawomir Lasota , Radoslaw Szklarczyk , Jerzy Tiuryn , Jerzy Tyszkiewicz: Contextual alignment of biological sequences. ECCB 2002 : 116-127 20 Michal Bielecki , Jan Hidders , Jan Paredaens , Jerzy Tyszkiewicz, Jan Van den Bussche : Navigating with a Browser. ICALP 2002 : 764-775 19 Marc Spielmann , Jerzy Tyszkiewicz, Jan Van den Bussche : Distributed Computation of Web Queries Using Automata. PODS 2002 : 97-108 18 Jerzy Tyszkiewicz: Computability by Sequences of Queries. Fundamenta Informaticae 48 (4): 389-414 (2001) 17 Piotr Chrzastowski-Wachtel , Jerzy Tyszkiewicz, Achim G. Hoffmann , Arthur Ramer : Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker. Information Processing Letters 79 (4): 155-160 (2001) 16 Frank Neven , Martin Otto , Jerzy Tyszkiewicz, Jan Van den Bussche : Adding For-Loops to First-Order Logic. Information and Computation 168 (2): 156-186 (2001) 15 Malgorzata Moczurad , Jerzy Tyszkiewicz, Marek Zaionc : Statistical properties of simple types. Mathematical Structures in Computer Science 10 (5): 575-594 (2000) 14 Frank Neven , Martin Otto , Jerzy Tyszkiewicz, Jan Van den Bussche : Adding For-Loops to First-Order Logic. ICDT 1999 : 58-69 13 Jerzy Tyszkiewicz: The Kolmogorov Expressive Power of Boolean Query Languages. TCS 190 (2): 317-361 (1998) 12 Jerzy Tyszkiewicz: Fine Hierarchies of Generic Computation. ICDT 1997 : 125-139 11 Jerzy Tyszkiewicz: Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). MFCS 1997 : 498-507 10 Jerzy Tyszkiewicz: Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines. Fundamenta Informaticae 32 (1): 91-105 (1997) 9 Jerzy Tyszkiewicz: A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions. Information Processing Letters 64 (4): 187-195 (1997) 8 Jerzy Tyszkiewicz: The Kolmogorov Expression Complexity of Logics. Information and Computation 135 (2): 113-135 (1997) 7 Jerzy Tyszkiewicz: On the Kolmogorov Expressive Power of Boolean Query Languages. ICDT 1995 : 97-110 6 James F. Lynch , Jerzy Tyszkiewicz: The Infinitary Logic of Sparse Random Graphs. LICS 1995 : 46-53 5 Jerzy Tyszkiewicz: Probabilities in First-Order Logic of a Unary Function and a Binary Relation. Random Structures and Algorithms 6 (2/3): 181-192 (1995) 4 Jerzy Tyszkiewicz: Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic. Random Structures and Algorithms 5 (1): 215-234 (1994) 3 Jerzy Tyszkiewicz: On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering. TAPSOFT 1993 : 569-583 2 Jerzy Tyszkiewicz: On Asymptotic Probabilities of Monadic Second Order Properties. CSL 1992 : 425-439 1 Jerzy Tyszkiewicz: Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic. CSL 1991 : 396-410  DiSC'03 © 2003 Association for Computing Machinery |
