[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 115 || The implication problem for data dependenciesEven, Shimon; Kariv, Oded · 1981

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 115 || A sparse table implementation of priority queuesEven, Shimon; Kariv, Oded · 1981

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 115 || Impartiality, justice and fairness: The ethics of concurrent terminationEven, Shimon; Kariv, Oded · 1981

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 115 || On the generation of cryptographically strong pseudo-random sequencesEven, Shimon; Kariv, Oded · 1981

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 115 || Minimum s-t cut of a planar undirected network in o(n log2(n)) timeEven, Shimon; Kariv, Oded · 1981

Even, S./Kariv, O. (eds.), Automata, Languages and Programming. Eight Colloquium, Acre (Akko), Israel, 1981. Lecture Notes in Computer Science 115. Berlin-Heidelberg-New York, Springer-Verlag 1981. VIII, 552 S., DM 49,—. US $ 22.30. ISBN 3-540-10843-2W. Issel · 1982