Arthur Sorkin

According to our database1, Arthur Sorkin authored at least 12 papers between 1973 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
LR(1) parser generation system: LR(1) error recovery, oracles, and generic tokens.
ACM SIGSOFT Softw. Eng. Notes, 2011

1996
Some Comments on 'The Priority-Based Coloring Approach to Register Allocation'.
ACM SIGPLAN Notices, 1996

Some Comments on Moral and Renvoise's "Global Optimization by Suppression of Partial Redundancies".
ACM SIGPLAN Notices, 1996

1989
Some Comments on ''A Solution to a Problem with Morel and Renvoise's 'Global Optimization by Suppression of Partial Redundancies'.
ACM Trans. Program. Lang. Syst., 1989

1984
Lucifer, a Cryptographic Algorithm.
Cryptologia, 1984

Measurement of cryptographic capability protection algorithms.
Comput. Secur., 1984

1983
Requirements for a secure terminal switch.
Comput. Secur., 1983

1978
Time required for garbage collection in retention block-structured languages.
Int. J. Parallel Program., 1978

On the time required for reference count management in retention block-structured languages. Part 2.
Int. J. Parallel Program., 1978

Time required for reference count management in retention block-structured languages. Part 1.
Int. J. Parallel Program., 1978

1973
Two PARALLEL EULER run time models: The dangling reference, impostor environment, and label problems.
Proceedings of the ACM-IEEE Symposium on High-Level-Language Computer Architecture, 1973

On the time required for retention.
Proceedings of the ACM-IEEE Symposium on High-Level-Language Computer Architecture, 1973


  Loading...