Florin Manea

According to our database1, Florin Manea
  • authored at least 108 papers between 2004 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
TCS Special Issue on Languages and Combinatorics in Theory and Nature.
Theor. Comput. Sci., 2017

TCS Special Issue: Combinatorics on Words - WORDS 2015.
Theor. Comput. Sci., 2017

The extended equation of Lyndon and Schützenberger.
J. Comput. Syst. Sci., 2017

The Hardness of Solving Simple Word Equations.
CoRR, 2017

Detecting One-Variable Patterns.
Proceedings of the String Processing and Information Retrieval, 2017

Equations Enforcing Repetitions Under Permutations.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Detecting Unary Patterns.
CoRR, 2016

Efficiently Finding All Maximal alpha-gapped Repeats.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On the Solvability Problem for Restricted Classes of Word Equations.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

Factorizing a String into Squares in Linear Time.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Hairpin lengthening: language theoretic and algorithmic results.
J. Log. Comput., 2015

k-Abelian pattern matching.
J. Discrete Algorithms, 2015

Cubic patterns with permutations.
J. Comput. Syst. Sci., 2015

Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results.
Int. J. Found. Comput. Sci., 2015

On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.
Fundam. Inform., 2015

Efficiently Finding All Maximal $α$-gapped Repeats.
CoRR, 2015

Testing k-binomial equivalence.
CoRR, 2015

Longest Gapped Repeats and Palindromes.
CoRR, 2015

Pattern Matching with Variables: Fast Algorithms and New Hardness Results.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On Prefix/Suffix-Square Free Words.
Proceedings of the String Processing and Information Retrieval, 2015

Longest Gapped Repeats and Palindromes.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Longest α-Gapped Repeat and Palindrome.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Unary Patterns with Permutations.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Square-Density Increasing Mappings.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Prefix-Suffix Square Completion.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
Accepting Networks of Evolutionary Processors with Subregular Filters.
Theory Comput. Syst., 2014

Prefix-suffix duplication.
J. Comput. Syst. Sci., 2014

Regular languages of partial words.
Inf. Sci., 2014

Inner Palindromic Closure.
Int. J. Found. Comput. Sci., 2014

The pseudopalindromic completion of regular languages.
Inf. Comput., 2014

Syllabic Languages and Go-through Automata.
Fundam. Inform., 2014

An algorithmic toolbox for periodic partial words.
Discrete Applied Mathematics, 2014

Bounded Prefix-Suffix Duplication.
Proceedings of the Implementation and Application of Automata, 2014

Testing Generalised Freeness of Words.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

A Stronger Square Conjecture on Binary Words.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Generalised Lyndon-Schützenberger Equations.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

k-Abelian Pattern Matching.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Two Variants of Synchronized Shuffle on Backbones.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
The hardness of counting full words compatible with partial words.
J. Comput. Syst. Sci., 2013

Networks of evolutionary processors: the power of subregular filters.
Acta Inf., 2013

Finding Pseudo-repetitions.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

On the Pseudoperiodic Extension of u^l = v^m w^n.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Inner Palindromic Closure.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Discovering Hidden Repetitions in Words.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Language classes generated by tree controlled grammars with bounded nonterminal complexity.
Theor. Comput. Sci., 2012

Complexity results for deciding Networks of Evolutionary Processors.
Theor. Comput. Sci., 2012

On external contextual grammars with subregular selection languages.
Theor. Comput. Sci., 2012

Networks of evolutionary processors: computationally complete normal forms.
Natural Computing, 2012

On Subregular Selection Languages in Internal Contextual Grammars.
Journal of Automata, Languages and Combinatorics, 2012

Generating Networks of Splicing Processors.
RAIRO - Theor. Inf. and Applic., 2012

String Matching with Involutions.
Proceedings of the Unconventional Computation and Natural Computation, 2012

Fine and Wilf's Theorem and Pseudo-repetitions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

The Avoidability of Cubes under Permutations.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

On Internal Contextual Grammars with Subregular Selection Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

Connecting Partial Words and Regular Languages.
Proceedings of the How the World Computes, 2012

Hairpin Lengthening and Shortening of Regular Languages.
Proceedings of the Languages Alive, 2012

2011
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors.
Natural Computing, 2011

Bounded hairpin completion.
Inf. Comput., 2011

On Normal Forms for Networks of Evolutionary Processors.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Generating Networks of Splicing Processors.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

Periodicity Algorithms for Partial Words.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Networks of Evolutionary Processors with Subregular Filters.
Proceedings of the Language and Automata Theory and Applications, 2011

Deciding Networks of Evolutionary Processors.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

k-Local Internal Contextual Grammars.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

On Contextual Grammars with Subregular Selection Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Deciding According to the Shortest Computations.
Proceedings of the Models of Computation in Context, 2011

Context Insertions.
Proceedings of the Computation, 2011

Accepting Networks of Evolutionary Processors with Subregular Filters.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
A series of algorithmic results related to the iterated hairpin completion.
Theor. Comput. Sci., 2010

A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors.
Theory Comput. Syst., 2010

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections.
Journal of Automata, Languages and Combinatorics, 2010

Some Remarks on the Hairpin Completion.
Int. J. Found. Comput. Sci., 2010

Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Small universal accepting hybrid networks of evolutionary processors.
Acta Inf., 2010

Hard Counting Problems for Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2010

Hairpin Lengthening.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Accepting Networks of Evolutionary Word and Picture Processors: A Survey.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction.
Theor. Comput. Sci., 2009

On small, reduced, and fast universal accepting networks of splicing processors.
Theor. Comput. Sci., 2009

On some algorithmic problems regarding the hairpin completion.
Discrete Applied Mathematics, 2009

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Networks of Evolutionary Picture Processors with Filtered Connections.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges.
Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

Combinatorial Queries and Updates on Partial Words.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof.
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
On the Descriptional Complexity of Accepting Networks of Evolutionary Processors with Filtered Connections.
Int. J. Found. Comput. Sci., 2008

Some Remarks on the Hairpin Completion.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82].
Theor. Comput. Sci., 2007

Accepting networks of splicing processors: Complexity results.
Theor. Comput. Sci., 2007

Freeness of partial words.
Theor. Comput. Sci., 2007

On the size complexity of universal accepting hybrid networks of evolutionary processors.
Mathematical Structures in Computer Science, 2007

Accepting Networks of Evolutionary Processors with Filtered Connections.
J. UCS, 2007

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size.
Inf. Process. Lett., 2007

On the recognition of context-free languages using accepting hybrid networks of evolutionary processors.
Int. J. Comput. Math., 2007

A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem.
Fundam. Inform., 2007

Accepting Networks of Splicing Processors with Filtered Connections.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

On the syllabification of words via go-through automata.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Hairpin Completion Versus Hairpin Reduction.
Proceedings of the Computation and Logic in the Real World, 2007

2006
An efficient approach for the rank aggregation problem.
Theor. Comput. Sci., 2006

Synchronized Shuffle on Backbones.
Fundam. Inform., 2006

A Universal Accepting Hybrid Network of Evolutionary Processors.
Electr. Notes Theor. Comput. Sci., 2006

On Some Algorithmic Problems Regarding the Hairpin Completion.
Electronic Notes in Discrete Mathematics, 2006

All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005
Parsing Local Internal Contextual Languages with Context-Free Choice.
Fundam. Inform., 2005

Timed Accepting Hybrid Networks of Evolutionary Processors.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

Accepting Networks of Splicing Processors.
Proceedings of the New Computational Paradigms, 2005

2004
Solving 3CNF-SAT and HPP in Linear Time Using WWW.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004


  Loading...