Marcin Kubica

Boleslaw Pochopien

IEEE Access, 2024

2023

Technology mapping of multi-output functions leading to the reduction of dynamic power consumption in FPGAs.

[BibT_eX]

[DOI]

Int. J. Appl. Math. Comput. Sci., 2023

Decomposition Approaches for Power Reduction.

[BibT_eX]

[DOI]

IEEE Access, 2023

2021

Technology Mapping for LUT-Based FPGA

[BibT_eX]

[DOI]

Lecture Notes in Electrical Engineering 713, Springer, ISBN: 978-3-030-60487-5, 2021

2020

A Linear-Time Algorithm for Seeds Computation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

2019

Methods of Improving Time Efficiency of Decomposition Dedicated at FPGA Structures and Using BDD in the Process of Cyber-Physical Synthesis.

[BibT_eX]

[DOI]

IEEE Access, 2019

A Technology Mapping of FSMs Based on a Graph of Excitations and Outputs.

[BibT_eX]

[DOI]

Józef Kulisz

IEEE Access, 2019

2018

Strategy of logic synthesis using MTBDD dedicated to FPGA.

[BibT_eX]

[DOI]

Integr., 2018

2017

Logic synthesis for FPGAs based on cutting of BDD.

[BibT_eX]

[DOI]

Microprocess. Microsystems, 2017

Area-oriented technology mapping for LUT-based logic blocks.

[BibT_eX]

[DOI]

Int. J. Appl. Math. Comput. Sci., 2017

2016

Order-preserving indexing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Polynomial-time approximation algorithms for weighted LCS problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

A note on the longest common compatible prefix problem for partial words.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

2014

Extracting powers and periods in a word from its runs structure.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

New simple efficient algorithms computing powers and runs in strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Efficient seed computation revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A linear time algorithm for consecutive permutation pattern matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

A note on efficient computation of all Abelian periods in a string.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

On the maximum number of cubic subwords in a word.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Computing the Longest Previous Factor.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Order-Preserving Suffix Trees and Their Algorithmic Applications

[BibT_eX]

[DOI]

CoRR, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

2012

Improved algorithms for the range next value problem and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the maximal sum of exponents of runs in a string.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Efficient algorithms for three variants of the LPF table.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

The Maximum Number of Squares in a Tree.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Approximation of RNA multiple structural alignment.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Efficient Seeds Computation Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Finding Patterns In Given Intervals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Extracting Powers and Periods in a String from Its Runs Structure.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Maximal Number of Cubic Runs in a String.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

On the Maximal Sum of Exponents of Runsin a String.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

On the maximal number of highly periodic runs in a string

[BibT_eX]

[DOI]

CoRR, 2009

On the Maximal Number of Cubic Subwords in a String.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

LPF Computation Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Improved Algorithms for the Range Next Value Problem and Applications.

[BibT_eX]

[DOI]

Maxime Crochemore

Costas S. Iliopoulos

Mohammad Sohel Rahman

Tomasz Walen

Proceedings of the STACS 2008, 2008

2007

RNA multiple structural alignment with longest common subsequences.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Algorithms for Computing the Longest Parameterized Common Subsequence.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2003

A Temporal Approach to Specification and Verification of Pointer Data-Structures.

[BibT_eX]

[DOI]

Proceedings of the Fundamental Approaches to Software Engineering, 2003

1995

Trace Specifications of Non-Deterministic Multi-Object Modules.

[BibT_eX]

[DOI]

Michal Iglewski