Contact:
Dr. Rustam Mubarakzjanov
Department of Theoretical Cybernetics
Kazan State University
420008 Kazan
Russia
Email: rustam.mubarakzjanov@ksu.ru
Research:
My sciencific interests are:
- computational complexity, in particular complexity of branching programs
(randomized, nondeterministic and deterministic)
- circuits verification
- automata theory
Publications:
Papers available on line:
- joint with Ch. Meinel,
Nonlinear Sifting of Decision Diagrams, In Proceedings of
the 2002 International Conference on VLSI, June 24 - 27,
Monte Carlo Resort, Las Vegas, Nevada, USA, 117-123.
- joint with J. Forster,
M. Krause, S. V. Lokam,
N. Schmitt, and H. U. Simon,
Relations Between Communication Complexity, Linear Arrangements,
and Computational Complexity,
In Proceedings of
the 21th Annual Conference on Foundations of Software
Technology and Theoretical Computer Science, 2001, LNCS 2245,
171-182.
-
Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable,
ECCC TR01-037, 2001
-
Lower Bounds for Randomized Branching Programs with a Big OBDD Part,
Universität Trier, Mathematik/Informatik, TR 00-13, 2000
-
Probabilistic OBDDs: on Bound of Width versus Bound of Error,
ECCC TR00-085, 2000
-
On Probabilistic OBDDs with Constant Width,
Proceedings of the Workshop on Computer Science and Information Technologies
CSIT'2000, Ufa, Russia,
September 18-23, 2000, V.2, pp.62-68.
- joint with
M.Karpinski,
Some separation problems on randomized OBDD,
CSIT'99, Moscow,Russia, 1999
- joint with
M.Karpinski,
A note on Las Vegas OBDDs,
ECCC TR99-009, 1999
- joint with
F.Ablayev and
M.Karpinski,
On BPP versus NP U
coNP for Ordered Read-Once Branching Programs ,
Randomized Algorithms, Brno, 1998 (preliminary version of the
paper in Theoretical Computer Science, 264(2001), pp. 127-137)
Some papers (in English)
-
Metric properties of random sequences, Lecture
Notes in Computer Science, N 278, 1987.-pp.332-333.
-
joint with J. Al'pin and B.Kotchkarev, On a stable generating
of random sequences by probabilistic automata, Lecture Notes in Computer
Science, N 278, 1987.- pp.17-20.
-
Finiteness of a set of non-collinear vectors generated
by a family of non-singular linear operators, Preprint 94/9,
Rostock University, Germany, 1994, 17 P.
-
joint with J.Alpin,The basises of weighted grapfs, Preprint
94/13, Rostock University, Germany, 1994, 13 P.
-
On the Sperner property of a poset of the subwords
of binary words, Preprint 94/14, Rostock University, Germany, 1994,
14 P.
-
Finiteness of a set of non-collinear vectors generated
by a family of linear operators (general case),Preprint 94/16,
Rostock University, Germany, 1994, 13 P.
- joint with J. Al'pin, The bases of weighted graphs,
Discrete
Mathematics, 175 (1-3), 1997, 1-11pp
-
A note on Las Vegas Read-Once Ordered Branching
Programs , CSIT'99, Moscow,
Russia, 1999
-
Finiteness of a set of non-collinear vectors
generated by a family of linear operators, Linear Algebra and its Applications,
294 (1-3) (1999) pp. 9-33
The whole list of publications (including abstracts of conference talks)
- English-Russian version
ps ,
pdf
- titles on Russian are translated to English
- German version
ps
- titles on Russian are translated to German
Number of publications - 40
Employment:
Assoc. Professor - Dept. of theoretical cybernetics,
Kazan
University, Russia
Links:
- Electronic
Colloquium on Computational Complexity (ECCC)
- GI-FG "Complexity"
- "Theorietag" (Workshop on
Complexity Theory, Data Structures and Efficient Algorithms)
- www.bdd-portal
-
Forschungsseminar Theoretische Informatik
Personal information
[go top]
|
