The following pages link to Yahiko Kambayashi (Q1062472):
Displayed 29 items.
- Synthesis of unnormalized relations incorporating more meaning (Q1062474) (← links)
- Organization of quasi-consecutive retrieval files (Q1133338) (← links)
- A longest common subsequence algorithm suitable for similar text strings (Q1168731) (← links)
- (Q1566748) (redirect page) (← links)
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750) (← links)
- New Bounds for Oblivious Mesh Routing (Q2755057) (← links)
- (Q3045962) (← links)
- Logic Design of Programmable Logic Arrays (Q3050335) (← links)
- Properties of Wired Logic (Q3757838) (← links)
- (Q4041461) (← links)
- (Q4190112) (← links)
- (Q4190113) (← links)
- A Simpler Parallel Algorithm for Graph Connectivity (Q4285909) (← links)
- (Q4408388) (← links)
- (Q4408396) (← links)
- (Q4409844) (← links)
- (Q4410622) (← links)
- (Q4473480) (← links)
- (Q4484167) (← links)
- (Q4535550) (← links)
- Making aggregate views self-maintainable (Q4541446) (← links)
- (Q4708149) (← links)
- (Q4749244) (← links)
- Routing Problems on the Mesh of Buses (Q4881411) (← links)
- The transduction method-design of logic networks based on permissible functions (Q5375494) (← links)
- On Finite-Memory Sequential Machines (Q5592257) (← links)
- Finite memory machines satisfying the lower bound of memory (Q5648257) (← links)
- The upper bound of K in K-lossless sequential machines (Q5652572) (← links)
- Controllability of sequential machines (Q5665130) (← links)