|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
46 | Mridul Nandi |
Characterizing Padding Rules of MD Hash Functions Preserving Collision Security. |
ACISP |
2009 |
DBLP DOI BibTeX RDF |
MD hash function, padding rule, suffix-free, collision resistant |
42 | Yo-Sub Han, Kai Salomaa |
State Complexity of Basic Operations on Suffix-Free Regular Languages. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Janusz A. Brzozowski, Corwin Sinnamon |
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. |
LATA |
2017 |
DBLP DOI BibTeX RDF |
|
33 | Janusz A. Brzozowski, Corwin Sinnamon |
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
26 | Chia-Wei Lin, Ja-Ling Wu |
On error detection and error synchronization of reversible variable-length codes. |
IEEE Trans. Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Hae-Sung Eom, Matús Palmovský |
Combined operations on prefix-free and suffix-free languages. |
NCMA |
2016 |
DBLP BibTeX RDF |
|
24 | Galina Jirásková, Peter Mlynárcik |
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. |
DCFS |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Nasour Bagheri, Praveen Gauravaram, Lars R. Knudsen, Erik Zenner |
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis. |
Int. J. Inf. Sec. |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam |
Some notes on fix-free codes. |
CISS |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Zsolt Kukorelly, Kenneth Zeger |
Sufficient conditions for existence of binary fix-free codes. |
IEEE Trans. Inf. Theory |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Janusz A. Brzozowski, Marek Szykula |
Syntactic complexity of suffix-free languages. |
Inf. Comput. |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Janusz A. Brzozowski, Marek Szykula |
Complexity of suffix-free regular languages. |
J. Comput. Syst. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej |
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. |
DCFS |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Janusz A. Brzozowski, Marek Szykula |
Complexity of Suffix-Free Regular Languages. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
19 | Janusz A. Brzozowski, Marek Szykula |
Upper Bound on Syntactic Complexity of Suffix-Free Languages. |
DCFS |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Janusz A. Brzozowski, Marek Szykula |
Complexity of Suffix-Free Regular Languages. |
FCT |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Janusz A. Brzozowski, Marek Szykula |
Upper Bound on Syntactic Complexity of Suffix-Free Languages. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
19 | Hae-Sung Eom, Yo-Sub Han |
State complexity of combined operations for suffix-free regular languages. |
Theor. Comput. Sci. |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Roland Cmorik, Galina Jirásková |
Basic Operations on Binary Suffix-Free Languages. |
MEMICS |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Yo-Sub Han, Kai Salomaa |
Nondeterministic State Complexity for Suffix-Free Regular Languages |
DCFS |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Yo-Sub Han, Kai Salomaa |
State complexity of basic operations on suffix-free regular languages. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Galina Jirásková, Pavol Olejár |
State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. |
NCMA |
2009 |
DBLP BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|