|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 39 publication records. Showing 39 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 71 | F. Sokhatsky |
The Deepest Repetition-Free Decompositions of Non-Singular Functions of Finite-Valued Logics.  |
ISMVL  |
1996 |
DBLP DOI BibTeX RDF |
nonsingular functions, finite-valued logics, repetition-free, isotopy change, commutation change, associative change, Boolean functions, Boolean functions, multivalued logic, three-valued logics |
| 40 | Veikko Keränen |
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet. |
ICALP |
1985 |
DBLP DOI BibTeX RDF |
|
| 30 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi |
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 29 | Veikko Keränen |
On the k-Freeness of Morphisms on Free Monoids. |
STACS |
1987 |
DBLP DOI BibTeX RDF |
|
| 26 | Piotr Dembinski, Jan Maluszynski |
Two Level Grammars: CF-Grammars with Equation Schemes. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
| 24 | Veikko Keränen |
Abelian Squares are Avoidable on 4 Letters. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 18 | Trienko L. Grobler, Manfred Habeck, Lynette van Zijl, Jaco Geldenhuys |
Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words. |
J. Univers. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
| 18 | Jean Weight, Trienko L. Grobler, Lynette van Zijl, Carlyle Stewart |
A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words. |
DCFS |
2023 |
DBLP DOI BibTeX RDF |
|
| 18 | Qichen Wang 0005, Shu Zhang 0005 |
Hybrid heuristics: for the repetition-free longest common subsequence problem with index-gene. |
BIBM |
2023 |
DBLP DOI BibTeX RDF |
|
| 18 | Shu Zhang 0005, Qichen Wang 0005, Daming Zhu, Haitao Jiang |
Longest Order Conserved Repetition-free Subsequences. |
BIBM |
2023 |
DBLP DOI BibTeX RDF |
|
| 18 | Elena A. Petrova, Arseny M. Shur |
Branching Frequency and Markov Entropy of Repetition-Free Languages. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 18 | István Finta, Lóránt Farkas, Sándor Szénási |
Quantity Analysis on the Chaining of Repetition Free Words Considering the VDE Composition Rule. |
SACI |
2021 |
DBLP DOI BibTeX RDF |
|
| 18 | Elena A. Petrova, Arseny M. Shur |
Branching Frequency and Markov Entropy of Repetition-Free Languages. |
DLT |
2021 |
DBLP DOI BibTeX RDF |
|
| 18 | Matthias Horn, Marko Djukanovic, Christian Blum 0001, Günther R. Raidl |
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. |
OPTIMA |
2020 |
DBLP DOI BibTeX RDF |
|
| 18 | Alexander S. Gerasimov |
A repetition-free hypersequent calculus for first-order rational Pavelka logic. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 18 | Christian Blum 0001, Maria J. Blesa |
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. |
J. Heuristics |
2018 |
DBLP DOI BibTeX RDF |
|
| 18 | Radu Stefan Mincu, Alexandru Popa 0001 |
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants. |
SPIRE |
2018 |
DBLP DOI BibTeX RDF |
|
| 18 | Jochen Burghardt |
Repetition-Free Derivability from a Regular Grammar is NP-Hard. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 18 | Cristina G. Fernandes, Marcos A. Kiwi |
Repetition-free longest common subsequence of random sequences. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
| 18 | Christian Blum 0001, Maria J. Blesa |
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. |
EvoCOP |
2016 |
DBLP DOI BibTeX RDF |
|
| 18 | Mauro Castelli, Stefano Beretta 0001, Leonardo Vanneschi |
A hybrid genetic algorithm for the repetition free longest common subsequence problem. |
Oper. Res. Lett. |
2013 |
DBLP DOI BibTeX RDF |
|
| 18 | Hamoon Mousavi, Jeffrey O. Shallit |
Shortest Repetition-Free Words Accepted by Automata |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 18 | Marcos A. Kiwi, Cristina G. Fernandes |
Repetition-free longest common subsequence of random sequences |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 18 | Hamoon Mousavi, Jeffrey O. Shallit |
Shortest Repetition-Free Words Accepted by Automata. |
DCFS |
2013 |
DBLP DOI BibTeX RDF |
|
| 18 | Christian Blum 0001, Maria J. Blesa, Borja Calvo |
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. |
Artificial Evolution |
2013 |
DBLP DOI BibTeX RDF |
|
| 18 | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora |
On the parameterized complexity of the repetition free longest common subsequence problem. |
Inf. Process. Lett. |
2012 |
DBLP DOI BibTeX RDF |
|
| 18 | Carlos Eduardo Ferreira, Christian Tjandraatmadja |
A branch-and-cut approach to the repetition-free longest common subsequence problem. |
Electron. Notes Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 18 | Tero Harju, Dirk Nowotka |
Cyclically repetition-free words on small alphabets. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 18 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi |
Repetition-free longest common subsequence. |
Discret. Appl. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 18 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi |
Repetition-free longest common subsequence. |
Electron. Notes Discret. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 18 | Pascal Ochem |
Letter frequency in infinite repetition-free words. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 18 | Jean Berstel |
Growth of repetition-free words -- a review. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 18 | Juhani Karhumäki, Jeffrey O. Shallit |
Polynomial versus exponential growth in repetition-free binary words. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 18 | Gwénaël Richomme |
Some non finitely generated monoids of repetition-free endomorphisms. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 18 | Juhani Karhumäki, Jeffrey O. Shallit |
Polynomial versus Exponential Growth in Repetition-Free Binary Words |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 18 | Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov |
On Repetition-Free Binary Words of Minimal Density. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 18 | Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov |
On Repetition-Free Binary Words of Minimal Density. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 18 | Yuji Kobayashi |
Repetition-Free Words. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 12 | Martin Gebser, Benjamin Kaufmann, Torsten Schaub |
Solution Enumeration for Projected Boolean Search Problems. |
CPAIOR |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #39 of 39 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license