Conferences in DBLP
Farid M. Ablayev Possibilities of Probabilistic on-line Counting Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Gennady P. Agibalov Functional Systems on Semilattices. [Citation Graph (0, 0)][DBLP ] Conf ] Valery B. Alekseyev Recognition of Properties in K-Valued Logic and Approximate Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] A. A. Alexanyan Linearized Disjunctive Normal Forms of Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Ju. A. Al'pin , B. S. Kotchkarev , R. G. Mubarakzianov On a Stable Generating of Random Sequences by Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] S. V. Alyoshin Automata Classes Induced by Post Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev Effective Lower Bounds for Complexity of Some Classes of Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] A. V. Anisimov , Vladimir A. Oleshchuk Stable Finite Automata Mappings and Church-Rosser Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Marat M. Arslanov The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP ] Conf ] A. D. Astakhov Duality of Functions and Data in Algorithms Description. [Citation Graph (0, 0)][DBLP ] Conf ] G. V. Babikov On Direct Methods of Realization of Normal Algorithms by Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] D. N. Babin Verbal Operation on Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] A. S. Barashko The New Way of Probabilistic Compact Testing. [Citation Graph (0, 0)][DBLP ] Conf ] M. Yu. Baryshev , L. P. Zhil'tzova , A. A. Markov Computational Problems in Alphabetic Coding Theory. [Citation Graph (0, 0)][DBLP ] Conf ] S. A. Bogomolov On the Synthesis of "Irredundant" Automata from a Finite Set of Experiments. [Citation Graph (0, 0)][DBLP ] Conf ] A. A. Bolotov On the Equivalence Problem of States for Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Lothar Budach Arsenals and Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] R. G. Bukharajev , A. I. Enikeev , I. I. Makarov Chain-like Model of Programs Communication. [Citation Graph (0, 0)][DBLP ] Conf ] R. G. Bukharajev , I. R. Nasirov Structur Automata. [Citation Graph (0, 0)][DBLP ] Conf ] B. A. Buyevich On A-Completeness for some Classes of Bounded Determitate Functions. [Citation Graph (0, 0)][DBLP ] Conf ] G. E. Cejtlin , E. L. Jushchenko Structure Synthesis of Parallel Programs (Methodology and Tools). [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Marek Chrobak , Krzysztof Diks Saturating Flows in Networks. [Citation Graph (0, 0)][DBLP ] Conf ] I. P. Cuhrov On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Dassow , Helmut Jürgensen Soliton Automata. [Citation Graph (0, 0)][DBLP ] Conf ] A. I. Enikeev On Development of Dialogue Concurrent Systems. [Citation Graph (0, 0)][DBLP ] Conf ] S. M. Ermakov , B. B. Pokhodzey Discrete Analogue of the Neumann Method is not Optimal. [Citation Graph (0, 0)][DBLP ] Conf ] S. M. Ermakov , A. S. Rasulov A Simplest Probability Model of Asynchronous Iterations. [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Leonidovich Ershov , Sergei S. Goncharov , Dmitri Ivanovich Sviridenko Semantic Foundations of Programming. [Citation Graph (0, 0)][DBLP ] Conf ] N. V. Evtushenko Conditions for Existence of Nontrivial Parallel Decompositions of Sequential Machines. [Citation Graph (0, 0)][DBLP ] Conf ] A. B. Frolov On the Digital System Diagnostics under Uncertainty. [Citation Graph (0, 0)][DBLP ] Conf ] N. Z. Gabbasov The Implicating Vector Problem and its Applications to Probabilistic and Linear Automata. [Citation Graph (0, 0)][DBLP ] Conf ] E. E. Gasanov Some Asymptotic Evalutions of Complexity of Information Searching. [Citation Graph (0, 0)][DBLP ] Conf ] S. B. Gashkov On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Gashkov , V. M. Sidelnikov Codes, Connected With a Fraction Linear Functions Group and Their Decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Dainis Geidmanis On the Capabilities of Alternating and Nondeterministic Multitape Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Gibbons , Wojciech Rytter Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] M. I. Grinchuk On the Complexity of Elementary Periodical Functions Realized by Switching Circuites. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Dietrich O. F. Gronau Efficient Algorithmic Construction of Designs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans F. de Groote , Joos Heintz , Stefan Möhler , Heinz Schmidt On the Complexity of Lie Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] I. S. Grunsky A Characterization of Sequential Machines by Means of Their Behaviour Fragments. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis Some Observations of NP Complete Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Hemmerling Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Indermark , Herbert Klaeren Efficient Implementation of Structural Recursion. [Citation Graph (0, 0)][DBLP ] Conf ] M. A. Iordanskii Minimal Numberings of the Vertices of Trees - Approximate Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Jantzen , Manfred Kudlek , Klaus-Jörn Lange , Holger Petersen Dyck1 -Reductions of Context-free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Stasys Jukna Information Flow and Width of Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] L. M. Karahanjan , Alexander A. Sapozhenko On Some Operations of Partial Monotone Boolean Function Simplifying. [Citation Graph (0, 0)][DBLP ] Conf ] N. A. Karpova On Complexity of Computations with Limited Memory. [Citation Graph (0, 0)][DBLP ] Conf ] K. V. Kolyada On the Problem of Completeness for the Regular Mappings. [Citation Graph (0, 0)][DBLP ] Conf ] A. D. Korshunov The Number and the Structure of Typical Sperner and K-Non-Separable Families of Subsets of a Finite Set. [Citation Graph (0, 0)][DBLP ] Conf ] Nikolai K. Kossovsky A Chriterion of Polynominal Lower Bounds of Combinational Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Vadim E. Kotov , Ludmila Cherkasova On Generalized Process Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Kowalczyk , Pawel Urzyczyn Verification of Programs with Higher-Order Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] V. A. Kozlovskiy On the Complexity of Analyzing Experiments for Checking local Faults of an Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Kriegel , Stephan Waack Exponential Lower Bounds for Real-Time Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] V. B. Kudrjavitzev On the Conditions of Supplementicity in Functional Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Nikolai N. Kuzjurin On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables. [Citation Graph (0, 0)][DBLP ] Conf ] S. E. Kuznetsov , N. N. Nurmeev , F. I. Salimov The Problem of Minimal Implicating Vector. [Citation Graph (0, 0)][DBLP ] Conf ] R. Kh. Latypov Built-in Self-testing of Logic Circuits Using Imperfect Duplication. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Letichevsky Algebras with Approximation and Excursive Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Irina A. Lomazova Procedural Implementation of Algebraic Specifications of Abstract Data Types. [Citation Graph (0, 0)][DBLP ] Conf ] Sergej A. Lozkin , M. A. Koshkin On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Sergej A. Lozkin , A. A. Semenov On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Yu. Matijasevich Diophantine Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] M. V. Men'shikov , S. A. Zuev Estimation Algorithms of Infinite Graphs Percolation Threshold. [Citation Graph (0, 0)][DBLP ] Conf ] V. J. Mikhailov A Solving of Problems on Technological Models. [Citation Graph (0, 0)][DBLP ] Conf ] Grigori Mints Some Formal Systems of the Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail Ju. Moshkov On the Programs with Finite Development. [Citation Graph (0, 0)][DBLP ] Conf ] G. L. Movsisian , Zh. G. Margarian D-Representing Code Problem Solution. [Citation Graph (0, 0)][DBLP ] Conf ] R. G. Mubarakzianov Metric Properties of Random Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] V. I. Mukhin Adaptive Strategies for Partially Observable Controlled Ranom Series. [Citation Graph (0, 0)][DBLP ] Conf ] Ildar R. Nasyrov The Degrees of Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Conf ] V. N. Noskov Statistically Effective Algorithms for Automata Control. [Citation Graph (0, 0)][DBLP ] Conf ] V. I. Pereyaslavsky Linear Test Procedures of Recognition. [Citation Graph (0, 0)][DBLP ] Conf ] I. G. Perfilyeva Evaluatiobn of Cardinalities of Some Families of -Classes in Proh0 . [Citation Graph (0, 0)][DBLP ] Conf ] A. S. Podkolzin On the Temporal Complexity of Boolean Mappings Realizations iin Two-dimensional Homogeneous Automata. [Citation Graph (0, 0)][DBLP ] Conf ] R. I. Podlovcenko On Approximate Solution of the Problem of Equivalent Transformations of Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Sanguthevar Rajasekaran , John H. Reif Ranomized Parallel Computation. [Citation Graph (0, 0)][DBLP ] Conf ] N. P. Redkin On Checking Correctness of Some Classes of Control Systems. [Citation Graph (0, 0)][DBLP ] Conf ] I. K. Rystsov The Parallel Complexity of Some Arithemic and Algebraic Operations. [Citation Graph (0, 0)][DBLP ] Conf ] A. A. Safarian On Difficulties of Solving a Problem of Decomposition of the System of Boolean Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Sapozhenko The Number of Fuzzy Monotone Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Yu. Sazonov Bounded Set Theory and Polynominal Computability. [Citation Graph (0, 0)][DBLP ] Conf ] Victor L. Selivanov Index-Sets of Factor-Objects of the Post Numbering. [Citation Graph (0, 0)][DBLP ] Conf ] N. A. Shkalikova On Realization of Boolean Functions by Schemes Consisting of Checked Elements. [Citation Graph (0, 0)][DBLP ] Conf ] L. A. Sholomov The Complexity of the Sequential Choice Mechanism. [Citation Graph (0, 0)][DBLP ] Conf ] V. D. Soloviev Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability. [Citation Graph (0, 0)][DBLP ] Conf ] V. R. Solovieva The Reducibility of Random Sequences by Automata. [Citation Graph (0, 0)][DBLP ] Conf ] S. A. Stepanov , Igor Shparlinski On Structure Complexity of Normal Basis of Finite Field. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Stetsenko On Comparison of Boolean Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Stöhr A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] A. S. Strogalov On Metric Properties of Automata and Epsilon-Approximation of Automaton Mapping. [Citation Graph (0, 0)][DBLP ] Conf ] E. A. Sumenkov Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical Equation. [Citation Graph (0, 0)][DBLP ] Conf ] A. A. Sytnik Synthesis of Universal Finite Automats. [Citation Graph (0, 0)][DBLP ] Conf ] V. A. Taimanov On Cartesian Powers of P2 . [Citation Graph (0, 0)][DBLP ] Conf ] Daina Taimina Complexity Gaps of Turing Machines of Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Gerard Tel Distributed Infimum Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Thalheim On the Number of Keys in Relational Databases. [Citation Graph (2, 0)][DBLP ] Conf ] A. B. Ugol'nikov Complexity and Depth of Formulas Realizing Functions From Closed Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Dietmar Uhlig Reliable Networks from Unreliable Gates With Almost Minimal Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] P. I. Validov On the Standard and Pseudostandard Star Height of Regular Sets. [Citation Graph (0, 0)][DBLP ] Conf ] S. N. Vassiljev To Automation of Theorem Sythesis. [Citation Graph (0, 0)][DBLP ] Conf ] E. G. Vorobyova On Efficiency of Prefix Word-Encoding of Binary Messages. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Voronkov Deductive Program Synthesis and Markov's Principle. [Citation Graph (0, 0)][DBLP ] Conf ] V. M. Zacharov , S. E. Kuznetsov Complexity of the Problem of Approximation of Stochastic Matrix by Rational Elements. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir A. Zakharov To the Functional Equivalence of Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Zakharyaschev Theorem Proving in Intermediate and Modal Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Arkadij Zakrevskij The Analysis of Concurrent Logic Control Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] N. K. Zamov On a Connection Between the Resolution Method and the Inverse Method. [Citation Graph (0, 0)][DBLP ] Conf ] 