The following pages link to El'yar E. Gasanov (Q341821):
Displayed 29 items.
- The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823) (← links)
- (Q783103) (redirect page) (← links)
- On stabilization of an automaton model of migration processes (Q783105) (← links)
- Forming of multi-colour images by cellular automata (Q785970) (← links)
- (Q1106016) (redirect page) (← links)
- The complexity of a search in an array of Boolean vectors (Q1106017) (← links)
- (Q1432379) (redirect page) (← links)
- Solution of the problem of the optimal synthesis of information graphs for basic information search problems. (Q1432380) (← links)
- Information storage and search complexity theory (Q2453382) (← links)
- Instantly solvable search problems (Q3125965) (← links)
- A lower bound for the complexity of information networks for one partial order relation (Q3125980) (← links)
- (Q3128013) (← links)
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem (Q3409863) (← links)
- (Q3506243) (← links)
- (Q3782797) (← links)
- (Q3979852) (← links)
- (Q4257107) (← links)
- (Q4308364) (← links)
- (Q4430138) (← links)
- (Q4446211) (← links)
- A lower bound for the complexity of inclusive search in the class of tree circuits (Q4522800) (← links)
- Modelling and search complexity in multiprocessor Systems (Q4522840) (← links)
- A constant, in the worst case, algorithm to search for identical objects (Q4522853) (← links)
- Estimates of the complexity of a method to solve the problem of inclusive search (Q4522876) (← links)
- (Q4799839) (← links)
- On the functional complexity of a two-dimensional interval search problem (Q4809560) (← links)
- On a one-dimensional interval search problem (Q4856881) (← links)
- On automaton determinisation of sets of superwords (Q5424056) (← links)
- A lower bound on complexity of a locator cellular automaton solution for the closest neighbor search problem (Q6155012) (← links)