

 

Book
F. BlanchetSadri,
Algorithmic Combinatorics on Partial Words,
Chapman & Hall/CRC Press, Boca Raton, FL, 2008.
Book Chapters
F. BlanchetSadri,
“Open Problems on Partial Words,”
In G. BelEnguix, M.D. JimenezLopez and C. MartinVide (Eds.),
New Developments in Formal Languages and Applications,
Ch. 2, Vol. 3, SpringerVerlag, Berlin, Heidelberg, 2008, pp 1158.
F. BlanchetSadri, B. Blakeley, J. Gunter, S. Simmons and E. Weissenstein,
“Classifying All Avoidable Sets of Partial Words of Size Two,”
In C. MartinVide (Ed.),
Scientific Applications of Language Methods,
Ch. 2, Imperial College Press, London, 2010, pp 59101.
Please reference the following related papers and the respective project websites, if applicable.

E. Allen, F. BlanchetSadri, C. Byrum, M. Cucuringu and R. Mercas,
“Counting bordered partial words by critical positions,”
The Electronic Journal of Combinatorics, Vol. 18, 2011, #P138.

E. Balkanski, F. BlanchetSadri, M. Kilgore and B. Wyatt, “Partial Word DFAs.”
In S. Konstantinidis (Ed.), CIAA 2013, 18th International Conference on Developments in Language Theory, July
1619, 2013, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, Vol. 7982, SpringerVerlag, Berlin, Heidelberg, 2013, pp 3647.

J. Berstel and L. Boasson,
“Partial words and a theorem of Fine and Wilf,”
Theoretical Computer Science, Vol. 218, 1999, pp 135141.

B. Blakely, F. BlanchetSadri, J. Gunter and N. Rampersad,
“On the complexity of deciding avoidability of sets of partial words,”
in V. Diekert and D. Nowotka (Eds.), DLT 2009,
13th International Conference on Developments in Language Theory, Stuttgart, Germany,
Lecture Notes in Computer Science, Vol. 5583, SpringerVerlag, Berlin Heidelberg, 2009, pp 113124
(expanded version in Theoretical Computer Science, Vol. 411, 2010, pp 42634271).

F. BlanchetSadri,
“Periodicity on partial words,”
Computers and Mathematics with Applications, Vol. 47, 2004, pp 7182.

F. BlanchetSadri,
“Codes, orderings, and partial words,”
Theoretical Computer Science, Vol. 329, 2004, pp 177202.

F. BlanchetSadri,
“Open problems on avoidable patterns in partial words,”
in P. Dömösi and Sz. Iván (Eds.), AFL 2011,
13th International Conference on Automata and Formal Languages,
August 1722, 2011, Debrecen, Hungary, Proceedings, pp 1224 (Invited Paper).

F. BlanchetSadri,
“Primitive partial words,”
Discrete Applied Mathematics, Vol. 148, 2005, pp 195213.

F. BlanchetSadri,
“Algorithmic combinatorics on partial words,”
International Journal of Foundations of Computer Science, Vol. 23, No. 6, 2012, pp 11891206 (Invited paper).

F. BlanchetSadri, E. Allen, C. Byrum, M. Cucuringu and R. Mercas,
“Counting distinct partial words,”
International Conference on Automata, Languages and Related Topics, Debrecen,
Hungary, October 2124, 2008.

F. BlanchetSadri, E. Allen, C. Byrum and R. Mercas,
“How many holes can an unbordered partial word contain?,”
in A.H. Dediu, A.M. Ionescu and C. MartinVide (Eds.), LATA 2009,
3rd International Conference on Language and Automata Theory and Applications, Tarragona, Spain,
Lecture Notes in Computer Science, Vol. 5457, SpringerVerlag,
Berlin, Heidelberg, 2009, pp 176187.

F. BlanchetSadri, E. Allen and J. Lensmire,
“On counting unbordered partial words with two holes.”

F. BlanchetSadri, D. Allums, J. Lensmire and B. J. Wyatt,
“Constructing minimal partial words of maximum subword complexity,”
in JM 2012, 14th Mons Days of Theoretical Computer Science, September 1114, 2012,
Universite catholique de Louvain, Belgium.

F. BlanchetSadri and A. R. Anavekar,
“Testing primitivity on partial words,”
Discrete Applied Mathematics, Vol. 155, 2007, pp 279287.
 F. BlanchetSadri, D. Bal and G. Sisodia,
“Graph connectivity, partial words, and a theorem of Fine and Wilf,”
Information and Computation, Vol. 206, 2008, pp 676693.

F. BlanchetSadri, K. Black and A. Zemke,
“Unary pattern avoidance in partial words dense with holes,”
in A.H. Dediu, S. Inenaga and C. MartinVide (Eds.), LATA 2011,
5th International Conference on Language and Automata Theory and Applications,
Lecture Notes in Computer Science, Vol. 6638, SpringerVerlag,
Berlin, Heidelberg, 2011, pp 155166.

F. BlanchetSadri, D. Blair and R. V. Lewis,
“Equations on partial words,”
in R. Kralovic and P. Urzyczyn (Eds.), MFCS 2006,
31st International Symposium on Mathematical Foundations of Computer Science,
Lecture Notes in Computer Science, Vol. 4162, SpringerVerlag,
Berlin, Heidelberg, 2006, pp 167178.

F. BlanchetSadri, D. Blair and R.V. Lewis,
“Equations on partial words,”
RAIROTheoretical Informatics and Applications, Vol. 43, 2009, pp 2339.

F. BlanchetSadri, M. Bodnar, N. Fox and J. Hidakatsu,
“A graph polynomial approach to primitivity,”
in A.H. Dediu, C. MartinVide and B. Truthe (Eds.), LATA 2013,
7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain,
Lectures Notes in Computer Science, SpringerVerlag,
Berlin, Heidelberg, 2013, to appear.

F. BlanchetSadri, L. Bromberg and K. Zipple,
“Remarks on two nonstandard versions of periodicity in words,”
International Journal of Foundations of Computer Science, Vol. 19, No. 6, 2008, pp 14391448.

F. BlanchetSadri, N.C. Brownstein, A. Kalcic, J. Palumbo and T. Weyand,
“Unavoidable sets of partial words,”
Theory of Computing Systems, Vol. 45, 2009, pp 381406.

F. BlanchetSadri, N.C. Brownstein and J. Palumbo,
“Two element unavoidable sets of partial words,”
in T. Harju, J. Karhumäki, and A. Lepistö (Eds.), DLT 2007,
11th International Conference on Developments in Language Theory, Turku, Finland,
Lectures Notes in Computer Science, Vol. 4588, SpringerVerlag,
Berlin, Heidelberg, 2007, pp 96107.

F. BlanchetSadri, J. Carraher and B. Shirey,
“Strong periods in partial words.”

F. BlanchetSadri, A. Chakarov and B. Chen,
“Minimum number of holes in unavoidable sets of partial words of size three,”
in C. S. Iliopoulos and W. F. Smyth (Eds.), IWOCA 2010,
21st International Workshop on Combinatorial Algorithms, July 2628, 2010, London, United Kingdom,
Lecture Notes in Computer Science, Vol. 6460, SpringerVerlag, Berlin, Heidelberg, 2011, pp 4355.

F. BlanchetSadri, A. Chakarov and B. Chen,
“Number of holes in unavoidable sets of partial words I,”
Journal of Discrete Algorithms, Vol. 14, 2012, pp 5564.

F. BlanchetSadri, A. Chakarov, L. Manuelli, J. Schwartz and S. Stich,
“Recurrent partial words,”
in P. Ambroz, S. Holub and Z. Masakova (Eds.), WORDS 2011,
8th International Conference on Words, September 1216, 2011, Prague, Czech Republic,
Electronic Proceedings of Theoretical Computer Science, Vol. 63, 2011, pp 7182.

F. BlanchetSadri, B. Chen and S. Munteanu,
“A note on constructing infinite binary words with polynomial subword complexity,”
RAIROTheoretical Informatics and Applications, Vol. 47, 2013, pp 195199.

F. BlanchetSadri, I. Choi and R. Mercas,
“Avoiding large squares in partial words,”
Theoretical Computer Science, Vol. 412, 2011, pp 37523758.

F. BlanchetSadri and A. Chriscoe,
“Local periods and binary partial words: an algorithm,”
Theoretical Computer Science, Vol. 314, 2004, pp 189216.

F. BlanchetSadri, E. Clader and O. Simpson,
“Border correlations of partial words,”
Theory of Computing Systems, Vol. 47, 2010, pp 179195.

F. BlanchetSadri, K. Corcoran and J. Nyberg,
“Periodicity properties on partial words,”
Information and Computation, Vol. 206, 2008, pp 10571064.

F. BlanchetSadri, M. Cordier, M. Cucuringu and R. Kirsch,
“Combinatorics on border correlations of partial words,”
International Conference on Automata, Languages and Related Topics, Debrecen, Hungary, October 2124, 2008.

F. BlanchetSadri and M. Cucuringu,
“Counting primitive partial words,”
Journal of Automata, Languages and Combinatorics, to appear.

F. BlanchetSadri, C.D. Davis, J. Dodge, R. Mercas and M. Moorefield,
“Unbordered partial words,”
Discrete Applied Mathematics, Vol. 157, 2009, pp 890900.

F. BlanchetSadri, B. De Winkle and S. Simmons,
“Abelian pattern avoidance in partial words,”
RAIROTheoretical Informatics and Applications, to appear.

F. BlanchetSadri and S. Duncan,
“Partial words and the critical factorization theorem,”
Journal of Combinatorial Theory, Series A, Vol. 109, 2005, pp 221245
(Awarded “Journal of Combinatorial Theory, Series A Top Cited Article 20052010”).

F. BlanchetSadri, J. Fowler, J. Gafni and K. Wilson,
“Combinatorics on partial word correlations,”
Journal of Combinatorial Theory, Series A, Vol. 117, 2010, pp 607624.

F. BlanchetSadri and N. Fox, “AbelianPrimitive
Partial words”. Theoretical Computer Science, Vol. 485, 2013, pp 1637.

F. BlanchetSadri and N. Fox, “On the Asymptotic Abelian Complexity of Morphic Words.”
In M.P. Beal and O. Carton (Eds.), DLT 2013, 17th International Conference on Developments in Language Theory, June
1821, 2013, ParisEst, France, Lecture Notes in Computer Science, Vol. 7907, SpringerVerlag, Berlin, Heidelberg, 2013, pp 94105.

F. BlanchetSadri, J. Gafni and K. Wilson,
“Correlations of partial words,”
in W. Thomas and P. Weil (Eds.), STACS 2007,
24th International Symposium on Theoretical Aspects of Computer Science, Aachen, Germany,
Lecture Notes in Computer Science, Vol. 4393, SpringerVerlag, Berlin, Heidelberg, 2007, pp 97108.

F. BlanchetSadri and R. A. Hegstrom,
“Partial words and a theorem of Fine and Wilf revisited,”
Theoretical Computer Science, Vol. 270, 2002, pp 401419.

F. BlanchetSadri, S. Ji and E. Reiland,
“Number of holes in unavoidable sets of partial words II.”
Journal of Discrete Algorithms, Vol. 14, 2012, pp 6573.

F. BlanchetSadri, Y. Jiao and J. Machacek,
“Squares in Binary Partial Words.”
in H.C. Yen and O. H. Ibarra (Eds.), DLT 2012,
16th International Conference on Developments in Language Theory, August 1417, 2012, Taipei, Taiwan,
Lecture Notes in Computer Science, Vol. 7410, SpringerVerlag, Berlin, Heidelberg, 2012, pp 404415.

F. BlanchetSadri, R. Jungers and J. Palumbo,
“Testing avoidability of sets of partial words is hard,”
Theoretical Computer Science, Vol. 410, 2009, pp 968972.

F. BlanchetSadri, J. Kim, R. Mercas, W. Severa and S. Simmons,
“Abelian squarefree partial words,”
in A.H. Dediu, H. Fernau and C. MartinVide (Eds.), LATA 2010,
4th International Conference on Language and Automata Theory and Applications,
May 2428, 2010, Trier, Germany, Lecture Notes in Computer Science, Vol. 6031,
SpringerVerlag, Berlin, Heidelberg, 2010, pp 94105.

F. BlanchetSadri, J. I. Kim, R. Mercas, W. Severa, S. Simmons and D. Xu,
“Avoiding abelian squares in partial words,”
Journal of Combinatiorial Theory, Series A, Vol. 119, 2012, pp 257270.

F. BlanchetSadri and J. Lazarow,
“Suffix trees for partial words and the longest common compatible prefix problem,”
in A.H. Dediu, C. MartinVide and B. Truthe (Eds.), LATA 2013,
7th International Conference on Language and Automata Theory and Applications,
April 25, 2013, Bilbao, Spain, Lecture Notes in Computer Science,
SpringerVerlag, Berlin, Heidelberg, 2013, to appear.

F. BlanchetSadri and J. Lensmire,
“On minimal Sturmian partial words,”
in C. Durr and T. Schwentick (Eds.), STACS 2011, 28th International Symposium on Theoretical Aspects of Computer Science, March 1012, 2011,
Dortmund, Germany, LIPIcs 9 Schloss DagstuhlLeibnizZentrum fur Informatik, 2011, pp 225236.

