Kohei Noshita

From MaRDI portal
(Redirected from Kohei Noshita)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 2036269 (Why is no real title available?)2004-02-02Paper
scientific article; zbMATH DE number 862676 (Why is no real title available?)1996-09-16Paper
A fast algorithm for translating combinator expressions with BC-chains
New Generation Computing
1987-01-01Paper
On the number of edges in the transitive closure of a graph
Discrete Applied Mathematics
1986-01-01Paper
scientific article; zbMATH DE number 3952006 (Why is no real title available?)1986-01-01Paper
The BC-chain method for representing combinators in linear space
New Generation Computing
1985-01-01Paper
scientific article; zbMATH DE number 3909738 (Why is no real title available?)1985-01-01Paper
A theorem on the expected complexity of dijkstra's shortest path algorithm
Journal of Algorithms
1985-01-01Paper
Translation of Turner combinators in O(n log n) space
Information Processing Letters
1985-01-01Paper
scientific article; zbMATH DE number 3913673 (Why is no real title available?)1984-01-01Paper
Predicting the Number of Distinct Elements in a Multiset
SIAM Journal on Computing
1982-01-01Paper
scientific article; zbMATH DE number 3784266 (Why is no real title available?)1982-01-01Paper
On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
Information Processing Letters
1978-01-01Paper
scientific article; zbMATH DE number 3574946 (Why is no real title available?)1975-01-01Paper
Median selection of 9 elements in 14 comparisons
Information Processing Letters
1974-01-01Paper
A Property of N-Graphs
IEEE Transactions on Computers
1971-01-01Paper


Research outcomes over time


This page was built for person: Kohei Noshita