Совместные публикации с иностранными математиками
Последнее изменение: 11/05/2012 19:00:00Выше уже многократно упоминалось о совместных статьях сотрудников кафедры с иностранными исследователями. Такие публикации эпизодически появлялись как минимум с начала 1970-х годов (см. выше, в разделе о Венгрии, рассказ о совместной статье А. Н. Трахтмана и Л. Редеи, опубликованной в 1971 году). В последние 20 лет их стало намного больше. Общее число таких публикаций заведомо превышает сотню. Приведем (вероятно неполный) список таких работ, опубликованных в 2003–2011 годах. Иностранные соавторы выделены жирным шрифтом.
2003
1. Almeida J., Volkov M. V. Profinite identities for finite semigroups whose subgroups belong to a given pseudovariety // J. Algebra and its Applications. 2003. Vol. 2, № 2. P. 137–163.
2. Ananichev D. S., Cherubini A., Volkov M. V. An inverse automata algorithm for recognizing 2-collapsing words // Lect. Notes Comp. Sci. 2003. Vol. 2450. P. 65–71.
3. Ananichev D. S., Cherubini A., Volkov M. V. Image reducing words and subgroups of free groups // Theor. Comp. Sci. 2003. Vol. 307, № 1. P. 77–92.
4. Bulatov A. A., Borner F., Krokhin A. A., Jeavons P. Quantified constraints: algorithms and complexity // Proc. 17th Int. Workshop on Computer Science Logic (CSL'03). [Lect. Notes Comp. Sci. Vol. 2803.] Springer-Verlag, Berlin-Heidelberg-N.Y. 2003. P. 58-70.
5. Bulatov A. A., Dalmau V. Towards a dichotomy theorem for the Counting Constraint Satisfaction Problem // Proc. 44 IEEE Symp. Foundations of Computer Science (FOCS'03). Cambridge, USA. 2003. P. 562–571.
6. Bulatov A. A., Jeavons P. An algebraic approach to multi-sorted constraints // Proc. 9th Int. Conf. on Principles and Practice of Constraint Programming (CP'03). Kinsale. 2003. P. 183–197.
7. Bulatov A. A., Jeavons P., Krokhin A. A. Functions of multiple-valued logic and the complexity of constraint satisfaction // Proc. 33rd IEEE Int. Symp. Multiple-Valued Logic (ISMVL'03). Tokyo. 2003. P. 343–354.
8. Cowan D., Reilly N. R., Trotter P. G., Volkov M. V. The finite basis problem for quasivarieties and pseudovarieties generated by regular semigroups. I. Quasivarieties generated by regular semigroups // J. Algebra. 2003. Vol. 267, № 2. P. 635–653.
9. Margolis S. W., Pin J.-E., Volkov M. V. Words guaranteeing minimal image // Words, Languages and Combinatorics. III. Singapore: World Scientific. 2003. P. 297–310.
2004
10. Кальб Г., Пильц Г., Шеврин Л. Н. Австрийская университетская система // Университетское управление: практика и анализ. 2004. № 4. С. 48–52.
11. Almeida J., Margolis S. W., Volkov M. V. Pseudovarieties of finite triangularizable semigroups // Международная алгебраическая конференция, посвященная 250-летию Московского университета и 75-летию кафедры высшей алгебры. Тезисы докладов. М.: МГУ, 2004. С. 148-149.
12. Bulatov A. A., Grohe M. The complexity of partition functions // Proc. 31st Int. Colloquium on Automata, Languages and Programming (ICALP’04) [Lect. Notes Comp. Sci. Vol. 3124.] 2004. P. 294-306.
13. Bulatov A. A., Chen H., Dalmau V. Learnability of relatively quantified generalized formulas // Proc. 15th Int. Conf. Algorithmic Learning Theory (ALT’04). [Lect. Notes Comp. Sci. Vol. 3244.] Berlin: Springer-Verlag, 2004. P. 365-379.
14. Margolis S. W., Pin J.-E., Volkov M. V. Words guaranteeing minimum image // Int. J. Found. Comp. Sci. 2004. Vol. 15, № 2. P. 259-276.
15. Plescheva S. V., Vertesi V. Complexity of identity checking problem for finite 0-simple semigroups // Междунар. алгебраическая конф., посвящ. 250-летию Московского ун-та и 75-летию кафедры высшей алгебры: Тез. докл. М.: МГУ, 2004. С. 249-250.
2005
16. Almeida J., Margolis S. W., Steinberg B., Volkov M. V. Modular and threshold subword counting and matrix representations of finite monoids // Words 2005, 5th Internat. Conf. on Words, 13-17 September 2005, Acts. [Publications du Laboratoire de Combinatoire et d'Informatique Mathematique, UQAM. Vol. 36] Universite du Quebec a Montreal, 2005. P. 65–78.
17. Almeida J., Margolis S. W., Volkov M. V. The pseudovariety of semigroups of triangular matrices over a finite field // RAIRO Theor. Informatics and Applications. 2005. Vol. 39, № 1. P. 31–48.
18. Almeida J., Plescheva S. V., Volkov M. V. An application of group generic implicit operators to the complexity of identity checking in finite semigroups // Междунар. алгебраич. конф.: Тез. докл. Екатеринбург: Изд-во Урал. ун-та, 2005. С. 17–18
19. Giudichi M., Li C. H., Praeger C. E., Seress A., Trofimov V. I. On minimal subdegree of finite primitive groups // Finite Geometries, Groups and Computation. Berlin: de Gruyter, 2005. P. 75–93.
20. Malnic A., Marusic D., Moller R. G., Seifter N., Trofimov,V. I., Zgrablic B. Highly arc transitive digraphs: reachability,topological groups // European J. of Combinatorics. 2005. Vol. 26, №1. P. 19–28.
21. Pastijn F., Volkov M. V. R-compatible varieties of semigroups // Acta Sci. Math. (Szeged). 2005. Vol. 71, № 3–4. P. 521–554.
2006
22. Плещева С. В., Вертеши В. Сложность задачи проверки тождеств в одной конечной 0-простой полугруппе // Изв УрГУ. 2006. № 43. (Серия компьютерные науки и информационные технологии. Вып. 1.) С. 65-95.
23. Almeida J., Volkov M. V. Subword complexity of profinite words and subgroups of free profinite semigroups // Int. J. Algebra and Computation. 2006. Vol. 16, № 2. P. 221–258.
24. Pastijn F., Volkov M. V. Cryptic varieties of semigroups // Semigroup Forum. 2006. Vol. 72, № 2. P. 159–189.
25. Pastijn F., Volkov M. V. D-compatible varieties of semigroups // J. Algebra. 2006. Vol. 299, № 1. P. 62–93.
2007
26. Giudici M., Li C. H., Praeger C. E., Seress A., Trofimov V. I. On limits of finite vertex-primitive graphs // J. Comb. Th. Ser. A. 2007. Vol. 114, № 1. P. 110–134.
27. Guo W., Kondratiev A. S. Finite groups in which the normalizers of sylow 3-subgroups have odd or primary indices // Int. Russian-Chinese Seminar «Algebra and Logics». Irkutsk, 2007. P. 142-144.
28. Imrich B., Klavzar S., Trofimov V. I. Distinguishing infinite graphs // Electron. J. Comb. 2007. Vol. 14 (1), # R36.
29. Lee E. W. H., Volkov M. V. On the structure of the lattice of combinatorial Rees-Sushkevich varieties // Proc. Int. Conf. «Semigroups and Formal Languages» in honour of the 65th birthday of Donald B. McAlister. New Jersey e.a.: World Scientific, 2007. P. 164–187.
30. Plescheva S. V., Vertesi V. Azonossagok 0-egyszeru felcsoportokban // Math. Lapok. 2007. № 2. P. 54–75.
31. Tang N., Guo W., Kabanov V. V. The influence of s-semipermutable subgroups on the structure of finite groups // Тр. Ин-та матем. и механ. УрО РАН. 2007. Т. 13, № 1. P. 191–196.
2008
32. Алмейда Ж., Волков М. В., Гольдберг С. В. Сложность задачи проверки тождеств в конечных полугруппах // Записки научных семинаров ПОМИ. (Исслед. по конструктивной математике и матем. логике. Вып. XI.) 2008. Т. 358. С. 5–22.
33. Го В., Махнев А. А., Падучих Д. В. Об автоморфизмах накрытий сильно регулярного графа с параметрами (81,20,1,6) // Межд. алгебраич. конф., посвящ. 100-летию со дня рожд. А. Г. Куроша: Тез. докл. М.: Изд-во мат.-мех. ф-та МГУ, 2008. С. 70–71.
34. Repnitskii V. B., Tuma J. Intervals in subgroup lattices of countable locally finite groups // Algebra Universalis. 2008. Vol. 59, № 1–2. P. 49–71.
2009
35. Го В., Махнев А. А., Падучих Д. В. Об автоморфизмах накрытий сильно регулярного графа с параметрами (81,20,1,6) // Матем. заметки. 2009. Т. 86, № 1. С. 22–36.
36. Almeida J., Steinberg B., Margolis S., Volkov M. V. Representation theory of finite semigroups, semigroup radicals and formal language theory // Trans. Amer. Math. Soc. 2009. Vol. 361, № 3. P. 1429–1461.
37. Almeida J., Volkov M. V., Goldberg S. V. Complexity of the identity checking problem for finite semigroups // J. Math. Sci. 2009. Vol. 158, № 5. P. 605–614.
38. Jackson M., Volkov M. V. Relatively inherently nonfinitely q-based semigroups // Trans. Amer. Math. Soc. 2009. Vol. 361, № 4. P. 2181–2206.
39. Jackson M., Volkov M. V. Undecidable problems for completely 0-simple semigroups // J. Pure and Applied Algebra. 2009. Vol. 213, № 10. P. 1961–1978.
40. Pribavkina E. V., Rodaro E. State complexity for prefix, suffix and bifix operators on regular languages // Proc. 11th Italian Conf. on Theor. Comp. Sci., Cremona, Italy. P. 182–188.
41. Pribavkina E. V., Rodaro E. Finitely generated synchronizing automata // Int. Conf. LATA 2009. [Lect. Notes Comp. Sci. Vol. 5457.] Berlin-Heidelberg-New York: Springer-Verlag. 2009. P. 672–683.
42. Seifter N., Trofimov V. I. Reachability relations and the structure of transitive digraphs // Electron. J. Combin., 2009. Vol. 16, № 1. Research Paper 26, 18 p.
43. Skvortsov E. S., Zaks Yu. I. Synchronizing random automata // AutoMathA 2009 (Automata: from Mathematics to Applications). Liege, Belgium, June 8–12, 2009. Liege: Univ. de Liege, 2009. P. 1–15.
2010
44. Almeida J., Margolis S. W., Steinberg B., Volkov M. V. Characterization of group radicals with an application to Mal'cev products // Illinois J. Math. 2010. Vol. 54, № 1. P. 199–221.
45. Easdown D., Sapir M. V., Volkov M. V. Periodic elements of the free idempotent generated semigroup on a biordered set // Int. J. Algebra and Comput. 2010. Vol. 20, № 2. P. 189–194.
46. Fernandes V. H., Volkov M. V. On divisors of semigroups of order-preserving mappings of a finite chain // Semigroup Forum. 2010. Vol. 81, № 3. P. 551–554.
47. Jackson M., Volkov M. V. The algebra of adjacency patterns: Rees matrix semigroups with reversion // Fields of Logic and Computation: Studies in Honor of Yuri Gurevich on the Occasion of His 70th Birthday. [Lect. Notes Comp. Sci. Vol. 6300.] Berlin: Springer-Verlag, 2010. P. 414–443.
48. Pribavkina E. V., Rodaro E. State complexity of prefix, suffix, bifix and infix operators on regular languages // 14th Int. Conf. on Developments in Language Theory. London, Ontario, Canada, August 17–20, 2010. [Lect. Notes Comp. Sci. Vol. 6624.] Berlin: Springer-Verlag, 2010. P. 376–386.
49. Skvortsov E. S., Zaks Yu. I. Synchronizing random automata // Discr. Math. and Theor. Comp. Sci. 2010. Vol. 12, № 4. P. 95–108.
50. Trofimov V. I., Weiss R. M. The group E6(q) and graphs with a locally linear group of automorphisms // Math. Proc. Cambridge Philos. Soc. 2010. Vol. 148, № 1. P. 1–32.
51. Trofimov V. I., Weiss R. M. Supplement to «The group E6(q) and graphs with a locally linear group of automorphisms» // Math. Proc. Cambridge Philos. Soc. 2010. Vol. 148, № 1. P. 33–45.
52. Volkov M. V., Mikhailova I. A., Sapir M. V. Lattice universal semigroup varieties // Int. Conf. on Algebras and Lattices: Abstracts. Prague, 2010. P. 28–29.
2011
53. Beal M.-P., Berlinkov M. V., Perrin D. A quadratic upper bound on the size of a synchronizing word in one-cluster automata // Int. J. Found. Comp. Sci. 2011. Vol. 22, № 2. P. 277–288.
54. Lee E. W. H., Volkov M. V. Limit varieties generated by completely 0-simple semigroups // Int. J. of Algebra and Comput. 2011. Vol. 21, № 1–2. P. 257–294.
55. Monzo R. A. R., Vernikov B. M. Identities determining varieties of semigroups with completely regular power // Semigroup Forum. 2011. Vol. 82, № 2. P. 384–388.
56. Pribavkina E. V., Rodaro E. Synchronizing automata with finitely many minimal synchronizing words // Information and Computation. 2011. Vol. 209, № 3. P. 568–579.
57. Pribavkina E. V., Rodaro E. Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete // Proc. 7th Int. Conf. Computability in Europe 2011 «Models of Computation in Context», Sofia, Bulgaria, June 27 – July 2, 2011. [Lect. Notes Comp. Sci. Vol. 6735.] Berlin: Springer-Verlag, 2011. P. 230–238.
58. Pribavkina E. V., Rodaro E. State complexity of code operators // Int. J. Found. Comp. Sci. 2011. Vol. 22, № 7. P. 1669–1681.
59. Pupyrev S. N., Nachmanson L., Bereg S., Holroyd A. E. Edge routing with ordered bundles // Proc. 19th Int. Symp. on Graph Drawing, Eindhoven, The Netherlands. [Lect. Notes Comp. Sci. Vol. 7034.] Berlin: Springer-Verlag, 2011. P. 135–146.
60. Pupyrev S. N., Nachmanson L., Kaufmann M. Improving layered graph layouts with edge bundling // 18th Int. Symp. on Graph Drawing. Konstanz, Germany, September 21–24, 2010. Revised Selected Papers. [Lect. Notes Comp. Sci. Vol. 6502.] Berlin: Springer-Verlag, 2011. P. 229–240.
61. Rampersad N., Shallit J., Shur A. M. Fife's theorem for (7/3)-powers // Proc. 8th Int. Conf. WORDS 2011. Electronic Proc. Theor. Comp. Sci. 2011. Vol. 63. P. 189–198.
62. Skvortsov E. S., Tipikin E. G. Experimental study of the shortest reset word of random automata // Proc. 16th Int. Conf. on Implementation and Application of Automata, Blois, France, July 13–16, 2011. [Lect. Notes Comp. Sci. Vol. 6807.] Berlin: Springer-Verlag, 2011. P. 290–298.
Смотрите также: