ÈÑÒÈÍÀ	Âîéòè â ñèñòåìó Ðåãèñòðàöèÿ
	Èíòåëëåêòóàëüíàÿ Ñèñòåìà Òåìàòè÷åñêîãî Èññëåäîâàíèÿ ÍÀó÷íî-òåõíè÷åñêîé èíôîðìàöèè
	Ãëàâíàÿ Ïîèñê Ñòàòèñòèêà Î ïðîåêòå Ïîìîùü

---

Theoretical Computer Scienceæóðíàë

Ñòàòüè, îïóáëèêîâàííûå â æóðíàëå ñòèëü:  îáû÷íûé | ÃÎÑÒ | plain | abbrv | acm | alpha | amsalpha | amsplain | apalike | ieeetr | siam

• 
  • 2012 On primary and secondary repetitions in words
  • Kolpakov R.
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 418, ñ. 71-81
• 
  • 2011 On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
  • Kolpakov R., Rao M.
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 412, ? 46, ñ. 6507-6516
• 
  • 2009 Overlap-free words and spectra of matrices
  • Jungers R.M., Protasov V.Yu, Blondel V.D.
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 410, ? 38-40, ñ. 3670-3684 DOI
• 
  • 2009 Searching for Gapped Palindromes
  • Kolpakov R., Kucherov G.
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 410, ? 51, ñ. 5299-5382
• 
  • 2007 Non-reducible descriptions for conditional Kolmogorov complexity
  • Muchnik Andrej, Shen Alexander, Ustinov Mikhail, Vereshchagin Nikolai, Vyugin Michael
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 384, ? 1, ñ. 77-86 DOI
• 
  • 2006 Clifford Lectures and the Mathematical Foundations of Programming Semantics - Preface
  • Artemov Sergei, Mislove Michael
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 357, ? 1-3, ñ. 1-3 DOI
• 
  • 2006 Justified common knowledge
  • Artemov Sergei
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 357, ? 1-3, ñ. 4-22 DOI
• 
  • 2006 Lambek calculus is NP-complete
  • Pentus Mati
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 357, ? 1-3, ñ. 186-201 DOI
• 
  • 2006 Referential logic of proofs
  • Krupski Vladmir N.
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 357, ? 1-3, ñ. 143-166
• 
  • 2005 Space efficient search for maximal repetitions
  • Gasieniec L., Kolpakov R., Potapov I.
  • â æóðíàëå Theoretical Computer Science, èçäàòåëüñòâî Elsevier BV (Netherlands), òîì 339, ? 1, ñ. 35-48

---

 

¿ 2011-2015 ÍÈÈ ìåõàíèêè ÌÃÓ.
Ëàáîðàòîðèÿ 404.
Âñå ïðàâà çàùèùåíû.
îáðàòíàÿ ñâÿçü

Ñîçäàòü îáðàùåíèå â ñëóæáó ïîääåðæêè ïîëüçîâàòåëåé