F. BlanchetSadri and J. Lensmire,
“On Minimal Sturmian Partial Words,” Discrete Applied Mathematics, Vol. 159, No. 8, 2011, pp 733745.

F. BlanchetSadri, A. Lohr and S. Scott,
“Computing the partial word avoidablity indices of ternary patterns.”
in S. Arumugam and B. Smyth (Eds.), IWOCA 2012, 23rd International Workshop on Combinatorial Algorithms, July 1921, 2012,
Tamil Nadu, India, Lecture Notes in Computer Science, Vol. 7643, SpringerVerlag, Berlin, Heidelberg, 2012, pp 206218.

F. BlanchetSadri and D.K. Luhmann,
“Conjugacy on partial words,”
Theoretical Computer Science, Vol. 289, 2002, pp 297312.

F. BlanchetSadri, T. Mandel and G. Sisodia,
“Periods in partial words: an algorithm,”
in C. S. Iliopoulos and W. F. Smyth (Eds.), IWOCA 2011, 22nd International Workshop on Combinatorial Algorithms, June 2022, 2011,
Victoria, British Columbia, Canada, Lecture Notes in Computer Science, Vol. 7056,
SpringerVerlag, Berlin, Heidelberg, 2011, pp 5770.

F. BlanchetSadri, T. Mandel and G. Sisodia,
“Periods in Partial Words: An Algorithm.”
Journal of Discrete Algorithms, Vol. 16, 2012, pp 113128.

F. BlanchetSadri and R. Mercas,
“A note on the number of squares in partial words with one hole,”
RAIROTheoretical Informatics and Applications, Vol. 43, 2009, pp 767774.

F. BlanchetSadri, R. Mercas, A. Rashin and E. Willett,
“An answer to a conjecture on overlaps in partial words using periodicity algorithms,”
in A.H. Dediu, A.M. Ionescu and C. MartinVide (Eds.), LATA 2009,
3rd International Conference on Language and Automata Theory and Applications,
Tarragona, Spain, Lecture Notes in Computer Science, Vol. 5457,
SpringerVerlag, Berlin, Heidelberg, 2009, pp 188199.

F. BlanchetSadri, R. Mercas, A. Rashin and E. Willett,
“Periodicity algorithms and a conjecture on overlaps in partial words.”
Theoretical Computer Science, Vol. 443, 2012, pp 3545.

F. BlanchetSadri, R. Mercas and G. Scott,
“Counting distinct squares in partial words,”
in E. CsuhajVarju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages,
Balatonfüred, Hungary, Proceedings, 2008, pp 122133.

F. BlanchetSadri, R. Mercas and G. Scott,
“Counting distinct squares in partial words,”
Acta Cybernetica, Vol. 19, 2009, pp 465477.

F. BlanchetSadri, R. Mercas and G. Scott,
“A generalization of Thue freeness for partial words,”
Theoretical Computer Science, Vol. 410, 2009, pp 793800.

F. BlanchetSadri, R. Mercas, S. Simmons and E. Weissenstein,
“Avoidable binary patterns in partial words,”
in A.H. Dediu, H. Fernau and C. MartinVide (Eds.), LATA 2010,
4th International Conference on Language and Automata Theory and Applications, May 2428, 2010, Trier, Germany,
Lecture Notes in Computer Science, Vol. 6031,
SpringerVerlag, Berlin, Heidelberg, 2010, pp 106117.

F. BlanchetSadri, R. Mercas, S. Simmons and E. Weissenstein,
“Avoidable binary patterns in partial words,”
Acta Informatica, Vol. 48, No. 1, 2011, pp 2541
("Erratum to: Avoidable Binary Patterns in Partial Words." Acta Informatica, Vol. 49, No. 1, 2012, pp 5354).

F. BlanchetSadri, R. Mercas and K. Wetzler,
“The threesquares lemma for partial words with one hole,”
WORDS 2009, the 7th International Conference on Words, September 1418, 2009, Salerno, Italy.

F. BlanchetSadri and R. Mercas,
“The threesquares lemma for partial words with one hole,”
Theoretical Computer Science, Vol. 428, 2012, pp 19.

F. BlanchetSadri and M. Moorefield,
“Pcodes of partial words.”

