Kohei Noshita

Available identifiers

zbMath Open noshita.koheiMaRDI QIDQ802307

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4445667	2004-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q4871677	1996-09-16	Paper
A fast algorithm for translating combinator expressions with BC-chains	1987-01-01	Paper
On the number of edges in the transitive closure of a graph	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3721815	1986-01-01	Paper
A theorem on the expected complexity of dijkstra's shortest path algorithm	1985-01-01	Paper
Translation of Turner combinators in O(n log n) space	1985-01-01	Paper
The BC-chain method for representing combinators in linear space	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3686038	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3690214	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3962467	1982-01-01	Paper
Predicting the Number of Distinct Elements in a Multiset	1982-01-01	Paper
On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4144765	1975-01-01	Paper
Median selection of 9 elements in 14 comparisons	1974-01-01	Paper
A Property of N-Graphs	1971-01-01	Paper

Research outcomes over time

This page was built for person: Kohei Noshita