Marcin Kubica

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 10

Top Topics

Logic Synthesis

Top Venues

Discret. Appl. Math.

Int. J. Appl. Math. Comput. Sci.

Theor. Comput. Sci.

Publications

Adam Opara, Marcin Kubica, Dariusz Kania
Decomposition Approaches for Power Reduction. IEEE Access 11 (2023)
Adam Opara, Marcin Kubica
Technology mapping of multi-output functions leading to the reduction of dynamic power consumption in FPGAs. Int. J. Appl. Math. Comput. Sci. 33 (2) (2023)
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16 (2) (2020)
Adam Opara, Marcin Kubica, Dariusz Kania
Methods of Improving Time Efficiency of Decomposition Dedicated at FPGA Structures and Using BDD in the Process of Cyber-Physical Synthesis. IEEE Access 7 (2019)
Marcin Kubica, Dariusz Kania, Józef Kulisz
A Technology Mapping of FSMs Based on a Graph of Excitations and Outputs. IEEE Access 7 (2019)
Adam Opara, Marcin Kubica, Dariusz Kania
Strategy of logic synthesis using MTBDD dedicated to FPGA. Integr. 62 (2018)
Marcin Kubica, Dariusz Kania
Area-oriented technology mapping for LUT-based logic blocks. Int. J. Appl. Math. Comput. Sci. 27 (1) (2017)
Marcin Kubica, Adam Opara, Dariusz Kania
Logic synthesis for FPGAs based on cutting of BDD. Microprocess. Microsystems 52 (2017)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-preserving indexing. Theor. Comput. Sci. 638 (2016)
Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Polynomial-time approximation algorithms for weighted LCS problem. Discret. Appl. Math. 204 (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34 (2015)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521 (2014)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163 (2014)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-Preserving Suffix Trees and Their Algorithmic Applications CoRR (2013)
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Computing the Longest Previous Factor. Eur. J. Comb. 34 (1) (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113 (3) (2013)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient seed computation revisited. Theor. Comput. Sci. 483 (2013)
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the maximum number of cubic subwords in a word. Eur. J. Comb. 34 (1) (2013)
Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113 (12) (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
The Maximum Number of Squares in a Tree. CPM (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11 (2012)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
A Note on Efficient Computation of All Abelian Periods in a String CoRR (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78 (6) (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen
Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434 (2012)
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the maximal sum of exponents of runs in a string. J. Discrete Algorithms 14 (2012)
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A linear time algorithm for seeds computation. SODA (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient Seeds Computation Revisited CoRR (2011)
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
A Linear Time Algorithm for Seeds Computation CoRR (2011)
Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9 (4) (2011)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient Seeds Computation Revisited. CPM (2011)
Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM (2011)
Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman
Finding Patterns In Given Intervals. Fundam. Informaticae 101 (3) (2010)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the Maximal Number of Cubic Runs in a String. LATA (2010)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Extracting Powers and Periods in a String from Its Runs Structure. SPIRE (2010)
Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM (2010)
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the maximal sum of exponents of runs in a string CoRR (2010)
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the Maximal Sum of Exponents of Runsin a String. IWOCA (2010)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology (2010)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM (2010)
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the Maximal Number of Cubic Subwords in a String. IWOCA (2009)
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
LPF Computation Revisited. IWOCA (2009)
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the maximal number of cubic subwords in a string CoRR (2009)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the maximal number of highly periodic runs in a string CoRR (2009)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
Improved Algorithms for the Range Next Value Problem and Applications. STACS (2008)
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
Algorithms for Computing the Longest Parameterized Common Subsequence. CPM (2007)
Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu
RNA multiple structural alignment with longest common subsequences. J. Comb. Optim. 13 (2) (2007)
Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
Approximation of RNA Multiple Structural Alignment. CPM (2006)
Marcin Kubica
A Temporal Approach to Specification and Verification of Pointer Data-Structures. FASE (2003)
Michal Iglewski, Marcin Kubica, Jan Madey
Trace Specifications of Non-Deterministic Multi-Object Modules. ASIAN (1995)
Marcin Engel, Marcin Kubica, Jan Madey, David Lorge Parnas, Anders P. Ravn, A. John van Schouwen
A Formal Approach to Computer Systems Requirements Documentation. Hybrid Systems (1992)