Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Tomasz Waleń
2018
- Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the string consensus problem and the Manhattan sequence consensus problem, Theoretical Computer Science 710 2018, s. 126–138.zobacz w PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient algorithms for shortest partial seeds in words, Theoretical Computer Science 710 2018, s. 139–147.zobacz w PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń i Wiktor Zuba, Faster Recovery of Approximate Periods over Edit Distance, w: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, 2018, s. 233–240.zobacz w PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Algorithm for Long LCF with k Mismatches, w: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 23, s. 23:1–23:16.zobacz w PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On Periodicity Lemma for Partial Words, w: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, Springer, 2018, s. 232–244.zobacz w PBN
- Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur i Tomasz Waleń, String Periods in the Order-Preserving Model, w: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 38, s. 38:1–38:16.zobacz w PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient enumeration of non-equivalent squares in partial words with few holes, Journal Of Combinatorial Optimization 2018.zobacz w PBN
2017
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, String Powers in Trees, Algorithmica 79 (3) 2017, s. 814–834.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Covering problems for partial words and for indeterminate strings, Theoretical Computer Science 698 2017, s. 25–39.zobacz w PBN
- Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes, w: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, 2017, s. 99–111.zobacz w PBN
2016
- Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, s. 38–48.zobacz w PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Maximum number of distinct and nonequivalent nonstandard squares in a word, Theoretical Computer Science 648 2016, s. 84–95.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Order-preserving indexing, Theoretical Computer Science 638 2016, s. 122–135.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries, w: String Processing and Information Retrieval - 23rd International Symposium, 2016, s. 22–34.zobacz w PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter i Tomasz Waleń, Faster longest common extension queries in strings over general alphabets, w: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 2016, r. 5, s. 5:1–5:13.zobacz w PBN
- Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters 116 (3) 2016, s. 245–251.zobacz w PBN
2015
- Grzegorz Chojnowski, Tomasz Waleń, Paweł Piątkowski, Wojciech Marek Potrzebowski i Janusz Bujnicki, Brickworx builds recurrent RNA and DNA structural motifs into medium- and low-resolution electron-density maps, Acta Crystallographica Section D: Biological Crystallography 71 (3) 2015, s. 697–705.zobacz w PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Internal Pattern Matching Queries in a Text and Applications, w: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2015, s. 532–551.zobacz w PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Algorithmica 73 (1) 2015, s. 217–233.zobacz w PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Theoretical Computer Science 602 2015, s. 7–21.zobacz w PBN
- Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, A note on the longest common compatible prefix problem for partial words, Journal Of Discrete Algorithms 34 2015, s. 49–53.zobacz w PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, String Powers in Trees, w: Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, Springer, 2015, s. 284–294.zobacz w PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Universal Reconstruction of a String, w: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Springer, 2015, s. 386–397.zobacz w PBN
- Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto i Tomasz Waleń, Efficient Algorithms for Longest Closed Factor Array, w: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, s. 95–102.zobacz w PBN
- Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter i Tomasz Waleń, Tight Bound for the Number of Distinct Palindromes in a Tree, w: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, 2015, s. 270–276.zobacz w PBN
2014
- Grzegorz Chojnowski, Tomasz Waleń i Janusz Bujnicki, RNA Bricks - a database of RNA 3D motifs and their interactions, Nucleic Acids Research 42 (Database-Issue) 2014, s. 123–131.zobacz w PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient counting of square substrings in a tree, Theoretical Computer Science 544 2014, s. 60–73.zobacz w PBN
- Tomasz Waleń, Grzegorz Chojnowski, Przemysław Gierski i Janusz Bujnicki, ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes, Nucleic Acids Research 42 (19) 2014, s. e151.zobacz w PBN
- Tomasz Kociumaka, Solon Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Shortest Partial Seeds in Words, Lecture Notes In Computer Science 8486 2014, s. 192–201.zobacz w PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word, Lecture Notes In Computer Science 8633 2014, s. 215–226.zobacz w PBN
- Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Covering Problems for Partial Words and for Indeterminate Strings, Lecture Notes In Computer Science 8889 2014, s. 220––232.zobacz w PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the String Consensus Problem and the Manhattan Sequence Consensus Problem, Lecture Notes In Computer Science 8799 2014, s. 244–255.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Extracting powers and periods in a word from its runs structure, Theoretical Computer Science 521 (Complete) 2014, s. 29–41.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Krzysztof Stencel i Tomasz Waleń, New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics 163 2014, s. 258–267.zobacz w PBN
2013
- Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Computing the Longest Previous Factor, European Journal Of Combinatorics 34 (1) 2013, s. 15–26.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, Lecture Notes In Computer Science 8214 2013, s. 84–95.zobacz w PBN
- Tomasz Kociumaka, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing, Lecture Notes In Computer Science 7810 2013, s. 383–394.zobacz w PBN
- Tomasz Kociumaka, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Fast Algorithm for Partial Covers in Words, Lecture Notes In Computer Science 7922 2013, s. 177–188.zobacz w PBN
- Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Jan Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient seed computation revisited, Theoretical Computer Science 483 (Complete) 2013, s. 171–181.zobacz w PBN
- Marcin Kubica, Tomasz Kulczyński, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, A linear time algorithm for consecutive permutation pattern matching, Information Processing Letters 113 (12) 2013, s. 430–433.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński i Tomasz Waleń, A note on efficient computation of all Abelian periods in a string, Information Processing Letters 113 (3) 2013, s. 74–77.zobacz w PBN
- Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the maximum number of cubic subwords in a word, European Journal Of Combinatorics 34 (1) 2013, s. 27–37.zobacz w PBN
2012
- Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Wojciech Tyczyński i Tomasz Waleń, The Maximum Number of Squares in a Tree, w: Computer Vision and Graphics. International Conference, ICCVG 2012, Warsaw, Poland, September 24-26, 2012. Proceedings, Springer, Berlin 2012, r. 7354, s. 27–40.zobacz w PBN
- Maxime Crochemore, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the maximal sum of exponents of runs in a string, Journal Of Discrete Algorithms 14 2012, s. 29–36.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, The maximal number of cubic runs in a word, Journal Of Computer And System Sciences 78 (6) 2012, s. 1828–1836.zobacz w PBN
- Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Journal Of Computer And System Sciences 78 (6) 2012, s. 1828–1836.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient algorithms for three variants of the LPF table, Journal Of Discrete Algorithms 11 2012, s. 51–61.zobacz w PBN
- Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Data Structures for the Factor Periodicity Problem, w: SPIRE, 2012.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler i Tomasz Waleń, Improved algorithms for the range next value problem and applications, Theoretical Computer Science 434 2012, s. 23–34.zobacz w PBN
- Tomasz Kociumaka, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, A linear time algorithm for seeds computation, w: SODA, 2012, s. 1095–1112.zobacz w PBN
- Tomasz Kociumaka, Jakub Pachocki, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Efficient Counting of Square Substrings in a Tree, w: Lecture Notes in Computer Science, Springer, Heidelberg 2012, r. 7676, s. 207–216.zobacz w PBN
2011
- Grzegorz Jakacki, Marcin Kubica i Tomasz Waleń, Codility. Application of Olympiad-Style Code Assessment to Pre-Hire Screening of Programmers, Olympiads In Informatics 5 2011, s. 32–43.zobacz w PBN
- Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-Time Approximation Algorithms for Weighted LCS Problem, Lecture Notes In Computer Science 6661 2011, s. 455–466.zobacz w PBN
- Marcin Kubica, Romeo Rizzi, Stephane Vialette i Tomasz Waleń, Approximation of RNA multiple structural alignment, Journal Of Discrete Algorithms 9 (4) 2011, s. 365–376.zobacz w PBN
- Michałis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, w: CPM, 2011.zobacz w PBN
- Michalis Christou, Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Solon Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder i Tomasz Waleń, Efficient Seeds Computation Revisited, Lecture Notes In Computer Science 6661 2011, s. 350–363.zobacz w PBN
2010
- Maxime Crochemore, Marcin Kubica, Tomasz Waleń, Costas S. Iliopoulos i M. Sohel Rahman, Finding Patterns In Given Intervals, Fundamenta Informaticae 101 (3) 2010, s. 173–186.zobacz w PBN
- Marcin Kubica, Wojciech Rytter, Tomasz Waleń, Krzysztof Stencel, Jakub Radoszewski, Maxime Crochemore i Costas Iliopoulos, New Simple Efficient Algorithms Computing Powers and Runs in Strings, w: PSC, 2010, s. 138–149.zobacz w PBN
- Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Sum of Exponents of Runs in a String, Lecture Notes In Computer Science 6460 2010, s. 10–19.zobacz w PBN
- Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Algorithms for Three Versions of the Shortest Common Superstring Problem, Lecture Notes In Computer Science 6129 2010, s. 299–309.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays, Lecture Notes In Computer Science 5901 2010, s. 296–307.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes In Computer Science 6393 2010, s. 258–269.zobacz w PBN
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Runs in a String, Lecture Notes In Computer Science 6031 2010, s. 227–238.zobacz w PBN
- Rok Erman, Łukasz Kowalik, Matjaz Krnc i Tomasz Waleń, Improved induced matchings in sparse graphs, Discrete Applied Mathematics 158 (18) 2010, s. 1994–2003.zobacz w PBN
2009
- Marcin Kubica, Jakub Radoszewski, Wojciech Rytter i Tomasz Waleń, On the Maximal Number of Cubic Subwords in a String, Lecture Notes In Computer Science 5874 2009, s. 345–355.zobacz w PBN
- Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter i Tomasz Waleń, LPF Computation Revisited, Lecture Notes In Computer Science 5874 2009, s. 158–169.zobacz w PBN
- Rok Erman, Łukasz Kowalik, Matjaz Krnc i Tomasz Waleń, Improved Induced Matchings in Sparse Graphs, Lecture Notes In Computer Science 5917 2009, s. 134–148.zobacz w PBN
- Marcin Kubica i Tomasz Waleń, Improved Algorithm for Rhythm Recognition in Musical Sequences, w: London Algorithmics 2008: Theory and Practice, College Publications, London 2009.zobacz w PBN
2008
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman i Tomasz Waleń, Improved Algorithms for the Range Next Value Problem and Applications, w: STACS, 2008.zobacz w PBN
2006
- S. Bereg, Marcin Kubica, Tomasz Waleń i B. Zhu, RNA multiple structural alignment with longest common subsequences, Journal Of Combinatorial Optimization 13 (2) 2006, s. 179–188.zobacz w PBN
- Marcin Kubica, R. Rizzi, St, Vialette i Tomasz Waleń, Approximation of RNA Multiple Structural Alignment, Lecture Notes In Computer Science 4009 2006, s. 211–222.zobacz w PBN
- P. Kolman i Tomasz Waleń, Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set, Lecture Notes In Computer Science 4368 2006, s. 281–291.zobacz w PBN
2004
- Krzysztof Ciebiera, Janina Mincer-Daszkiewicz i Tomasz Waleń, New Course Registration Module for the University Study-Oriented System, w: EUNIS 2004, The Tenth International Conference of European University Information Systems, University of Ljubljana, Faculty of Computer and Information, Bled, Slovenia 2004, s. 247–252.zobacz w PBN
- Krzysztof Diks, Krzysztof Onak i Tomasz Waleń (red.), XI Olimpiada Informatyczna 2003/2004, Komitet Główny Olimpiady Informatycznej, Warszawa 2004.zobacz w PBN
2003
- Krzysztof Ciebiera i Tomasz Waleń, Large scale programming contest system, w: EUNIS 2003, 9th International Conference of European University Information Systems, Universiteit van Amsterdam, Amsterdam, the Netherlands 2003.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
