default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorin Manea
Person information
- affiliation: University of Göttingen, Germany
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Joel D. Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea:
A Closer Look at the Expressive Power of Logics Based on Word Equations. Theory Comput. Syst. 68(3): 322-379 (2024)- [j68]Joel D. Day
, Florin Manea:
On the structure of solution-sets to regular word equations. Theory Comput. Syst. 68(4): 662-739 (2024) - [j67]Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. Proc. ACM Manag. Data 2(5): 222:1-222:19 (2024) - [c93]Florin Manea, Jonas Richardsen, Markus L. Schmid:
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. CPM 2024: 22:1-22:17 - [c92]Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh:
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. IJCAI 2024: 1907-1915 - [c91]Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Formal Languages. ISAAC 2024: 28:1-28:23 - [c90]Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. LATIN (1) 2024: 35-50 - [c89]Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh:
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. SMT@CAV 2024: 75 - [c88]Andrei Draghici, Christoph Haase, Florin Manea:
Semënov Arithmetic, Affine {VASS}, and String Constraints. STACS 2024: 29:1-29:19 - [e13]Ludovic Levy Patey, Elaine Pimentel, Lorenzo Galeotti, Florin Manea:
Twenty Years of Theoretical and Practical Synergies - 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8-12, 2024, Proceedings. Lecture Notes in Computer Science 14773, Springer 2024, ISBN 978-3-031-64308-8 [contents] - [e12]Joel D. Day, Florin Manea:
Developments in Language Theory - 28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings. Lecture Notes in Computer Science 14791, Springer 2024, ISBN 978-3-031-66158-7 [contents] - [e11]Florin Manea, Giovanni Pighizzini:
Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), NCMA 2024, Göttingen, Germany, 12-13 August 2024. EPTCS 407, 2024 [contents] - [i36]Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. CoRR abs/2401.02163 (2024) - [i35]Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh:
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. CoRR abs/2401.17159 (2024) - [i34]Florin Manea, Jonas Richardsen, Markus L. Schmid:
Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds. CoRR abs/2404.10497 (2024) - [i33]Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. CoRR abs/2409.18563 (2024) - [i32]Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Formal Languages. CoRR abs/2410.07992 (2024) - 2023
- [j66]Joel D. Day, Vijay Ganesh, Florin Manea:
Formal Languages via Theories over Strings: An Overview of Some Recent Results. Bull. EATCS 140 (2023) - [j65]Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea:
On the Expressive Power of String Constraints. Proc. ACM Program. Lang. 7(POPL): 278-308 (2023) - [j64]Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
ZaligVinder: A generic test framework for string solvers. J. Softw. Evol. Process. 35(4) (2023) - [j63]Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka:
Towards more efficient methods for solving regular-expression heavy string constraints. Theor. Comput. Sci. 943: 50-72 (2023) - [c87]Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Longest Common Subsequence with Gap Constraints. WORDS 2023: 60-76 - [c86]Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka:
k-Universality of Regular Languages. ISAAC 2023: 4:1-4:21 - [c85]Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft:
Matching Patterns with Variables Under Simon's Congruence. RP 2023: 155-170 - [c84]Pawel Gawrychowski, Maria Kosche, Florin Manea:
On the Number of Factors in the LZ-End Factorization. SPIRE 2023: 253-259 - [e10]Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea:
Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings. Lecture Notes in Computer Science 13967, Springer 2023, ISBN 978-3-031-36977-3 [contents] - [i31]Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Longest Common Subsequence with Gap Constraints. CoRR abs/2304.05270 (2023) - [i30]Andrei Draghici, Christoph Haase, Florin Manea:
Semënov Arithmetic, Affine VASS, and String Constraints. CoRR abs/2306.14593 (2023) - [i29]Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft:
Matching Patterns with Variables Under Simon's Congruence. CoRR abs/2308.08374 (2023) - [i28]Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka:
k-Universality of Regular Languages. CoRR abs/2311.10658 (2023) - 2022
- [j62]Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. Algorithmica 84(4): 1081-1106 (2022) - [j61]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Absent Subsequences in Words. Fundam. Informaticae 189(3-4): 199-240 (2022) - [j60]Florin Manea, Bianca Truthe:
Preface and Greeting Messages. J. Autom. Lang. Comb. 27(1-3): 3-13 (2022) - [c83]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. ISAAC 2022: 64:1-64:18 - [c82]Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak:
Subsequences in Bounded Ranges: Matching and Analysis Problems. RP 2022: 140-159 - [c81]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Edit Distance. SPIRE 2022: 275-289 - [c80]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Combinatorial Algorithms for Subsequence Matching: A Survey. NCMA 2022: 11-27 - [e9]Ulrich Berger, Johanna N. Y. Franklin, Florin Manea, Arno Pauly:
Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings. Lecture Notes in Computer Science 13359, Springer 2022, ISBN 978-3-031-08739-4 [contents] - [e8]Florin Manea, Alex Simpson:
30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference). LIPIcs 216, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-218-1 [contents] - [i27]Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea:
Formal Languages via Theories over Strings. CoRR abs/2205.00475 (2022) - [i26]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems. CoRR abs/2206.13896 (2022) - [i25]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Edit Distance. CoRR abs/2207.07477 (2022) - [i24]Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak:
Subsequences in Bounded Ranges: Matching and Analysis Problems. CoRR abs/2207.09201 (2022) - [i23]Joel D. Day, Adrian Kröger, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
A Generic Information Extraction System for String Constraints. CoRR abs/2208.08806 (2022) - 2021
- [j59]Florin Manea:
On Turing Machines Deciding According to the Shortest Computations. Axioms 10(4): 304 (2021) - [j58]Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. Int. J. Found. Comput. Sci. 32(6): 619-640 (2021) - [c79]Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh:
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length. CAV (2) 2021: 289-312 - [c78]Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka:
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back. WORDS 2021: 50-64 - [c77]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Hamming Distance. MFCS 2021: 48:1-48:24 - [c76]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Absent Subsequences in Words. RP 2021: 115-131 - [c75]Pamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck:
Blocksequences of k-local Words. SOFSEM 2021: 119-134 - [c74]Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
The Edit Distance to k-Subsequence Universality. STACS 2021: 25:1-25:19 - [c73]Pawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. STACS 2021: 34:1-34:18 - [e7]Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque:
Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings. Lecture Notes in Computer Science 12813, Springer 2021, ISBN 978-3-030-80048-2 [contents] - [i22]Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka:
String Theories involving Regular Membership Predicates: From Practice to Theory and Back. CoRR abs/2105.07220 (2021) - [i21]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables under Hamming Distance. CoRR abs/2106.06249 (2021) - [i20]Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Absent Subsequences in Words. CoRR abs/2108.13968 (2021) - 2020
- [j57]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Equations enforcing repetitions under permutations. Discret. Appl. Math. 285: 61-78 (2020) - [j56]Erzsébet Csuhaj-Varjú, Florin Manea:
Preface - Special Issue: A Collection of Papers in Honour of the 60th Birthday of Victor Mitrana. Int. J. Found. Comput. Sci. 31(1): 1-6 (2020) - [j55]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12(1): 6:1-6:37 (2020) - [c72]Laura Barker, Pamela Fleischmann, Katharina Harwardt, Florin Manea, Dirk Nowotka:
Scattered Factor-Universality of Words. DLT 2020: 14-28 - [c71]Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. DLT 2020: 96-109 - [c70]Joel D. Day, Florin Manea:
On the Structure of Solution Sets to Regular Word Equations. ICALP 2020: 124:1-124:16 - [c69]Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
The Power of String Solving: Simplicity of Comparison. AST@ICSE 2020: 85-88 - [c68]Joel D. Day, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
Rule-based Word Equation Solving. FormaliSE@ICSE 2020: 87-97 - [e6]Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly:
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings. Lecture Notes in Computer Science 12098, Springer 2020, ISBN 978-3-030-51465-5 [contents] - [i19]Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. CoRR abs/2001.11218 (2020) - [i18]Laura Barker, Pamela Fleischmann, Katharina Harwardt, Florin Manea, Dirk Nowotka:
Scattered Factor-Universality of Words. CoRR abs/2003.04629 (2020) - [i17]Pawel Gawrychowski, Maria Kosche, Tore Koss, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. CoRR abs/2005.01112 (2020) - [i16]Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
The Edit Distance to k-Subsequence Universality. CoRR abs/2007.09192 (2020) - [i15]Pamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck:
Blocksequences of k-local Words. CoRR abs/2008.03516 (2020) - [i14]Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh:
A Length-aware Regular Expression SMT Solver. CoRR abs/2010.07253 (2020)
2010 – 2019
- 2019
- [j54]Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka:
Hide and seek with repetitions. J. Comput. Syst. Sci. 101: 42-67 (2019) - [j53]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. 33(2): 845-861 (2019) - [c67]Florin Manea, Markus L. Schmid:
Matching Patterns with Variables. WORDS 2019: 1-27 - [c66]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
k-Spectra of Weakly-c-Balanced Words. DLT 2019: 265-277 - [c65]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP 2019: 109:1-109:16 - [c64]Joel D. Day, Florin Manea, Dirk Nowotka:
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. MFCS 2019: 44:1-44:15 - [c63]Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
On Solving Word Equations Using SAT. RP 2019: 93-106 - [c62]Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. STACS 2019: 30:1-30:17 - [e5]Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero:
Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings. Lecture Notes in Computer Science 11558, Springer 2019, ISBN 978-3-030-22995-5 [contents] - [i13]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR abs/1902.10983 (2019) - [i12]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
k-Spectra of c-Balanced Words. CoRR abs/1904.09125 (2019) - [i11]Thorsten Ehlers, Florin Manea, Dirk Nowotka, Kamellia Reshadi:
On Modelling the Avoidability of Patterns as CSP. CoRR abs/1906.00715 (2019) - [i10]Florin Manea, Markus L. Schmid:
Matching Patterns with Variables. CoRR abs/1906.06965 (2019) - [i9]Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
On Solving Word Equations Using SAT. CoRR abs/1906.11718 (2019) - 2018
- [j52]Florin Manea, Dirk Nowotka, Markus L. Schmid:
On the Complexity of Solving Restricted Word Equations. Int. J. Found. Comput. Sci. 29(5): 893-909 (2018) - [j51]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018) - [j50]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733: 44-54 (2018) - [j49]James D. Currie, Florin Manea, Dirk Nowotka, Kamellia Reshadi:
Unary patterns under permutations. Theor. Comput. Sci. 743: 72-82 (2018) - [c61]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid:
On Matching Generalised Repetitive Patterns. DLT 2018: 269-281 - [c60]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. ICALP 2018: 18:1-18:15 - [c59]Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka:
The Satisfiability of Word Equations: Decidable and Undecidable Theories. RP 2018: 15-29 - [e4]Florin Manea, Russell G. Miller, Dirk Nowotka:
Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings. Lecture Notes in Computer Science 10936, Springer 2018, ISBN 978-3-319-94417-3 [contents] - [i8]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. CoRR abs/1801.08565 (2018) - [i7]Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka:
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability. CoRR abs/1802.00523 (2018) - [i6]Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. CoRR abs/1810.07422 (2018) - 2017
- [j48]Marius Dumitran, Pawel Gawrychowski, Florin Manea:
Longest Gapped Repeats and Palindromes. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [j47]Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit:
Preface. J. Autom. Lang. Comb. 22(1-3): 3-4 (2017) - [j46]Florin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki:
The extended equation of Lyndon and Schützenberger. J. Comput. Syst. Sci. 85: 132-167 (2017) - [j45]Florin Manea, Bianca Truthe, György Vaszil:
TCS Special Issue on Languages and Combinatorics in Theory and Nature. Theor. Comput. Sci. 682: 2-4 (2017) - [j44]Florin Manea, Dirk Nowotka:
TCS Special Issue: Combinatorics on Words - WORDS 2015. Theor. Comput. Sci. 684: 1-2 (2017) - [c58]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Equations Enforcing Repetitions Under Permutations. WORDS 2017: 72-84 - [c57]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Local Patterns. FSTTCS 2017: 24:1-24:14 - [c56]Joel D. Day, Florin Manea, Dirk Nowotka:
The Hardness of Solving Simple Word Equations. MFCS 2017: 18:1-18:14 - [c55]Dmitry Kosolobov, Florin Manea, Dirk Nowotka:
Detecting One-Variable Patterns. SPIRE 2017: 254-270 - [e3]Jarkko Kari, Florin Manea, Ion Petre:
Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Lecture Notes in Computer Science 10307, Springer 2017, ISBN 978-3-319-58740-0 [contents] - [i5]Joel D. Day, Florin Manea, Dirk Nowotka:
The Hardness of Solving Simple Word Equations. CoRR abs/1702.07922 (2017) - 2016
- [c54]Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea:
Factorizing a String into Squares in Linear Time. CPM 2016: 27:1-27:12 - [c53]Florin Manea, Dirk Nowotka, Markus L. Schmid:
On the Solvability Problem for Restricted Classes of Word Equations. DLT 2016: 306-318 - [c52]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal alpha-gapped Repeats. STACS 2016: 39:1-39:14 - [e2]Cezar Câmpeanu, Florin Manea, Jeffrey O. Shallit:
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Lecture Notes in Computer Science 9777, Springer 2016, ISBN 978-3-319-41113-2 [contents] - [i4]Dmitry Kosolobov, Florin Manea, Dirk Nowotka:
Detecting Unary Patterns. CoRR abs/1604.00054 (2016) - 2015
- [j43]Jürgen Dassow, Florin Manea, Bianca Truthe:
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters. Fundam. Informaticae 136(1-2): 1-35 (2015) - [j42]Marius Dumitran, Javier Gil, Florin Manea, Victor Mitrana:
Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results. Int. J. Found. Comput. Sci. 26(7): 933-952 (2015) - [j41]Florin Manea, Mike Müller, Dirk Nowotka:
Cubic patterns with permutations. J. Comput. Syst. Sci. 81(7): 1298-1310 (2015) - [j40]Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka:
k-Abelian pattern matching. J. Discrete Algorithms 34: 37-48 (2015) - [j39]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Hairpin lengthening: language theoretic and algorithmic results. J. Log. Comput. 25(4): 987-1009 (2015) - [c51]Marius Dumitran, Florin Manea:
Prefix-Suffix Square Completion. WORDS 2015: 147-159 - [c50]Florin Manea, Shinnosuke Seki:
Square-Density Increasing Mappings. WORDS 2015: 160-169 - [c49]James D. Currie, Florin Manea, Dirk Nowotka:
Unary Patterns with Permutations. DLT 2015: 191-202 - [c48]Pawel Gawrychowski, Florin Manea:
Longest α-Gapped Repeat and Palindrome. FCT 2015: 27-40 - [c47]Marius Dumitran, Florin Manea:
Longest Gapped Repeats and Palindromes. MFCS (1) 2015: 205-217 - [c46]Marius Dumitran, Florin Manea, Dirk Nowotka:
On Prefix/Suffix-Square Free Words. SPIRE 2015: 54-66 - [c45]Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS 2015: 302-315 - [e1]Florin Manea, Dirk Nowotka:
Combinatorics on Words - 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings. Lecture Notes in Computer Science 9304, Springer 2015, ISBN 978-3-319-23659-9 [contents] - [i3]Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter:
Testing k-binomial equivalence. CoRR abs/1509.00622 (2015) - [i2]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal $α$-gapped Repeats. CoRR abs/1509.09237 (2015) - [i1]Marius Dumitran, Pawel Gawrychowski, Florin Manea:
Longest Gapped Repeats and Palindromes. CoRR abs/1511.07180 (2015) - 2014
- [j38]Florin Manea, Robert Mercas, Catalin Tiseanu:
An algorithmic toolbox for periodic partial words. Discret. Appl. Math. 179: 174-192 (2014) - [j37]Liviu P. Dinu, Radu Gramatovici, Florin Manea:
Syllabic Languages and Go-through Automata. Fundam. Informaticae 131(3-4): 409-424 (2014) - [j36]Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji:
The pseudopalindromic completion of regular languages. Inf. Comput. 239: 222-236 (2014) - [j35]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. Int. J. Found. Comput. Sci. 25(8): 1049-1064 (2014) - [j34]Jürgen Dassow, Florin Manea, Robert Mercas:
Regular languages of partial words. Inf. Sci. 268: 290-304 (2014) - [j33]Jesús García-López, Florin Manea, Victor Mitrana:
Prefix-suffix duplication. J. Comput. Syst. Sci. 80(7): 1254-1265 (2014) - [j32]Florin Manea, Bianca Truthe:
Accepting Networks of Evolutionary Processors with Subregular Filters. Theory Comput. Syst. 55(1): 84-109 (2014) - [c44]Henning Bordihn, Florin Manea, Victor Mitrana, Daniel-Claudian Voinescu:
Two Variants of Synchronized Shuffle on Backbones. Discrete Mathematics and Computer Science 2014: 77-87 - [c43]Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka:
k-Abelian Pattern Matching. Developments in Language Theory 2014: 178-190 - [c42]Florin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki:
Generalised Lyndon-Schützenberger Equations. MFCS (1) 2014: 402-413 - [c41]Natasa Jonoska, Florin Manea, Shinnosuke Seki:
A Stronger Square Conjecture on Binary Words. SOFSEM 2014: 339-350 - [c40]Pawel Gawrychowski, Florin Manea, Dirk Nowotka:
Testing Generalised Freeness of Words. STACS 2014: 337-349 - [c39]Marius Dumitran, Javier Gil, Florin Manea, Victor Mitrana:
Bounded Prefix-Suffix Duplication. CIAA 2014: 176-187 - 2013
- [j31]Jürgen Dassow, Florin Manea, Bianca Truthe:
Networks of evolutionary processors: the power of subregular filters. Acta Informatica 50(1): 41-75 (2013) - [j30]Florin Manea, Catalin Tiseanu:
The hardness of counting full words compatible with partial words. J. Comput. Syst. Sci. 79(1): 7-22 (2013) - [c38]Pawel Gawrychowski, Florin Manea, Dirk Nowotka:
Discovering Hidden Repetitions in Words. CiE 2013: 210-219 - [c37]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. Developments in Language Theory 2013: 155-166 - [c36]Florin Manea, Mike Müller, Dirk Nowotka:
On the Pseudoperiodic Extension of u^l = v^m w^n. FSTTCS 2013: 475-486 - [c35]Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu:
Finding Pseudo-repetitions. STACS 2013: 257-268 - 2012
- [j29]Jürgen Dassow, Florin Manea, Bianca Truthe:
Generating Networks of Splicing Processors. RAIRO Theor. Informatics Appl. 46(4): 547-572 (2012) - [j28]Jürgen Dassow, Florin Manea, Bianca Truthe:
On Subregular Selection Languages in Internal Contextual Grammars. J. Autom. Lang. Comb. 17(2-4): 145-164 (2012) - [j27]Jürgen Dassow, Florin Manea, Bianca Truthe:
Networks of evolutionary processors: computationally complete normal forms. Nat. Comput. 11(4): 595-607 (2012) - [j26]Jürgen Dassow, Florin Manea, Bianca Truthe:
On external contextual grammars with subregular selection languages. Theor. Comput. Sci. 449: 64-73 (2012) - [j25]Sherzod Turaev, Jürgen Dassow, Florin Manea, Mohd Hasan Selamat:
Language classes generated by tree controlled grammars with bounded nonterminal complexity. Theor. Comput. Sci. 449: 134-144 (2012) - [j24]Florin Manea:
Complexity results for deciding Networks of Evolutionary Processors. Theor. Comput. Sci. 456: 65-79 (2012) - [c34]Florin Manea, Robert Mercas, Victor Mitrana:
Hairpin Lengthening and Shortening of Regular Languages. Languages Alive 2012: 145-159 - [c33]Jürgen Dassow, Florin Manea, Robert Mercas:
Connecting Partial Words and Regular Languages. CiE 2012: 151-161 - [c32]Florin Manea, Bianca Truthe:
On Internal Contextual Grammars with Subregular Selection Languages. DCFS 2012: 222-235 - [c31]Florin Manea, Mike Müller, Dirk Nowotka:
The Avoidability of Cubes under Permutations. Developments in Language Theory 2012: 416-427 - [c30]Florin Manea, Robert Mercas, Dirk Nowotka:
Fine and Wilf's Theorem and Pseudo-repetitions. MFCS 2012: 668-680 - [c29]Cristian Grozea, Florin Manea, Mike Müller, Dirk Nowotka:
String Matching with Involutions. UCNC 2012: 106-117 - 2011
- [j23]Masami Ito, Peter Leupold, Florin Manea, Victor Mitrana:
Bounded hairpin completion. Inf. Comput. 209(3): 471-485 (2011) - [j22]Paolo Bottoni, Anna Labella, Florin Manea, Victor Mitrana, Ion Petre, José M. Sempere:
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors. Nat. Comput. 10(1): 429-445 (2011) - [c28]Florin Manea, Bianca Truthe:
Accepting Networks of Evolutionary Processors with Subregular Filters. AFL 2011: 300-314 - [c27]Paolo Bottoni, Radu Gramatovici, Anna Labella, Florin Manea, Victor Mitrana:
Context Insertions. Computation, Cooperation, and Life 2011: 24-34 - [c26]Florin Manea:
Deciding According to the Shortest Computations. CiE 2011: 191-200 - [c25]Jürgen Dassow, Florin Manea, Bianca Truthe:
On Contextual Grammars with Subregular Selection Languages. DCFS 2011: 135-146 - [c24]Radu Gramatovici, Florin Manea:
k-Local Internal Contextual Grammars. DCFS 2011: 172-183 - [c23]Florin Manea:
Deciding Networks of Evolutionary Processors. Developments in Language Theory 2011: 337-349 - [c22]Jürgen Dassow, Florin Manea, Bianca Truthe:
Networks of Evolutionary Processors with Subregular Filters. LATA 2011: 262-273 - [c21]Florin Manea, Robert Mercas, Catalin Tiseanu:
Periodicity Algorithms for Partial Words. MFCS 2011: 472-484 - [c20]Jürgen Dassow, Florin Manea, Bianca Truthe:
Generating Networks of Splicing Processors. NCMA 2011: 121-136 - [c19]Jürgen Dassow, Florin Manea, Bianca Truthe:
On Normal Forms for Networks of Evolutionary Processors. UC 2011: 89-100 - 2010
- [j21]Remco Loos, Florin Manea, Victor Mitrana:
Small universal accepting hybrid networks of evolutionary processors. Acta Informatica 47(2): 133-146 (2010) - [j20]Florin Manea, Victor Mitrana, Takashi Yokomori:
Some Remarks on the Hairpin Completion. Int. J. Found. Comput. Sci. 21(5): 859-872 (2010) - [j19]Remco Loos, Florin Manea, Victor Mitrana:
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections. J. Autom. Lang. Comb. 15(1/2): 155-174 (2010) - [j18]Florin Manea, Maurice Margenstern, Victor Mitrana, Mario J. Pérez-Jiménez:
A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors. Theory Comput. Syst. 46(2): 174-192 (2010) - [j17]Florin Manea:
A series of algorithmic results related to the iterated hairpin completion. Theor. Comput. Sci. 411(48): 4162-4178 (2010) - [c18]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Hairpin Lengthening. CiE 2010: 296-306 - [c17]Florin Manea, Catalin Tiseanu:
Hard Counting Problems for Partial Words. LATA 2010: 426-438 - [c16]Jürgen Dassow, Florin Manea:
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. DCFS 2010: 68-77 - [p1]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Accepting Networks of Evolutionary Word and Picture Processors: A Survey. Scientific Applications of Language Methods 2010: 525-561
2000 – 2009
- 2009
- [j16]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
On some algorithmic problems regarding the hairpin completion. Discret. Appl. Math. 157(9): 2143-2152 (2009) - [j15]Remco Loos, Florin Manea, Victor Mitrana:
On small, reduced, and fast universal accepting networks of splicing processors. Theor. Comput. Sci. 410(4-5): 406-416 (2009) - [j14]Florin Manea, Victor Mitrana, Takashi Yokomori:
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. Theor. Comput. Sci. 410(4-5): 417-425 (2009) - [c15]Florin Manea, Victor Mitrana, José M. Sempere:
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity. Developments in Language Theory 2009: 372-383 - [c14]Paolo Bottoni, Anna Labella, Florin Manea, Victor Mitrana, José M. Sempere:
Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof. DNA 2009: 1-11 - [c13]Adrian Diaconu, Florin Manea, Catalin Tiseanu:
Combinatorial Queries and Updates on Partial Words. FCT 2009: 96-108 - [c12]Florin Manea, Victor Mitrana:
Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges. ICAART 2009: 597-604 - [c11]Paolo Bottoni, Anna Labella, Florin Manea, Victor Mitrana, José M. Sempere:
Networks of Evolutionary Picture Processors with Filtered Connections. UC 2009: 70-84 - [c10]Remco Loos, Florin Manea, Victor Mitrana:
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections. DCFS 2009: 173-182 - 2008
- [j13]Cezara Dragoi, Florin Manea:
On the Descriptional Complexity of Accepting Networks of Evolutionary Processors with Filtered Connections. Int. J. Found. Comput. Sci. 19(5): 1113-1132 (2008) - [c9]Florin Manea, Victor Mitrana, Takashi Yokomori:
Some Remarks on the Hairpin Completion. AFL 2008: 302-313 - 2007
- [j12]Florin Manea, Calina Ploscaru:
A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem. Fundam. Informaticae 81(4): 459-471 (2007) - [j11]Florin Manea:
On the recognition of context-free languages using accepting hybrid networks of evolutionary processors. Int. J. Comput. Math. 84(3): 273-285 (2007) - [j10]Florin Manea, Victor Mitrana:
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. Inf. Process. Lett. 103(3): 112-118 (2007) - [j9]Cezara Dragoi, Florin Manea, Victor Mitrana:
Accepting Networks of Evolutionary Processors with Filtered Connections. J. Univers. Comput. Sci. 13(11): 1598-1614 (2007) - [j8]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
On the size complexity of universal accepting hybrid networks of evolutionary processors. Math. Struct. Comput. Sci. 17(4): 753-771 (2007) - [j7]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Accepting networks of splicing processors: Complexity results. Theor. Comput. Sci. 371(1-2): 72-82 (2007) - [j6]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82]. Theor. Comput. Sci. 378(1): 131 (2007) - [j5]Florin Manea, Robert Mercas:
Freeness of partial words. Theor. Comput. Sci. 389(1-2): 265-277 (2007) - [c8]Florin Manea, Victor Mitrana:
Hairpin Completion Versus Hairpin Reduction. CiE 2007: 532-541 - [c7]Liviu Petrisor Dinu, Radu Gramatovici, Florin Manea:
On the syllabification of words via go-through automata. LATA 2007: 223-236 - [c6]Juan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana:
Accepting Networks of Splicing Processors with Filtered Connections. MCU 2007: 218-229 - 2006
- [j4]Victor Mitrana, Florin Manea, Carlos Martín-Vide:
On Some Algorithmic Problems Regarding the Hairpin Completion. Electron. Notes Discret. Math. 27: 71-72 (2006) - [j3]Florin Manea, Victor Mitrana, Daniel-Claudian Voinescu:
Synchronized Shuffle on Backbones. Fundam. Informaticae 73(1-2): 191-202 (2006) - [j2]Liviu Petrisor Dinu, Florin Manea:
An efficient approach for the rank aggregation problem. Theor. Comput. Sci. 359(1-3): 455-461 (2006) - [c5]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. DNA 2006: 47-57 - 2005
- [j1]Radu Gramatovici, Florin Manea:
Parsing Local Internal Contextual Languages with Context-Free Choice. Fundam. Informaticae 64(1-4): 171-183 (2005) - [c4]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Accepting Networks of Splicing Processors. CiE 2005: 300-309 - [c3]Florin Manea:
Timed Accepting Hybrid Networks of Evolutionary Processors. IWINAC (2) 2005: 122-132 - [c2]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
A Universal Accepting Hybrid Network of Evolutionary Processors. DCM@ICALP 2005: 95-105 - 2004
- [c1]Florin Manea, Carlos Martín-Vide, Victor Mitrana:
Solving 3CNF-SAT and HPP in Linear Time Using WWW. MCU 2004: 269-280
Coauthor Index
Tore Koss
aka: Tore Koß
aka: Tore Koß
[j64] [j63] [c86] [c85] [i29] [i28] [i23] [j58] [c79] [c78] [c75] [i22] [j57] [c72] [c71] [c69] [c68] [i19] [i18] [i15] [i14] [j54] [j53] [c66] [c64] [c63] [i12] [i11] [i9] [j52] [j49] [c61] [c60] [c59] [e4] [i8] [i7] [j46] [j44] [c58] [c57] [c56] [c55] [i5] [c53] [i4] [j41] [j40] [c49] [c46] [e1] [c43] [c42] [c40] [c38] [c36] [c35] [c31] [c30] [c29]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
