Browsing by Subject COMPUTER SCIENCE

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
or enter first few letters:  
Showing results 1 to 20 of 39  next >
Issue DateTitleAuthor(s)
2010The Algebra of Adjacency Patterns: Rees Matrix Semigroups with ReversionJackson, M.; Volkov, M.
2020Applications of artificial intelligenceVolozhanin, S. S.; Воложанин, С. С.
2014Are crossings important for drawing large graphs?Kobourov, S. G.; Pupyrev, S.; Saket, B.
2013A coloring problem for Sturmian and episturmian wordsDe, Luca, A.; Pribavkina, E. V.; Zamboni, L. Q.
2016Completely reachable automataBondar, E. A.; Volkov, M. V.
2011Constructing Premaximal Binary Cube-Free Words of Any LevelPetrova, E. A.; Shur, A. M.
2019Data science in communication sphereKolosov, D. V.; Kuznetsova, D. A.; Колосов, Д. В.; Кузнецова, Д. А.
2017Detecting one-variable patternsKosolobov, D.; Manea, F.; Nowotka, D.
2013Drawing permutations with few cornersBereg, S.; Holroyd, A. E.; Nachmanson, L.; Pupyrev, S.
2011Fife's Theorem for 7/3-powersRampersad, N.; Shallit, J.; Shur, A.
2014Happy edges: Threshold-coloring of regular latticesAlam, Md. J.; Kobourov, S. G.; Pupyrev, S.; Toeniskoetter, J.
2020Identities of the kauffman monoid K4 and of the Jones Monoid J4Kitov, N. V.; Volkov, M. V.
2021An Improved Algorithm for Fast K-Word Proximity Search Based on Multi-Component Key IndexesVeretennikov, A. B.
2011Improving Layered Graph Layouts with Edge BundlingPupyrev, S.; Nachmanson, L.; Kaufmann, M.
2020Lempel–Ziv-Like Parsing in Small SpaceKosolobov, D.; Valenzuela, D.; Navarro, G.; Puglisi, S. J.
2014MapSets: Visualizing embedded and clustered graphsEfrat, A.; Hu, Y.; Kobourov, S. G.; Pupyrev, S.
2011On Non-complete Sets and Restivo's ConjectureGusev, V. V.; Pribavkina, E. V.
2011On Pansiot Words Avoiding 3-RepetitionsGorbunova, I. A.; Shur, A. M.
2016On the probability of being synchronizableBerlinkov, M. V.
2013Ordering metro lines by block crossingsFink, M.; Pupyrev, S.