Fast allocation algorithms

Authors:
Dayid S. Johnson
Affiliations:
-
Venue:
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Year:
1972

Citing 0
Cited 4

Approximation algorithms for combinatorial problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
State complexity research and approximation

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Data communication channel capacity for multiple-buffered concentrators

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

This note defines a new equivalence relation among systems of recursion equations and a method for assigning context-free grammars to these systems, such that (1) The new equivalence implies strong equivalence; (2) Systems are equivalent in the new sense ...