Donald F. Stanat

Affiliations:
  • University of North Carolina at Chapel Hill, USA


According to our database1, Donald F. Stanat authored at least 15 papers between 1971 and 1991.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1991
On non-preemptive scheduling of period and sporadic tasks.
Proceedings of the Real-Time Systems Symposium, 1991

1989
A Randomized Data Structure for Ordered Sets.
Adv. Comput. Res., 1989

1985
Chinese Rings and recursion.
ACM SIGCSE Bull., 1985

An FP Domain with Infinite Objects.
Proceedings of the Mathematical Foundations of Programming Semantics, 1985

1982
A pumping theorem for regular languages.
SIGACT News, 1982

1981
Optimal associative searching on a cellular computer.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

1979
Minimizing maximum flows in linear graphs.
Networks, 1979

1977
The Complexity of Finding Fixed-Radius Near Neighbors.
Inf. Process. Lett., 1977

Discrete mathematics in computer science.
Prentice Hall, ISBN: 978-0-13-216052-0, 1977

1975
Analysis of Range Searches in Quad Trees.
Inf. Process. Lett., 1975

1972
Approximation of Weighted Type 0 Languages by Formal Power Series
Inf. Control., November, 1972

A Modified Training Procedure for Linear Threshold Devices.
IEEE Trans. Computers, 1972

A Homomorphism Theorem for Weighted Context-Free Grammars.
J. Comput. Syst. Sci., 1972

Algebraic Parsing Techniques for Context-Free Languages.
Proceedings of the Automata, 1972

1971
Formal Languages and Power Series
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971


  Loading...