- Oscar H. Ibarra. A note
concerning nondeterministic tape complexities. Journal of the
ACM, 19(4):608-612, October 1972.
References,
Citations,
etc.
- Oscar H. Ibarra and Chul E. Kim. Fast approximation algorithms for
the knapsack and sum of subset problems. Journal of the
ACM, 22(4):463-468, October 1975.
Citations.
- Oscar H. Ibarra and Chul E. Kim. Heuristic algorithms for scheduling
independent tasks on nonidentical processors. Journal of the
ACM, 24(2):280-289, April 1977.
- Oscar H. Ibarra. Reversal-bounded multicounter
machines and their decision problems. Journal of the
ACM, 25(1):116-133, January 1978.
Citations.
- Eitan M. Gurari and Oscar H. Ibarra. An NP-complete number-theoretic
problem. Journal of the ACM, 26(3):567-581, July 1979.
- Eitan M. Gurari and Oscar H. Ibarra. The complexity of the equivalence
problem for simple programs. Journal of the ACM,
28(3):535-560, July 1981.
- Eitan M. Gurari and Oscar H. Ibarra. Two-way counter machines and
Diophantine equations. Journal of the ACM,
29(3):863-873, July 1982.
Citations.
- Oscar H. Ibarra and Shlomo Moran. Probabilistic algorithms for
deciding equivalence of straight-line programs. Journal of the
ACM, 30(1):217-228, January 1983.
Citations.
- Oscar H. Ibarra and Brian S. Leininger. On the simplification and
equivalence problems for straight-line programs. Journal of
the ACM, 30(3):641-656, July 1983.
- Jik H. Chang, Oscar H. Ibarra, and Anastasios Vergis. On the power of one-way
communication. Journal of the ACM, 35(3):697-726, July
1988.
Citations.
Shortcuts: