| Publication | Date of Publication | Type |
|---|
| Aggregating over dominated points by sorting, scanning, zip and flat maps | 2025-01-06 | Paper |
The Power of Spreadsheet Computations
Fields of Logic and Computation III | 2022-11-09 | Paper |
On asymptotic probabilities in logics that capture \(\mathrm{DSPACE}(\log n)\) in presence of ordering
Lecture Notes in Computer Science | 2022-11-02 | Paper |
A note on the Kolmogorov data complexity and nonuniform logical definitions
Information Processing Letters | 2016-06-01 | Paper |
The navigational power of web browsers
Theory of Computing Systems | 2012-12-06 | Paper |
Complexity of type inference
Fundamenta Informaticae | 2011-05-18 | Paper |
Database query processing using finite cursor machines
Theory of Computing Systems | 2009-08-06 | Paper |
On the expressive power of semijoin queries
Information Processing Letters | 2009-07-21 | Paper |
On the Fixpoint Theory of Equality and Its Applications
Relations and Kleene Algebra in Computer Science | 2008-04-24 | Paper |
The semijoin algebra and the guarded fragment
Journal of Logic, Language and Information | 2005-10-04 | Paper |
Conditionals, Information, and Inference
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2086669 (Why is no real title available?) | 2004-08-11 | Paper |
Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1735629 (Why is no real title available?) | 2002-04-29 | Paper |
A Simple Construction for Tournaments with Every k Players Beaten by a Single Player
American Mathematical Monthly | 2001-11-26 | Paper |
Statistical properties of simple types
Mathematical Structures in Computer Science | 2001-05-10 | Paper |
| SO(∀∃*) Sentences and Their Asymptotic Probabilities | 2001-02-25 | Paper |
| scientific article; zbMATH DE number 1136649 (Why is no real title available?) | 1998-07-27 | Paper |
The Kolmogorov expressive power of Boolean query languages
Theoretical Computer Science | 1998-06-30 | Paper |
| scientific article; zbMATH DE number 1072416 (Why is no real title available?) | 1997-11-26 | Paper |
The Kolmogorov expression complexity of logics
Information and Computation | 1997-08-11 | Paper |
Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic
Random Structures & Algorithms | 1995-09-28 | Paper |
Probabilities in first—order logic of a unary function and a binary relation
Random Structures & Algorithms | 1995-05-01 | Paper |
| scientific article; zbMATH DE number 515748 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 408815 (Why is no real title available?) | 1993-09-06 | Paper |
Probabilistic properties of approximation problems
Bulletin of the Polish Academy of Sciences. Technical Sciences | 1993-01-16 | Paper |
