|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 26th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1996, Santiago de Compostela, Spain, May 29-31, 1996, Proceedings, pp. 279-283, 1996, IEEE Computer Society, 0-8186-7392-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings, pp. 338-347, 1985, Springer, 3-540-15650-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 329-338, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Veikko Keränen |
On the k-Freeness of Morphisms on Free Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 180-188, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
26 | Piotr Dembinski, Jan Maluszynski |
Two Level Grammars: CF-Grammars with Equation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 171-187, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
24 | Veikko Keränen |
Abelian Squares are Avoidable on 4 Letters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 41-52, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Univers. Comput. Sci. ![In: J. Univers. Comput. Sci. 29(2), pp. 100-117, February 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings, pp. 181-196, 2023, Springer, 978-3-031-34325-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBM ![In: IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023, Istanbul, Turkiye, December 5-8, 2023, pp. 3382-3389, 2023, IEEE, 979-8-3503-3748-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Shu Zhang 0005, Qichen Wang 0005, Daming Zhu, Haitao Jiang |
Longest Order Conserved Repetition-free Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBM ![In: IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023, Istanbul, Turkiye, December 5-8, 2023, pp. 3438-3445, 2023, IEEE, 979-8-3503-3748-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Elena A. Petrova, Arseny M. Shur |
Branching Frequency and Markov Entropy of Repetition-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.02750, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SACI ![In: 15th IEEE International Symposium on Applied Computational Intelligence and Informatics, SACI 2021, Timisoara, Romania, May 19-21, 2021, pp. 431-436, 2021, IEEE, 978-1-7281-9544-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Elena A. Petrova, Arseny M. Shur |
Branching Frequency and Markov Entropy of Repetition-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings, pp. 328-341, 2021, Springer, 978-3-030-81507-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPTIMA ![In: Optimization and Applications - 11th International Conference, OPTIMA 2020, Moscow, Russia, September 28 - October 2, 2020, Proceedings, pp. 134-149, 2020, Springer, 978-3-030-62866-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Alexander S. Gerasimov |
A repetition-free hypersequent calculus for first-order rational Pavelka logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.04861, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Christian Blum 0001, Maria J. Blesa |
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 24(3), pp. 551-579, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Radu Stefan Mincu, Alexandru Popa 0001 |
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings, pp. 297-310, 2018, Springer, 978-3-030-00478-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Jochen Burghardt |
Repetition-Free Derivability from a Regular Grammar is NP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.05555, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Cristina G. Fernandes, Marcos A. Kiwi |
Repetition-free longest common subsequence of random sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 210, pp. 75-87, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization - 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 - April 1, 2016, Proceedings, pp. 46-57, 2016, Springer, 978-3-319-30697-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 41(6), pp. 644-649, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Hamoon Mousavi, Jeffrey O. Shallit |
Shortest Repetition-Free Words Accepted by Automata ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.2959, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Marcos A. Kiwi, Cristina G. Fernandes |
Repetition-free longest common subsequence of random sequences ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.4883, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Hamoon Mousavi, Jeffrey O. Shallit |
Shortest Repetition-Free Words Accepted by Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings, pp. 182-193, 2013, Springer, 978-3-642-39309-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Christian Blum 0001, Maria J. Blesa, Borja Calvo |
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artificial Evolution ![In: Artificial Evolution - 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21-23, 2013. Revised Selected Papers, pp. 79-90, 2013, Springer, 978-3-319-11682-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 112(7), pp. 272-276, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Carlos Eduardo Ferreira, Christian Tjandraatmadja |
A branch-and-cut approach to the repetition-free longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 36, pp. 527-534, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Tero Harju, Dirk Nowotka |
Cyclically repetition-free words on small alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 110(14-15), pp. 591-595, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(12), pp. 1315-1324, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 30, pp. 243-248, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Pascal Ochem |
Letter frequency in infinite repetition-free words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 380(3), pp. 388-392, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Jean Berstel |
Growth of repetition-free words -- a review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 340(1), pp. 280-290, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Juhani Karhumäki, Jeffrey O. Shallit |
Polynomial versus exponential growth in repetition-free binary words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 105(2), pp. 335-347, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Gwénaël Richomme |
Some non finitely generated monoids of repetition-free endomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 85(2), pp. 61-66, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Juhani Karhumäki, Jeffrey O. Shallit |
Polynomial versus Exponential Growth in Repetition-Free Binary Words ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR math.CO/0304095, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov |
On Repetition-Free Binary Words of Minimal Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 218(1), pp. 161-175, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov |
On Repetition-Free Binary Words of Minimal Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 683-692, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Yuji Kobayashi |
Repetition-Free Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 44, pp. 175-197, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
12 | Martin Gebser, Benjamin Kaufmann, Torsten Schaub |
Solution Enumeration for Projected Boolean Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27-31, 2009, Proceedings, pp. 71-86, 2009, Springer, 978-3-642-01928-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #39 of 39 (100 per page; Change: )
|
|