F. BlanchetSadri and S. Munteanu,
“Deciding Representability of Words of Equal Length in Polynomial Time.”
In T. Lecroq and L. Mouchard (Eds.), IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, July
1012, 2013, Rouen, France, Lecture Notes in Computer Science, Vol. 8288, SpringerVerlag, Berlin, Heidelberg, 2013, to appear.

F. BlanchetSadri, S. Nelson and A. Tebbe,
“On operations preserving primitivity of partial words with one hole,”
in P. Dömösi and Sz. Iván (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages,
August 1722, 2011, Debrecen, Hungary, Proceedings, pp 93107.

F. BlanchetSadri, T. Oey and T. Rankin,
“Computing weak periods of partial words,”
in E. CsuhajVarju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages,
Balatonfüred, Hungary, Proceedings, 2008, pp 134145.

F. BlanchetSadri, T. Oey and T. Rankin,
“Fine and Wilf’s theorem for partial words with arbitrarily many weak periods,”
International Journal of Foundations of Computer Science, Vol. 21, No. 5, 2010, 705722.

F. BlanchetSadri, J. Schwartz, S. Stich and B. J. Wyatt,
“Binary de Brujin partial words with one hole,”
in J. Kratochvil et al. (Eds.), TAMC 2010,
7th Annual Conference on Theory and Applications of Models of Computation,
June 711, 2010, Prague, Czech Republic,
Lecture Notes in Computer Science, Vol. 6108,
SpringerVerlag, Berlin, Heidelberg, 2010, pp 128138.

F. BlanchetSadri and B. Shirey,
“Periods and binary partial words,”
WORDS 2009, 7th International Conference on Words,
September 1418, 2009, Salerno, Italy.

F. BlanchetSadri and S. Simmons,
“Avoiding abelian powers in partial words,”
in G. Mauri and A. Leporati (Eds.), DLT 2011, 15th International Conference on Developments in Language Theory, July 1922,
2011p Milano, Italy, Lecture Notes in Computer Science, Vol. 6795, SpringerVerlag, Berlin, Heidelberg, 2011, pp 7081.

F. BlanchetSadri and S. Simmons,
“Deciding representability of sets of words of equal length.”
in M. Kutrib, N. Moreira and R. Reis (Eds.), DCFS 2012, 14th International Workshop on Descriptional Complexity of Formal Systems,
July 2325, 2012, Braga, Portugal, Lecture Notes in Computer Science, Vol. 7386,
SpringerVerlag, Berlin, Heidelberg, 2012, pp 103116 (expanded version to appear in Theoretical Computer Science).

F. BlanchetSadri and S. Simmons,
“Abelian pattern avoidance in partial words,”
in B. Rovan, V. Sassone and P. Widmayer (Eds.), MFCS 2012,
37th International Symposium on Mathematical Foundations of Computer Science,
August 2731, 2012, Bratislava, Slovakia,
Lecture Notes in Computer Science, Vol. 7464,
SpringerVerlag, Berlin, Heidelberg, 2012, pp 210221.

F. BlanchetSadri, S. Simmons and D. Xu,
“Abelian repetitions in partial words,”
Advances in Applied Mathematics, Vol. 48, 2012, pp 194214.

F. BlanchetSadri, S. Simmons, A. Tebbe and A. Veprauskas,
“Abelian periods, partial words, and an extension of a theorem of Fine and Wilf,”
RAIROTheoretical Informatics and Applications, Vol. 47, 2013, pp 215234.

F. BlanchetSadri, A. Tebbe and A. Veprauskas,
“Fine and Wilf’s theorem for abelian periods in partial words,”
in JM 2010, 13iemes Journees Montoises d'Informatique Theorique,
September 610, 2010, Amiens, France.

F. BlanchetSadri and N. D. Wetzler,
“Partial words and the critical factorization theorem revisited,”
Theoretical Computer Science, Vol. 385, 2007, pp 179192.

F. BlanchetSadri and B. Woodhouse,
“Strict Bounds for Pattern Avoidance.”
In M.P. Beal and O. Carton (Eds.), DLT 2013, 17th International Conference on Developments in Language Theory, June
1821, 2013, ParisEst, France, Lecture Notes in Computer Science, Vol. 7907, SpringerVerlag, Berlin, Heidelberg, 2013, pp 94105.

F. BlanchetSadri and B. Woodhouse,
“Strict Bounds for Pattern Avoidance.”
Theoretical Computer Science, Vol. 506, 2013, pp 1728.

G. Lischke,
“Restorations of punctured languages and similarity of languages,”
Mathematical Logic Quarterly, Vol. 52, 2006, pp 2028.

F. Manea and Robert Mercas,
“Freeness of partial words,”
Theoretical Computer Science, Vol. 389, 2007, pp 265277.

A.M. Shur and Y.V. Gamzova,
“Partial words and the periods’ interaction property.”
Izvestya RAN 68, 2004, pp 199222.
The following publications are suggested for developing a background in combinatorics on words.

J.P. Allouche and J. Shallit,
Automatic Sequences: Theory, Applications, Generalizations,
Cambridge University Press, Cambridge, 2003.

J. Berstel and D. Perrin,
Theory of Codes,
Academic Press, Orlando, FL, 1985.

C. Choffrut, J. Karhumaki,
“Combinatorics of Words,”
in G. Rozenberg, A. Salomaa (Eds.),
Handbook of Formal Languages,
Vol. 1, Ch. 6, SpringerVerlag, Berlin, 1997, pp 329438.

M. Crochemore, C. Hancart and T. Lecroq,
Algorithmique du texte,
Vuibert, 2001.

M. Crochemore, C. Hancart and T. Lecroq,
Algorithms on Strings,
Cambridge University Press, New York, NY, 2007.

M. Crochemore and W. Rytter,
Jewels of Stringology,
World Scientific, NJ, 2003.

M. Crochemore and W. Rytter,
Text Algorithms,
Oxford University Press, New York, NY, 1994.

A. de Luca and S. Varricchio,
Finiteness and Regularity in Semigroups and Formal Languages,
SpringerVerlag, Berlin, 1999.

A. de Luca and S. Varricchio,
“Regularity and Finiteness Conditions,”
in G. Rozenberg, A. Salomaa (Eds.),
Handbook of Formal Languages,
Vol. 1, Ch. 11,
SpringerVerlag, Berlin, 1997, pp 747810.

D. Gusfield,
Algorithms on Strings, Trees, and Sequences,
Cambridge University Press, Cambridge, 1997.

M. Lothaire,
Algebraic Combinatorics on Words,
Cambridge University Press, Cambridge, 2002.

M. Lothaire,
Applied Combinatorics on Words,
Cambridge University Press, Cambridge, 2005.

M. Lothaire,
Combinatorics on Words,
AddisonWesley, Reading, MA, 1983 and Cambridge University Press, Cambridge, 1997.

J. Setubal and J. Meidanis,
Introduction to Computational Molecular Biology,
PWS Publishing Company, Boston, MA, 1997.

H.J. Shyr,
Free Monoids and Languages,
Hon Min Book Company, Taichung, Taiwan, 1991.
These listed websites provide helpful information regarding the LaTeX document preparation system.
The websites below offer general information regarding web page development and html.
The following website is provided for assistance in creating effective Beamer presentations.
These books are strongly recommended as references for proper composition of papers of a mathematical nature.
The following organizations are essential means of support and development promotion.

Association for Computing Machinery, ACM
 IEEE Computer Society, IEEE CS
 IEEE Technical Committee on Mathematical Foundations of Computing,
IEEE TCMF
 American Mathematical Society, AMS
 Mathematical Association of America, MAA
 International Society for Computational Biology, ISCB

Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory,
ACM SIGACT

Society for Industrial and Applied Mathematics,
SIAM
These conferences are crucial to the discussion and exchange of competitive ideas.

ACMSIAM Symposium on Discrete Algorithms,
SODA

ACM Symposium on Theory of Computing,
STOC

AFL International Conference on Automata and Formal Languages,
AFL

Fundamentals of Computation Theory,
FCT

International Colloquium on Automata, Languages, and Programming,
ICALP

International Conference on Developments in Language Theory,
DLT

International Conference on Language and Automata Theory and Applications,
LATA

International Conference on Words,
WORDS

International Workshop on Combinatorial Algorithms,
IWOCA

International Workshop on Descriptional Complexity of Formal Systems,
DCFS

Journees Montoises d'Informatique Theorique,
JM

Latin American Theoretical Informatics Symposium,
LATIN

Mathematical Foundations of Computer Science,
MFCS

Society for Industrial and Applied Mathematics Conference on Discrete Mathematics,
SIAM

Symposium on Foundations of Computer Science,
FOCS

Symposium on Theoretical Aspects of Computer Science,
STACS

Theory and Applications of Models of Computation,
TAMC

Implementation and Application of Automata,
CIAA
The following journals provide a wealth of information, both historic and current, regarding the subject focus area and are vital communication media.
