Slawomir Lasota

Piotr Hofman

Log. Methods Comput. Sci., 2013

Turing Machines with Atoms.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Simulation Over One-counter Nets is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Minimization of semilinear automata

[BibT_eX]

[DOI]

CoRR, 2012

Partially-commutative context-free languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

An extension of data automata that captures XPath

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Tav4SB: integrating tools for analysis of kinetic models of biological systems.

[BibT_eX]

[DOI]

BMC Syst. Biol., 2012

Fraenkel-Mostowski Sets with Non-homogeneous Atoms.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 6th International Workshop, 2012

Towards nominal computation.

[BibT_eX]

[DOI]

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

A Machine-Independent Characterization of Timed Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Partially-commutative context-free processes: Expressibility and tractability.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Automata with Group Actions.

[BibT_eX]

[DOI]

Bartek Klin

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Subset Seed Extension to Protein BLAST.

[BibT_eX]

Proceedings of the BIOINFORMATICS 2011, 2011

2010

Non-interleaving bisimulation equivalences on Basic Parallel Processes.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Relating timed and register automata

[BibT_eX]

[DOI]

Diego Figueira

Piotr Hofman

Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

Fast equivalence-checking for normed context-free processes.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

On Subset Seeds for Protein Alignment.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the 8th, 2009

Partially-Commutative Context-Free Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Alternating timed automata.

[BibT_eX]

[DOI]

Igor Walukiewicz

ACM Trans. Comput. Log., 2008

Logical relations for monadic types.

[BibT_eX]

[DOI]

Jean Goubault-Larrecq

David Nowak

Math. Struct. Comput. Sci., 2008

Efficient Seeding Techniques for Protein Similarity Search.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Development, 2008

2007

Causality versus true-concurrency.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

Decidability of performance equivalence for basic parallel processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Analyzing Stationary States of Gene Regulatory Network Using Petri Nets.

[BibT_eX]

[DOI]

Anna Gambin

Michai Rutkowski

Silico Biol., 2006

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.

[BibT_eX]

[DOI]

Wojciech Rytter

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On Completeness of Logical Relations for Monadic Types.

[BibT_eX]

[DOI]

David Nowak

Yu Zhang

Proceedings of the Advances in Computer Science, 2006

2005

Positron emission tomography by Markov chain Monte Carlo with auxiliary variables.

[BibT_eX]

[DOI]

Jacek Koronacki

Wojciech Niemiro

Pattern Recognit., 2005

Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Complete Lax Logical Relations for Cryptographic Lambda-Calculi.

[BibT_eX]

[DOI]

Jean Goubault-Larrecq

David Nowak

Yu Zhang

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise.

[BibT_eX]

[DOI]

Wojciech Niemiro

Pattern Recognit., 2003

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Coalgebra morphisms subsume open maps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Contextual alignment of biological sequences.

[BibT_eX]

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

Decidability of Strong Bisimilarity for Timed BPP.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

On Different Models for Packet Flow in Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Anna Gambin

Fundam. Informaticae, 2001

2000

Finitary Observations in Regular Algebras.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Behavioural Constructor Implementation for Regular Algebras.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1998

Weak Bisimilarity and Open Maps.

[BibT_eX]

[DOI]