2008 |
37 | | Edward Ochmanski,
Jerzy Tyszkiewicz:
Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
Springer 2008 |
36 | EE | 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) |
2007 |
35 | EE | Jan Hidders,
Natalia Kwasnikowska,
Jacek Sroka,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
A Formal Model of Dataflow Repositories.
DILS 2007: 105-121 |
34 | EE | 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 |
2006 |
33 | EE | Andrzej Szalas,
Jerzy Tyszkiewicz:
On the Fixpoint Theory of Equality and Its Applications.
RelMiCS 2006: 388-401 |
32 | EE | Jacek Sroka,
Grzegorz Kaczor,
Jerzy Tyszkiewicz,
Andrzej M. Kierzek:
XQTav: an XQuery processor for Taverna environment.
Bioinformatics 22(10): 1280-1281 (2006) |
31 | EE | Anna Gambin,
Jerzy Tiuryn,
Jerzy Tyszkiewicz:
Alignment with Context Dependent Scoring Function.
Journal of Computational Biology 13(1): 81-101 (2006) |
2005 |
30 | EE | Jan Hidders,
Natalia Kwasnikowska,
Jacek Sroka,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Petri Net + Nested Relational Calculus = Dataflow.
OTM Conferences (1) 2005: 220-237 |
29 | EE | 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) |
2004 |
28 | EE | Dirk Leinders,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
The semijoin algebra and the guarded fragment
CoRR cs.DB/0407007: (2004) |
27 | EE | Dirk Leinders,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
On the expressive power of semijoin queries.
Inf. Process. Lett. 91(2): 93-98 (2004) |
2003 |
26 | EE | Dirk Leinders,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
On the expressive power of semijoin queries
CoRR cs.DB/0308014: (2003) |
2002 |
25 | | Anna Gambin,
Slawomir Lasota,
Radoslaw Szklarczyk,
Jerzy Tiuryn,
Jerzy Tyszkiewicz:
Contextual alignment of biological sequences.
ECCB 2002: 116-127 |
24 | EE | Michal Bielecki,
Jan Hidders,
Jan Paredaens,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Navigating with a Browser.
ICALP 2002: 764-775 |
23 | EE | Marc Spielmann,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Distributed Computation of Web Queries Using Automata.
PODS 2002: 97-108 |
22 | EE | Piotr Chrzastowski-Wachtel,
Jerzy Tyszkiewicz:
A Maple Package for Conditional Event Algebras.
WCII 2002: 131-151 |
2001 |
21 | EE | Jerzy Tyszkiewicz,
Arthur Ramer,
Achim G. Hoffmann:
The temporal calculus of conditional objects and conditional events
CoRR cs.AI/0110003: (2001) |
20 | EE | Jerzy Tyszkiewicz,
Achim G. Hoffmann,
Arthur Ramer:
Embedding conditional event algebras into temporal calculus of conditionals
CoRR cs.AI/0110004: (2001) |
19 | | Jerzy Tyszkiewicz:
Computability by Sequences of Queries.
Fundam. Inform. 48(4): 389-414 (2001) |
18 | | Frank Neven,
Martin Otto,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Adding For-Loops to First-Order Logic.
Inf. Comput. 168(2): 156-186 (2001) |
17 | EE | 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) |
2000 |
16 | EE | Eric Rosen,
Jerzy Tyszkiewicz:
SO(forall-exist*) Sentences and Their Asymptotic Probabilities.
Math. Log. Q. 46(4): 435-452 (2000) |
15 | | Malgorzata Moczurad,
Jerzy Tyszkiewicz,
Marek Zaionc:
Statistical properties of simple types.
Mathematical Structures in Computer Science 10(5): 575-594 (2000) |
1999 |
14 | EE | Frank Neven,
Martin Otto,
Jerzy Tyszkiewicz,
Jan Van den Bussche:
Adding For-Loops to First-Order Logic.
ICDT 1999: 58-69 |
1998 |
13 | EE | Jerzy Tyszkiewicz:
The Kolmogorov Expressive Power of Boolean Query Languages.
Theor. Comput. Sci. 190(2): 317-361 (1998) |
1997 |
12 | EE | 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.
Fundam. Inform. 32(1): 91-105 (1997) |
9 | | Jerzy Tyszkiewicz:
The Kolmogorov Expression Complexity of Logics.
Inf. Comput. 135(2): 113-135 (1997) |
8 | EE | Jerzy Tyszkiewicz:
A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions.
Inf. Process. Lett. 64(4): 187-195 (1997) |
1995 |
7 | EE | 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 Struct. Algorithms 6(2/3): 181-192 (1995) |
1994 |
4 | | Jerzy Tyszkiewicz:
Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic.
Random Struct. Algorithms 5(1): 215-234 (1994) |
1993 |
3 | | Jerzy Tyszkiewicz:
On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering.
TAPSOFT 1993: 569-583 |
1992 |
2 | | Jerzy Tyszkiewicz:
On Asymptotic Probabilities of Monadic Second Order Properties.
CSL 1992: 425-439 |
1991 |
1 | | Jerzy Tyszkiewicz:
Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic.
CSL 1991: 396-410 |