Jerzy Tyszkiewicz

Michal Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche: The Navigational Power of Web Browsers. Theory Comput. Syst. 50(2): 213-240 (2012)

Jerzy Tyszkiewicz, Dermot Balson: User Defined Spreadsheet Functions in Excel. CoRR abs/1211.6781 (2012)

Jacek Sroka, Lukasz Krupa, Andrzej M. Kierzek, Jerzy Tyszkiewicz: CalcTav - integration of a spreadsheet and Taverna workbench. Bioinformatics 27(18): 2618-2619 (2011)

Jerzy Tyszkiewicz: Complexity of Type Inference. Fundam. Inform. 103(1-4): 289-301 (2010)

Jerzy Tyszkiewicz: Spreadsheet as a relational database engine. SIGMOD Conference 2010: 195-206

Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche: Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009)

Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche: DFL: A dataflow language based on Petri nets and nested relational calculus. Inf. Syst. 33(3): 261-284 (2008)

Edward Ochmanski, Jerzy Tyszkiewicz (Eds.): Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings. Lecture Notes in Computer Science 5162, Springer 2008, isbn 978-3-540-85237-7

Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche: A Formal Model of Dataflow Repositories. DILS 2007: 105-121

Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche: Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298

Jacek Sroka, Grzegorz Kaczor, Jerzy Tyszkiewicz, Andrzej M. Kierzek: XQTav: an XQuery processor for Taverna environment. Bioinformatics 22(10): 1280-1281 (2006)

Anna Gambin, Jerzy Tiuryn, Jerzy Tyszkiewicz: Alignment with Context Dependent Scoring Function. Journal of Computational Biology 13(1): 81-101 (2006)

Andrzej Szalas, Jerzy Tyszkiewicz: On the Fixpoint Theory of Equality and Its Applications. RelMiCS 2006: 388-401

Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz, Jan Van den Bussche: The Semijoin Algebra and the Guarded Fragment. Journal of Logic, Language and Information 14(3): 331-343 (2005)

Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche: Petri Net + Nested Relational Calculus = Dataflow. OTM Conferences (1) 2005: 220-237

Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche: On the expressive power of semijoin queries. Inf. Process. Lett. 91(2): 93-98 (2004)

Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche: The semijoin algebra and the guarded fragment. CoRR cs.DB/0407007 (2004)

Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche: On the expressive power of semijoin queries. CoRR cs.DB/0308014 (2003)

Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz: Contextual alignment of biological sequences. ECCB 2002: 116-127

Michal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche: Navigating with a Browser. ICALP 2002: 764-775

Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche: Distributed Computation of Web Queries Using Automata. PODS 2002: 97-108

Piotr Chrzastowski-Wachtel, Jerzy Tyszkiewicz: A Maple Package for Conditional Event Algebras. WCII 2002: 131-151

Jerzy Tyszkiewicz: Computability by Sequences of Queries. Fundam. Inform. 48(4): 389-414 (2001)

Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. Inf. Comput. 168(2): 156-186 (2001)

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. Inf. Process. Lett. 79(4): 155-160 (2001)

Jerzy Tyszkiewicz, Arthur Ramer, Achim G. Hoffmann: The temporal calculus of conditional objects and conditional events. CoRR cs.AI/0110003 (2001)

Jerzy Tyszkiewicz, Achim G. Hoffmann, Arthur Ramer: Embedding conditional event algebras into temporal calculus of conditionals. CoRR cs.AI/0110004 (2001)

Eric Rosen, Jerzy Tyszkiewicz: SO(forall-exist*) Sentences and Their Asymptotic Probabilities. Math. Log. Q. 46(4): 435-452 (2000)

Malgorzata Moczurad, Jerzy Tyszkiewicz, Marek Zaionc: Statistical properties of simple types. Mathematical Structures in Computer Science 10(5): 575-594 (2000)

Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. ICDT 1999: 58-69

Jerzy Tyszkiewicz: The Kolmogorov Expressive Power of Boolean Query Languages. Theor. Comput. Sci. 190(2): 317-361 (1998)

Jerzy Tyszkiewicz: Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines. Fundam. Inform. 32(1): 91-105 (1997)

Jerzy Tyszkiewicz: The Kolmogorov Expression Complexity of Logics. Inf. Comput. 135(2): 113-135 (1997)

Jerzy Tyszkiewicz: A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions. Inf. Process. Lett. 64(4): 187-195 (1997)

Jerzy Tyszkiewicz: Fine Hierarchies of Generic Computation. ICDT 1997: 125-139

Jerzy Tyszkiewicz: Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). MFCS 1997: 498-507

Jerzy Tyszkiewicz: Probabilities in First-Order Logic of a Unary Function and a Binary Relation. Random Struct. Algorithms 6(2/3): 181-192 (1995)

Jerzy Tyszkiewicz: On the Kolmogorov Expressive Power of Boolean Query Languages. ICDT 1995: 97-110

James F. Lynch, Jerzy Tyszkiewicz: The Infinitary Logic of Sparse Random Graphs. LICS 1995: 46-53

Jerzy Tyszkiewicz: Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic. Random Struct. Algorithms 5(1): 215-234 (1994)

Jerzy Tyszkiewicz: On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering. TAPSOFT 1993: 569-583

Jerzy Tyszkiewicz: On Asymptotic Probabilities of Monadic Second Order Properties. CSL 1992: 425-439

Jerzy Tyszkiewicz: Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic. CSL 1991: 396-410