El'yar E. Gasanov

From MaRDI portal
Person:341821

Available identifiers

zbMath Open gasanov.elyar-eMaRDI QIDQ341821

List of research outcomes





PublicationDate of PublicationType
A lower bound on complexity of a locator cellular automaton solution for the closest neighbor search problem2024-02-16Paper
Forming of multi-colour images by cellular automata2020-08-12Paper
On stabilization of an automaton model of migration processes2020-07-30Paper
The algorithm for identical object searching with bounded worst-case complexity and linear memory2016-11-17Paper
Information storage and search complexity theory2014-06-06Paper
Theory of test recognition2008-06-12Paper
On automaton determinisation of sets of superwords2007-11-02Paper
A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem2006-11-20Paper
On the functional complexity of a two-dimensional interval search problem2004-08-30Paper
Solution of the problem of the optimal synthesis of information graphs for basic information search problems.2004-06-15Paper
https://portal.mardi4nfdi.de/entity/Q44462112004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q44301382003-10-05Paper
https://portal.mardi4nfdi.de/entity/Q47998392003-03-27Paper
A lower bound for the complexity of inclusive search in the class of tree circuits2001-11-22Paper
Estimates of the complexity of a method to solve the problem of inclusive search2001-05-10Paper
Modelling and search complexity in multiprocessor Systems2001-05-10Paper
A constant, in the worst case, algorithm to search for identical objects2001-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42571071999-10-05Paper
https://portal.mardi4nfdi.de/entity/Q31280131997-04-15Paper
A lower bound for the complexity of information networks for one partial order relation1997-03-23Paper
Instantly solvable search problems1997-03-23Paper
On a one-dimensional interval search problem1996-01-28Paper
https://portal.mardi4nfdi.de/entity/Q43083641995-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39798521992-06-26Paper
The complexity of a search in an array of Boolean vectors1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37827971987-01-01Paper

Research outcomes over time

This page was built for person: El'yar E. Gasanov